Efficient polynomial root-refiners: a survey and new record efficiency estimates

Recommendations

Root-refining for a polynomial equation
scientific article; zbMATH DE number 3928210
On an efficient method for the simultaneous approximation of polynomial multiple roots
Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
On the R-order of some accelerated methods for the simultaneous finding of polynomial zeros

Cites work

\textit{qd}-type methods for quasiseparable matrices
A 2002 update of the supplementary bibliography on roots of polynomials
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
A family of methods for solving nonlinear equations using quadratic interpolation
A fast implicit QR eigenvalue algorithm for companion matrices
A fast QR algorithm for companion matrices
A Fortran program for solving a nonlinear equation by Muller's method
A Method for Solving Algebraic Equations Using an Automatic Computer
A modification of Muller's method
A modified Newton method for polynomials
A new family of eighth-order iterative methods for solving nonlinear equations
A new family of higher order methods for solving equations
A new high order method of regula falsi type for computing a root of an equation
A new iterative method for the computation of the solutions of nonlinear equations
A nonstationary iterative second-order method for solving nonlinear equations
A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
Algorithm 631
Design, analysis, and implementation of a multiprecision polynomial rootfinder
Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
Generalizations of an algorithm of Sebastião e Silva
scientific article; zbMATH DE number 3161517 (Why is no real title available?)
scientific article; zbMATH DE number 3928211 (Why is no real title available?)
scientific article; zbMATH DE number 1263253 (Why is no real title available?)
scientific article; zbMATH DE number 691245 (Why is no real title available?)
scientific article; zbMATH DE number 953013 (Why is no real title available?)
scientific article; zbMATH DE number 3992817 (Why is no real title available?)
scientific article; zbMATH DE number 3240705 (Why is no real title available?)
scientific article; zbMATH DE number 3290249 (Why is no real title available?)
scientific article; zbMATH DE number 3352737 (Why is no real title available?)
scientific article; zbMATH DE number 3383473 (Why is no real title available?)
scientific article; zbMATH DE number 3386905 (Why is no real title available?)
scientific article; zbMATH DE number 3398684 (Why is no real title available?)
scientific article; zbMATH DE number 3039704 (Why is no real title available?)
Implicit double shift \(QR\)-algorithm for companion matrices
Improved initialization of the accelerated and robust QR-like polynomial root-finding
Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
Linear construction of companion matrices
Maximal order for multipoint methods with memory using hermitian information
Methods without secant steps for finding a bracketed root
New progress in real and complex polynomial root-finding
Numerical computation of polynomial zeros by means of Aberth's method
Numerical methods for roots of polynomials. II
Numerical methods for roots of polynomials. Part I
On a family of multipoint methods for non-linear equations
On a generalized companion matrix pencil for matrix polynomials expressed in the Lagrange basis
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
On the Convergence of Sebastião E. Silva’s Method for Finding a Zero of a Polynomial
On the shifted QR iteration applied to companion matrices
On the worst-case arithmetic complexity of approximating zeros of polynomials
On Two Higher Order Enclosing Methods of J. W. Schmidt
On zero finding methods of higher order from data at one point
Optimal and nearly optimal algorithms for approximating polynomial zeros
Optimal Order of One-Point and Multipoint Iteration
Optimality in a Class of Rootfinding Algorithms
Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent
Root-finding by divided differences
Root-finding by expansion with independent constraints
Root-Finding by Fitting Rational Functions
Solving a Polynomial Equation: Some History and Recent Progress
Solving Polynomials with Small Leading Coefficients
Tangent methods for nonlinear equations
The amended DSeSC power method for polynomial root-finding
The DQR algorithm, basic theory, convergence, and conditional stability
The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

Cited in

(13)

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
Nonstationary vs. stationary iterative processes
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
Root-refining for a polynomial equation
scientific article; zbMATH DE number 3928210 (Why is no real title available?)
Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method
Root refinement for real polynomials using quadratic interval refinement
Efficient iterations for algebraic numbers
An efficient matrix iteration for computing weighted Moore-Penrose inverse

Describes a project that uses

Uses Software

na10
na20

This page was built for publication: Efficient polynomial root-refiners: a survey and new record efficiency estimates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418325)