Pages that link to "Item:Q3350662"

The following pages link to Chasing Algorithms for the Eigenvalue Problem (Q3350662):

Displaying 13 items.

• A QR-method for computing the singular values via semiseparable matrices (Q706231) (← links)
• Convergence of algorithms of decomposition type for the eigenvalue problem (Q749154) (← links)
• An inexact Krylov-Schur algorithm for the unitary eigenvalue problem (Q935390) (← links)
• A multiple shift \(QR\)-step for structured rank matrices (Q1044861) (← links)
• A fast method to diagonalize a Hankel matrix (Q1124767) (← links)
• \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem (Q1301293) (← links)
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method (Q1307194) (← links)
• Eigenvalue computation in the 20th century (Q1591174) (← links)
• \(QR\)-like algorithms for eigenvalue problems (Q1591175) (← links)
• The transmission of shifts and shift blurring in the QR algorithm (Q1923181) (← links)
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations (Q2483050) (← links)
• Core-Chasing Algorithms for the Eigenvalue Problem (Q4556321) (← links)
• Parallel solvers for discrete‐time algebric Riccati equations (Q4790981) (← links)