A composite polynomial zerofinding matrix algorithm

DOI10.1016/0898-1221(95)00076-BzbMath0846.65021MaRDI QIDQ1903777

F. Malek, Rémi Vaillancourt

Publication date: 21 February 1996

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

zbMATH Keywords

numerical examplesmatrix algorithmcompanion matricesroots of a polynomialLagouanelle's limiting formula

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) 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) Real polynomials: location of zeros (26C10)

Related Items

Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices, Additive preconditioning and aggregation in matrix computations, 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, Additive preconditioning, eigenspaces, and the inverse iteration, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Method for finding multiple roots of polynomials

Uses Software

• Mathematica
• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Jacobi type method for complex symmetric matrices
• A real symmetric tridiagonal matrix with a given characteristic polynomial
• Pseudozeros of polynomials and pseudospectra of companion matrices
• Polynomial zerofinding iterative matrix algorithms
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
• Polynomial roots: The ultimate answer?
• Greatest common divisor of two polynomials
• 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
• An algorithm for the total, or partial, factorization of a polynomial
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence