Structured matrix methods for polynomial root-finding
From MaRDI portal
Recommendations
- New progress in real and complex polynomial root-finding
- Polynomial root finding using iterated eigenvalue computation
- Faulty sets of Boolean formulas and ukasiewicz logic
- Real and complex polynomial root-finding by means of eigen-solving
- Zerofinding of analytic functions by structured matrix methods
Cited in
(17)- Generalizations of Gershgorin disks and polynomial zeros
- Remark on Algorithms to Find Roots of Polynomials
- scientific article; zbMATH DE number 889619 (Why is no real title available?)
- Reliable numerical methods for polynomial matrix triangularization
- scientific article; zbMATH DE number 1843870 (Why is no real title available?)
- scientific article; zbMATH DE number 778084 (Why is no real title available?)
- Regularization and matrix computation in numerical polynomial algebra
- A note on generalized companion pencils in the monomial basis
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- Eigen-solving via reduction to DPR1 matrices
- Structured matrix methods for the computation of multiple roots of a polynomial
- A comparison of companion matrix methods to find roots of a trigonometric polynomial
- Zerofinding of analytic functions by structured matrix methods
- Computational aspects of the application of Frobenius matrix to separation of roots of polynomials
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Fast computation of eigenvalues of companion, comrade, and related matrices
This page was built for publication: Structured matrix methods for polynomial root-finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301667)
