Pages that link to "Item:Q1772043"
From MaRDI portal
The following pages link to Improved initialization of the accelerated and robust QR-like polynomial root-finding (Q1772043):
Displaying 14 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Eigen-solving via reduction to DPR1 matrices (Q950043) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← 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)
- Neville elimination for rank-structured matrices (Q2469525) (← links)
- Linking the TPR1, DPR1 and arrow-head matrix structures (Q2469906) (← links)
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices (Q2566271) (← links)
- Generalizations of Gershgorin disks and polynomial zeros (Q3574809) (← links)
