برنامه پیدا کردن ریشه های تابع با روش نابجایی — راهنمای کاربردی

1// C++ program for implementation of Bisection Method for 
2// solving equations 
3#include<bits/stdc++.h> 
4using namespace std; 
5#define MAX_ITER 1000000 
6  
7// An example function whose solution is determined using 
8// Bisection Method. The function is x^3 - x^2  + 2 
9double func(double x) 
10{ 
11    return x*x*x - x*x + 2; 
12} 
13  
14// Prints root of func(x) in interval [a, b] 
15void regulaFalsi(double a, double b) 
16{ 
17    if (func(a) * func(b) >= 0) 
18    { 
19        cout << "You have not assumed right a and b\n"; 
20        return; 
21    } 
22  
23    double c = a;  // Initialize result 
24  
25    for (int i=0; i < MAX_ITER; i++) 
26    { 
27        // Find the point that touches x axis 
28        c = (a*func(b) - b*func(a))/ (func(b) - func(a)); 
29  
30        // Check if the above found point is root 
31        if (func(c)==0) 
32            break; 
33  
34        // Decide the side to repeat the steps 
35        else if (func(c)*func(a) < 0) 
36            b = c; 
37        else
38            a = c; 
39    } 
40    cout << "The value of root is : " << c; 
41} 
42  
43// Driver program to test above function 
44int main() 
45{ 
46    // Initial values assumed 
47    double a =-200, b = 300; 
48    regulaFalsi(a, b); 
49    return 0; 
50}

1// java program for implementation  
2// of Bisection Method for 
3// solving equations 
4import java.io.*; 
5  
6class GFG { 
7  
8    static int MAX_ITER = 1000000; 
9  
10    // An example function whose  
11    // solution is determined using 
12    // Bisection Method. The function 
13    // is x^3 - x^2 + 2 
14    static double func(double x) 
15    { 
16        return (x * x * x - x * x + 2); 
17    } 
18  
19    // Prints root of func(x)  
20    // in interval [a, b] 
21    static void regulaFalsi(double a, double b) 
22    { 
23        if (func(a) * func(b) >= 0)  
24        { 
25            System.out.println("You have not assumed right a and b"); 
26        } 
27        // Initialize result 
28        double c = a;  
29  
30        for (int i = 0; i < MAX_ITER; i++)  
31        { 
32            // Find the point that touches x axis 
33            c = (a * func(b) - b * func(a))  
34                 / (func(b) - func(a)); 
35  
36            // Check if the above found point is root 
37            if (func(c) == 0) 
38                break; 
39  
40            // Decide the side to repeat the steps 
41            else if (func(c) * func(a) < 0) 
42                b = c; 
43            else
44                a = c; 
45        } 
46        System.out.println("The value of root is : " + (int)c); 
47    } 
48  
49    // Driver program  
50    public static void main(String[] args) 
51    { 
52        // Initial values assumed 
53        double a = -200, b = 300; 
54        regulaFalsi(a, b); 
55    } 
56} 
57  
58// This article is contributed by vt_m

1# Python3 implementation of Bisection 
2# Method for solving equations 
3  
4MAX_ITER = 1000000
5  
6# An example function whose solution 
7# is determined using Bisection Method.  
8# The function is x^3 - x^2 + 2 
9def func( x ): 
10    return (x * x * x - x * x + 2) 
11  
12# Prints root of func(x) in interval [a, b] 
13def regulaFalsi( a , b): 
14    if func(a) * func(b) >= 0: 
15        print("You have not assumed right a and b") 
16        return -1
17      
18    c = a # Initialize result 
19      
20    for i in range(MAX_ITER): 
21          
22        # Find the point that touches x axis 
23        c = (a * func(b) - b * func(a))/ (func(b) - func(a)) 
24          
25        # Check if the above found point is root 
26        if func(c) == 0: 
27            break
28          
29        # Decide the side to repeat the steps 
30        elif func(c) * func(a) < 0: 
31            b = c 
32        else: 
33            a = c 
34    print("The value of root is : " , '%.4f' %c) 
35  
36# Driver code to test above function 
37# Initial values assumed 
38a =-200
39b = 300
40regulaFalsi(a, b) 
41  
42# This code is contributed by "Sharad_Bhardwaj". 

1// C# program for implementation  
2// of Bisection Method for 
3// solving equations 
4using System; 
5  
6class GFG { 
7  
8    static int MAX_ITER = 1000000; 
9  
10    // An example function whose  
11    // solution is determined using 
12    // Bisection Method. The function 
13    // is x^3 - x^2 + 2 
14    static double func(double x) 
15    { 
16        return (x * x * x - x * x + 2); 
17    } 
18  
19    // Prints root of func(x)  
20    // in interval [a, b] 
21    static void regulaFalsi(double a, double b) 
22    { 
23        if (func(a) * func(b) >= 0)  
24        { 
25            Console.WriteLine("You have not assumed right a and b"); 
26        } 
27        // Initialize result 
28        double c = a;  
29  
30        for (int i = 0; i < MAX_ITER; i++)  
31        { 
32            // Find the point that touches x axis 
33            c = (a * func(b) - b * func(a))  
34                / (func(b) - func(a)); 
35  
36            // Check if the above found point is root 
37            if (func(c) == 0) 
38                break; 
39  
40            // Decide the side to repeat the steps 
41            else if (func(c) * func(a) < 0) 
42                b = c; 
43            else
44                a = c; 
45        } 
46  
47        Console.WriteLine("The value of root is : " + (int)c); 
48    } 
49  
50    // Driver program  
51    public static void Main(String []args) 
52    { 
53        // Initial values assumed 
54        double a = -200, b = 300; 
55        regulaFalsi(a, b); 
56    } 
57} 
58  
59// This code is contributed by Sam007.