Fast parallelizable methods for computing invariant subspaces of Hermitian matrices

MaRDI QIDQ5436052zbMATH OpenFDO

Authors Zhenyue Zhang, Hongyuan Zha, Wenlong Ying

Publication date 14 January 2008

zbMATH Keywords

algorithmconvergenceeigenvalueHermitian matrixinvariant subspacenumerical examplesQR method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• A Cubically Convergent Parallelizable Method for the Hermitian Eigenvalue Problem
• Cubically Convergent Iterations for Invariant Subspace Computation
• scientific article; zbMATH DE number 4151736
• scientific article; zbMATH DE number 2210644
• The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action

Cited in

(4)

• Orthogonal iterations on companion-like pencils
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• A Cubically Convergent Parallelizable Method for the Hermitian Eigenvalue Problem
• scientific article; zbMATH DE number 833710 (Why is no real title available?)

This page was built for publication: Fast parallelizable methods for computing invariant subspaces of Hermitian matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5436052)