/*

By : Adien Gumilang
15/379903/TK/43168
*/
#include<stdio.h>
#include<math.h>
float f(float x);
float df (float x);
float f(float x) //fungsi yang akan dicari akar penyelesaiannya
{
return 4*pow(x,3.0)-15*pow(x,2.0)+17*x-6;
}
float df (float x) //turunan dari fungsi
{
return 12*pow(x,2.0)-30*x+17;
}
int main()
{
int itr, maxmitr;
//itr=iterasi maxmitr=maksimum iterasi
float h, x0, x1, allerr;
//h=f/df
x0=x awal
x1= x ke i+1
allerr=allowed error
printf("\tNILAI DARI MAKSIMUM FUNGSI\n");
printf("\t
4x^3-15x^2+17x-6\n");
printf("\t
(NEWTON-RAPHSON)\nBy : Adien Gumilang\n15/379903/TK/43168\n")
;
printf("\t--------------------------\n");
printf("masukkan :");
printf("\nx0 =");
scanf("%f", &x0);
printf("error (dalam %%)=");
scanf("%f", &allerr);
printf("iterasi maksimal =");
scanf("%d", &maxmitr);
printf("\n");
for (itr=1; itr<=maxmitr; itr++)
{
h=f(x0)/df(x0);
x1=x0-h;
printf("\niterasi %d\n**************************************************
***************************************\n\n",itr);
printf(" 4x^3-15x^2+17x-6\n");
printf("h=----------------\n");
printf("
12x^3-30x+17\n\n");
printf(" %f-%f+%f-6\n",4*pow(x0,3),15*pow(x0,2),17*x0);
printf("h=--------------------------------\n");
printf(" %f-%f+17\n\n",12*pow(x0,3),30*x0);
printf("h=%f\n\n",h);
printf("x(i+1)=xi-h\n");
printf("x(i+1)=%f-%f\n",x0,h);
printf("x(i+1)=%f\n",x1);
printf("Pada iterasi ke. %3d, x = %9.6f
error = %f%%\n\n", itr, x
1, 100*fabs((x1-x0)/x1));
printf("****************************************************************
*************************\n");

printf("****************************************************************
*************************");
if (fabs((x1-x0)/x1)< allerr/100)
{
printf("\nSetelah %3d iterasi, root = %8.6f, dengan error = %f%%\n",
itr, x1, 100*fabs((x1-x0)/x1));
printf("nilai maksimum dari fungsi adalah = %f", -2*powf(x1,6)-1.5*p
owf(x1, 4)+10*x1+2);
return 0;
}
x0=x1;
}
printf("\nnilai error adalah = %f%%",100*fabs((x1-x0)/x1));
printf("\ntidak ditemukan solusi konvergen atau jumlah iterasi kurang\n");
return 1;
}