Skip to main content

Regula Falsi or False Position Method Using C++



f(x)=X3-2X-5
f(2) = -1
f(3) = 16
x=(af(b) - bf(a))/((f(b)-f(a));
///Bismillahir Rahmanir Rahim
///Author: Tanvir Ahmmad
///CSE, Islamic University, Bangladesh
#include<iostream>
using namespace std;
typedef long long ll;
double func(double num)
{
    return ((3*num*num)-(6*num)+2);
}
int main()
{
    char ch=253;
    double a,b,out,tol;
    cout<<"Given equation : f(x) = 3X"<<ch<<"-6X+2"<<endl;
    cout<<"Given two input of x such that f(x) is negative and positive and there difference is just one"<<endl;
    while(1)
    {
        cin>>a>>b;
        if(a==1 && b==2)
        {
            cout<<"Given correct output"<<endl;
            break;
        }
        else
        {
            cout<<"f(a)="<<func(a)<<endl;
            cout<<"f(b)="<<func(b)<<endl;
            cout<<"Incorrect Output"<<endl;
        }
    }
    int step,stp=0;
    cout<<"How much step you want to work : "<<endl;
    cin>>step;
    cout<<"Enter tolerable fraction : "<<endl;
    cin>>tol;
    while(step--)
    {
        out=((a*func(b))-(b*func(a)))/(func(b)-func(a));
        cout<<++stp<<" - iteration "<<out<<" and f(x) = "<<func(out)<<endl;
        if(abs(func(out))<=tol)
        {
            cout<<"After "<<stp<<" step using tolerable fraction root of 3X"<<ch<<"-6X+2 = "<<out<<endl;
            break;
        }
        else if(func(out)<0) a=out;
        else if(func(out)>0) b=out;
        else
        {
            cout<<"After "<<stp<<" step root of 3X"<<ch<<"-6X+2 = "<<out<<endl;
        }
    }
    if(step<=0) cout<<"After using all step this equation's root will be "<<out<<endl;
    return 0;
}
///Alhamdulillah


Labels:

Comments

Post a Comment

Popular posts from this blog

Codeforces Beta Round #53 (A. Square Earth?)

Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b using   namespace  std; typedef   long   long ...
Post a Comment
Read more

Codeforces round 1676(A. Lucky?)

Just count the  first three  &  last three  number ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is repres...
Post a Comment
Read more

AtCoder Beginner Contest 237(D - LR insertion)

Problem solving criteria:stack (https://www.cplusplus.com/reference/stack/stack/) Think about the first input: LRRLR That means  0 ->(L)-> 1 ->(R)-> 2 ->(R)-> 3 ->(L)-> 4 ->(R)-> 5 so we just need to save first R right number  in  an  array (vector) & other number saves  in  a stack. 0 ->(L)-> 1   general  array (vector)       stack( 0 )   top of stack= 0 1 ->(R)-> 2   general  array (vector)= 1      stack( 0 )   top of stack= 0 2 ->(R)-> 3   general  array (vector)= 1 , 2    stack( 0 )   top of stack= 0 3 ->(L)-> 4   general  array (vector)= 1 , 2    stack( 0 , 4 )...
Post a Comment
Read more