Polynomial zerofinding iterative matrix algorithms

DOI10.1016/0898-1221(94)00202-VzbMath0812.65039MaRDI QIDQ1343560

F. Malek, Rémi Vaillancourt

Publication date: 14 May 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

characteristic polynomialfast convergenceQR algorithmsimple rootsmultiple rootFiedler's methodsNewbery's methodpolynomial zerofinding algorithmSchmeisser's method

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items

A composite polynomial zerofinding matrix algorithm, Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices, Additive preconditioning and aggregation in matrix computations, Matrix approach to solve polynomial equations, A method for finding the zeros of polynomials using a companion matrix., Root-squaring with DPR1 matrices, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Root-finding by expansion with independent constraints, Additive preconditioning, eigenspaces, and the inverse iteration, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, New progress in real and complex polynomial root-finding, Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization, Method for finding multiple roots of polynomials

Uses Software

• Mathematica
• Matlab

Cites Work

• A real symmetric tridiagonal matrix with a given characteristic polynomial
• Construction of unitary and normal companion matrices
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
• Principles for Testing Polynomial Zerofinding Programs
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
• A family of test matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item