Pages that link to "Item:Q993375"
From MaRDI portal
The following pages link to Implicit double shift \(QR\)-algorithm for companion matrices (Q993375):
Displayed 16 items.
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle (Q396051) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- A fitting algorithm for real coefficient polynomial rooting (Q421833) (← links)
- A unification of unitary similarity transforms to compressed representations (Q652255) (← links)
- Implicit QR with compression (Q692576) (← links)
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices (Q728451) (← links)
- An algorithm for computing the eigenvalues of block companion matrices (Q1935391) (← links)
- Semi-analytical solutions for eigenvalue problems of chains and periodic graphs (Q2245987) (← links)
- Fast computation of eigenvalues of companion, comrade, and related matrices (Q2450887) (← links)
- Implicit QR for rank-structured matrix pencils (Q2450897) (← links)
- On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices (Q2834688) (← links)
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices (Q4588944) (← links)
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices (Q5038407) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
- A CMV-Based Eigensolver for Companion Matrices (Q5502142) (← links)