forked from DilipKumarGangwar/Numerical-Methods-CBNST
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Regula_Falsi_Method.c
63 lines (56 loc) · 1.37 KB
/
Regula_Falsi_Method.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//C Program to Implement Regula Falsi Method
#include<stdio.h>
#include<math.h>
#define EPSILON 0.0001 //3 decimal places
float findValueAt(float x)
{
return x*x*x - 2*x -5;
}
float findX(float x1,float x2)
{
// return (x1+x2)/2; //for Bisection Method
return (x1*findValueAt(x2) - x2 * findValueAt(x1)) / (findValueAt(x2) - findValueAt(x1));
}
int main()
{
int maxIteration,i=1;
float x1,x2,x3,x;
printf("Enter Maximum no of Iterations\n");
scanf("%d",&maxIteration);
//Finding x1 and x2
do
{
printf("Enter the value of x1 and x2(starting boundary->Initial Roots)");
scanf("%f%f",&x1,&x2);
if(findValueAt(x1)*findValueAt(x2)>0)
{
printf("Roots are Invalid\n");
continue;
}
else
{
printf("Roots Lie between %f and %f\n",x1,x2);
break;
}
} while(1);
//find the Intermediate point
x = findX(x1,x2);
do
{
if(findValueAt(x)*findValueAt(x1)<0)
x2=x;
else
x1=x;
printf("Iterations=%d Root=%f\n",i,x);
x3 = findX(x1,x2);
if(fabs(x3-x)<EPSILON)
{
printf("Root=%f Total Iterations=%d",x,i);
return 0;
}
x=x3; //Important
i++;
}while(i<=maxIteration);
printf("Root=%f Total Iterations=%d",x,--i);
return 0;
}