Efficient polynomial root-refiners: a survey and new record efficiency estimates
From MaRDI portal
Publication:418325
DOI10.1016/j.camwa.2011.11.015zbMath1238.65044MaRDI QIDQ418325
Pan, Victor Y., John Michael McNamee
Publication date: 28 May 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.11.015
efficiency; polynomial factorization; companion matrix methods; iterative root-refiners; simultaneous iterations
65H04: Numerical computation of roots of polynomial equations
Related Items
Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method, Root refinement for real polynomials using quadratic interval refinement, An efficient matrix iteration for computing weighted Moore-Penrose inverse, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Some matrix iterations for computing matrix sign function, The polynomial pivots as initial values for a new root-finding iterative method, Finding the Moore-Penrose inverse by a new matrix iteration, Accelerated approximation of the complex roots and factors of a univariate polynomial, Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New progress in real and complex polynomial root-finding
- Root-finding by expansion with independent constraints
- Numerical computation of polynomial zeros by means of Aberth's method
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Linear construction of companion matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- A modification of Muller's method
- Numerical methods for roots of polynomials. Part I
- Implicit double shift \(QR\)-algorithm for companion matrices
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- On zero finding methods of higher order from data at one point
- Root-finding by divided differences
- Methods without secant steps for finding a bracketed root
- A Fortran program for solving a nonlinear equation by Muller's method
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- The DQR algorithm, basic theory, convergence, and conditional stability
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- A 2002 update of the supplementary bibliography on roots of polynomials
- A family of methods for solving nonlinear equations using quadratic interpolation
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Numerical methods for roots of polynomials. II
- A nonstationary iterative second-order method for solving nonlinear equations
- The amended DSeSC power method for polynomial root-finding
- A new family of eighth-order iterative methods for solving nonlinear equations
- A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function
- Generalizations of an algorithm of Sebastião e Silva
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Tangent methods for nonlinear equations
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent
- Univariate polynomials
- qd-Type Methods for Quasiseparable Matrices
- A Method for Solving Algebraic Equations Using an Automatic Computer
- A new family of higher order methods for solving equations
- Algorithm 631
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- On Two Higher Order Enclosing Methods of J. W. Schmidt
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- Root-Finding by Fitting Rational Functions
- Maximal order for multipoint methods with memory using hermitian information
- On a family of multipoint methods for non-linear equations
- The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving Polynomials with Small Leading Coefficients
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Optimal Order of One-Point and Multipoint Iteration
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- A modified Newton method for polynomials
- On the Convergence of Sebastião E. Silva’s Method for Finding a Zero of a Polynomial
- Optimality in a Class of Rootfinding Algorithms
- A new high order method of regula falsi type for computing a root of an equation
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- A new iterative method for the computation of the solutions of nonlinear equations
