Perturbation theorems for estimating magnitudes of roots of polynomials
DOI10.1016/j.amc.2010.03.020zbMath1190.65076OpenAlexW2010003104WikidataQ58206667 ScholiaQ58206667MaRDI QIDQ972942
Publication date: 21 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.020
Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)
Related Items (2)
Cites Work
- Generation of root finding algorithms via perturbation theory and some formulas
- A root-finding algorithm with fifth order derivatives
- Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- Estimating roots of polynomials using perturbation theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Perturbation theorems for estimating magnitudes of roots of polynomials