Pages that link to "Item:Q1903777"
From MaRDI portal
The following pages link to A composite polynomial zerofinding matrix algorithm (Q1903777):
Displaying 17 items.
- Roots multiplicity and square-free factorization of polynomials using companion matrices (Q417438) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- A polynomial-time algorithm for finding zero-sums. (Q1043611) (← links)
- Roots of composite polynomials - an application to root clustering (Q1097327) (← links)
- Polynomial zerofinding iterative matrix algorithms (Q1343560) (← 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)
- A direct algorithm for extracting a transfer function's multiple zeros or poles (Q1608454) (← links)
- Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications (Q1765801) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← 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)
- The output zeroing problem for general polynomial matrix descriptions (Q4955097) (← links)
