Différences
Ci-dessous, les différences entre deux révisions de la page.
teaching:methcalchim:root-finding_algorithm [2018/10/19 09:37] – créée villersd | teaching:methcalchim:root-finding_algorithm [2018/10/19 09:58] (Version actuelle) – villersd | ||
---|---|---|---|
Ligne 1: | Ligne 1: | ||
====== Root findings : equations f(x) = 0 ====== | ====== Root findings : equations f(x) = 0 ====== | ||
+ | <note tip> | ||
+ | Algorithm used to find roots of an equation use iterations, and a numerical criterion to accept a solution when a sufficiently accurate value is reached. The rate of convergence depends on the used method and the function f(x). Some methods (Newton-Raphson) need the derivative of the function f(x). | ||
+ | </ | ||
* Polynomial equations : [[wp> | * Polynomial equations : [[wp> | ||
Ligne 9: | Ligne 12: | ||
* [[wp> | * [[wp> | ||
* [[wp> | * [[wp> | ||
+ | * Chapter 9 in the book " | ||
+ | * 9.0 Introduction | ||
+ | * 9.1 Bracketing and Bisection | ||
+ | * 9.2 Secant Method, False Position Method, and Ridders' | ||
+ | * 9.4 Newton-Raphson Method Using Derivative | ||
+ | * 9.5 Roots of Polynomials | ||
+ | * Python [[https:// | ||
+ | * [[https:// | ||
+ | ===== Applications ===== | ||
+ | * ... | ||
+ | ===== Références ===== | ||
+ | * Numerical recipes, The Art of Scientific Computing 3rd Edition, William H. Press, Saul A. Teukolsky, William T. Vetterling, Brian P. Flannery, 2007, isbn: 9780521880688 | ||
+ | * [[http:// | ||
+ | * in C : [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | * Chapter 9 : Root finding an nonlinear sets of equations |