Pages that link to "Item:Q1343560"
From MaRDI portal
The following pages link to Polynomial zerofinding iterative matrix algorithms (Q1343560):
Displayed 14 items.
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- 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)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- A composite polynomial zerofinding matrix algorithm (Q1903777) (← 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)
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization (Q2790065) (← links)
- Matrix approach to solve polynomial equations (Q6165580) (← links)