User:Amlan g/Books/Computer Application in Polynomials


Computer Application in Polynomials

Solutions of Equations

Polynomials
Polynomial
Equation
Roots
Zero of a function
Square root
Methods of computing square roots
Integer square root
Rational root theorem
Ruffini's rule
Geometry of roots of real polynomials
Numerical Methods
Aberth method
Bisection method
Bailey's method (root finding)
Brent's method
Broyden's method
Bairstow's method
Durand–Kerner method
False position method
Fast inverse square root
Fixed-point iteration
Graeffe's method
Halley's method
Householder's method
Inverse quadratic interpolation
Laguerre's method
Muller's method
Newton's method
Ridders' method
Secant method
Sidi's generalized secant method
Solving quadratic equations with continued fractions
Splitting circle method
Steffensen's method
Spouge's approximation
Existing Computer Algorithms
Root-finding algorithm
Nth root algorithm
Alpha max plus beta min algorithm
Illinois algorithm
Jenkins–Traub algorithm
Lehmer–Schur algorithm
Schönhage–Strassen algorithm
Shifting nth root algorithm
CORDIC
Comparision of programs
Comparison of numerical analysis software

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.