Root-finding with eigen-solving
From MaRDI portal
algorithmseigenvaluegeneralized companion matrixglobal convergencepolynomial root-findingsecular equation
Real polynomials: location of zeros (26C10) 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 eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)
Recommendations
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Real and complex polynomial root-finding by means of eigen-solving
- New progress in real and complex polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Polynomial root finding using iterated eigenvalue computation
Cited in
(14)- Solving secular and polynomial equations: a multiprecision algorithm
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Root-squaring with DPR1 matrices
- Linking the TPR1, DPR1 and arrow-head matrix structures
- Real and complex polynomial root-finding by means of eigen-solving
- Polynomial root finding using iterated eigenvalue computation
- Application of filter diagonalization method to numerical solution of algebraic equations
- Polynomial Roots from Companion Matrix Eigenvalues
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- New progress in real and complex polynomial root-finding
- Matrix approach to solve polynomial equations
- Root-finding by expansion with independent constraints
- Finding imaginary roots using inners
- Eigen-solving via reduction to DPR1 matrices
This page was built for publication: Root-finding with eigen-solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447179)
