A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
zbMATH Open1188.65047MaRDI QIDQ964069FDOQ964069
Authors: Raf Vandebril, Marc van Barel, Nicola Mastronardi 
Publication date: 14 April 2010
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/229078
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- AQZ-method based on semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- An implicit QR algorithm for symmetric semiseparable matrices
algorithmnumerical experimentseigenvalueQR algorithmstructured rank matricesGivens transformationsHessenberg-like matriximplicit computationsQH algorithmrational QR iterationsemiseparable (plus diagonal) matricesstructured-rank factorization
Cited In (9)
- Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems
- AQZ-method based on semiseparable matrices
- Rational \(QR\)-iteration without inversion
- Title not available (Why is that?)
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- A multiple shift \(QR\)-step for structured rank matrices
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- An implicit QR algorithm for symmetric semiseparable matrices
- Title not available (Why is that?)
This page was built for publication: A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964069)
