An iterated eigenvalue algorithm for approximating roots of univariate polynomials
From MaRDI portal
Publication:697487
DOI10.1006/JSCO.2002.0526zbMATH Open1004.65060OpenAlexW2079536609MaRDI QIDQ697487FDOQ697487
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
Recommendations
- Polynomial root finding using iterated eigenvalue computation
- Real and complex polynomial root-finding by means of eigen-solving
- Structured matrix methods for polynomial root-finding
- Faulty sets of Boolean formulas and ukasiewicz logic
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
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) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- Title not available (Why is that?)
- A bibliography on roots of polynomials
- Title not available (Why is that?)
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Solving a Polynomial Equation: Some History and Recent Progress
- On condition numbers and the distance to the nearest ill-posed problem
- Polynomial Roots from Companion Matrix Eigenvalues
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Polynomial zerofinding iterative matrix algorithms
- Polynomial root finding using iterated Eigenvalue computation
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- A composite polynomial zerofinding matrix algorithm
Cited In (28)
- Remark on Algorithms to Find Roots of Polynomials
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Additive preconditioning and aggregation in matrix computations
- New progress in real and complex polynomial root-finding
- Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Root-finding by expansion with independent constraints
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- A note on generalized companion pencils in the monomial basis
- A bound on the spectral radius of graphs in terms of their Zagreb indices
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants
- 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
- An adaptive subdivision method for root finding of univariate polynomials
- Computing real roots of real polynomials
- Root-squaring with DPR1 matrices
- Solving secular and polynomial equations: a multiprecision algorithm
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- Additive preconditioning, eigenspaces, and the inverse iteration
- An experimental investigation of the normality of irrational algebraic numbers
- Computing multiple roots of inexact polynomials
- Analyticity of the Ising susceptibility: an interpretation
- Efficient isolation of polynomial's real roots.
- Matrix approach to solve polynomial equations
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Global optimality conditions and optimization methods for polynomial programming problems
Uses Software
This page was built for publication: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697487)
