Polynomial zerofinding iterative matrix algorithms

DOI10.1016/0898-1221(94)00202-VzbMATH Open0812.65039MaRDI QIDQ1343560FDOQ1343560

Authors: F. Malek, Rémi Vaillancourt 

Publication date: 14 May 1995

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

Recommendations

• A composite polynomial zerofinding matrix algorithm
• Polynomial zerofinders based on Szegő polynomials
• scientific article; zbMATH DE number 1843870
• Publication:4862321
• Iterative methods for simultaneous inclusion of polynomial zeros

zbMATH Keywords

characteristic polynomialsimple rootsmultiple rootQR algorithmfast convergenceFiedler'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)

Cites Work

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

Cited In (21)

• Polynomial zerofinders based on Szegő polynomials
• Additive preconditioning and aggregation in matrix computations
• Title not available (Why is that?)
• Locating the Eigenvalues of Matrix Polynomials
• New progress in real and complex polynomial root-finding
• Root-finding by expansion with independent constraints
• Backward error analysis of polynomial eigenvalue problems solved by linearization
• Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
• A composite polynomial zerofinding matrix algorithm
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• A method for finding the zeros of polynomials using a companion matrix.
• Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
• Root-squaring with DPR1 matrices
• Method for finding multiple roots of polynomials
• Title not available (Why is that?)
• Additive preconditioning, eigenspaces, and the inverse iteration
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• Title not available (Why is that?)
• Zeros of arbitrary polynomials as eigenvalues of simple matrices
• Matrix approach to solve polynomial equations
• The output zeroing problem for general polynomial matrix descriptions

Uses Software

• Mathematica
• Matlab

This page was built for publication: Polynomial zerofinding iterative matrix algorithms

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