User:Amatdiou/Books/Root-finding algorithms
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Root-finding algorithms
[edit]- Root-finding algorithm
- Aberth method
- Alpha max plus beta min algorithm
- Bairstow's method
- Bisection method
- Brent's method
- Broyden's method
- Durand–Kerner method
- False position method
- Fast inverse square root
- Fixed-point iteration
- Graeffe's method
- Geometry of roots of real polynomials
- Halley's method
- Householder's method
- Illinois algorithm
- Integer square root
- Inverse quadratic interpolation
- Jenkins–Traub algorithm
- Laguerre's method
- Lehmer–Schur algorithm
- Methods of computing square roots
- Muller's method
- Newton's method
- Nth root algorithm
- Rational root theorem
- Ridders' method
- Ruffini's rule
- Secant method
- Shifting nth root algorithm
- Sidi's generalized secant method
- Solving quadratic equations with continued fractions
- Splitting circle method
- Steffensen's method