Finding all the roots of the equation F(X)=0 from A to B using the Rybakov method
Finding all the roots of the equation F(X)=0 from A to B using the Rybakov method
OS
Windows
DEVELOPMENT
Microsoft Visual C++ 2008
LANGUAGE
C++
PRICE
7 USD
Description
Rybakov’s method can also be considered as a modified Newton method by replacing F'(Xn) with a certain number M>=F'(ex), where ex is the value of X on the interval [A, B] at which F'(X) is maximal. When M>F'(ex), convergence is not violated, but slows down. The Rybakov method is convenient for finding all the roots of an equation on a segment [A, B]. The program contains the value X of the equation F(X)=X^4-13*X^2+36, 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.