Calculation of all the roots of the nonlinear equation F(X)=0 in the interval (A, B) by the bitwise approximation method
Calculation of all the roots of the nonlinear equation F(X)=0 in the interval (A, B) by the bitwise approximation method
OS
Windows
DEVELOPMENT
Microsoft Visual C++ 2008
LANGUAGE
C++
PRICE
7 USD
Description
The bitwise approximation method allows you to find all the roots on the segment [a, b] with a given accuracy e. This method refers to step methods, based on the fact that the current approximation to the solution Xn at each new step is incremented by h as Xn=Xn+h and F(Xn) is calculated. If the new value of the objective function is 'better' than the previous one, then the variable X is given a new increment. If the function is 'deteriorated', then the search in this direction is completed. The program contains the values Xi of the equation i= 0.2718*X*exp(-10*X)+0.00000001*(exp(20*X)-1), F(X)=(1-X)/125-i, but this equation can be changed to another equation.
Images
ATTENTION
To receive the entire project with a program code, you must order a program. We can write this program in the programming language you need and with the program conditions you set, for this you need to order the program (the Order button) and we will contact you shortly.