An iterated eigenvalue algorithm for approximating roots of univariate polynomials
From MaRDI portal
Publication:697487
DOI10.1006/jsco.2002.0526zbMath1004.65060OpenAlexW2079536609MaRDI QIDQ697487
Publication date: 17 September 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2002.0526
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
AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES, Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants, Global optimality conditions and optimization methods for constrained polynomial programming problems, A bound on the spectral radius of graphs in terms of their Zagreb indices, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, 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, Additive preconditioning and aggregation in matrix computations, Matrix approach to solve polynomial equations, Analyticity of the Ising susceptibility: an interpretation, Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, Efficient isolation of polynomial's real roots., Root-squaring with DPR1 matrices, Root-finding by expansion with independent constraints, An adaptive subdivision method for root finding of univariate polynomials, Computing real roots of real polynomials, Global optimality conditions and optimization methods for polynomial programming problems, Additive preconditioning, eigenspaces, and the inverse iteration, Computing multiple roots of inexact polynomials, Solving secular and polynomial equations: a multiprecision algorithm, New progress in real and complex polynomial root-finding, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities, A note on generalized companion pencils in the monomial basis, An experimental investigation of the normality of irrational algebraic numbers, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial, Newton's method in practice: finding all roots of polynomials of degree one million efficiently
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On condition numbers and the distance to the nearest ill-posed problem
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- A bibliography on roots of polynomials
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Polynomial zerofinding iterative matrix algorithms
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- A composite polynomial zerofinding matrix algorithm
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- Polynomial root finding using iterated Eigenvalue computation
- Solving a Polynomial Equation: Some History and Recent Progress
- Polynomial Roots from Companion Matrix Eigenvalues
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
