Real and complex polynomial root-finding by means of eigen-solving
From MaRDI portal
Publication:2915005
Recommendations
Cited in
(19)- Faulty sets of Boolean formulas and ukasiewicz logic
- A Fourier Companion Matrix (Multiplication Matrix) with Real-Valued Elements: Finding the Roots of a Trigonometric Polynomial by Matrix Eigensolving
- A new fast root-finder for black box polynomials
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- A fitting algorithm for real coefficient polynomial rooting
- Polynomial root finding using iterated eigenvalue computation
- New progress in real and complex polynomial root-finding
- Coefficient-free adaptations of polynomial root-finders
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- A composite polynomial zerofinding matrix algorithm
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Structured matrix methods for polynomial root-finding
- Root-squaring with DPR1 matrices
- Root-finding with eigen-solving
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
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)