Pages that link to "Item:Q1903777"
From MaRDI portal
The following pages link to A composite polynomial zerofinding matrix algorithm (Q1903777):
Displaying 9 items.
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices (Q1379083) (← links)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Root-squaring with DPR1 matrices (Q2452939) (← links)
- Method for finding multiple roots of polynomials (Q2507024) (← links)
