Real and complex polynomial root-finding by means of eigen-solving
DOI10.1007/978-3-642-32973-9_23zbMATH Open1416.65134OpenAlexW139560545MaRDI QIDQ2915005FDOQ2915005
Authors: Victor Y. Pan, Guoliang Qian, Ai-Long Zheng 
Publication date: 21 September 2012
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32973-9_23
Recommendations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20) Numerical computation of roots of polynomial equations (65H04)
Cited In (13)
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- A composite polynomial zerofinding matrix algorithm
- Faulty sets of Boolean formulas and ukasiewicz logic
- Root-finding with eigen-solving
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Real polynomial root-finding by means of matrix and polynomial iterations
- A Fourier Companion Matrix (Multiplication Matrix) with Real-Valued Elements: Finding the Roots of a Trigonometric Polynomial by Matrix Eigensolving
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Coefficient-free adaptations of polynomial root-finders
- Structured matrix methods for polynomial root-finding
This page was built for publication: Real and complex polynomial root-finding by means of eigen-solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915005)
