A Cubically Convergent Parallelizable Method for the Hermitian Eigenvalue Problem

DOI10.1137/S0895479896302035MaRDI QIDQ4389086zbMATH OpenOpenAlexFDO

Authors Hongyuan Zha, Zhenyue Zhang

Publication date 11 May 1998

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479896302035

zbMATH Keywords

cubic convergenceHermitian eigenvalue probleminvariant subspacematrix powermatrix sign function algorithmQR factorizations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Recommendations

• A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem
• Parallel spectral division using the matrix sign function for the generalized eigenproblem
• Fast parallelizable methods for computing invariant subspaces of Hermitian matrices
• A PARALLEL ALGORITHM FOR THE MATRIX SIGN FUNCTION
• A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix

Cited in

(7)

• A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem
• Separating eigenvalues using the matrix sign function
• scientific article; zbMATH DE number 5503706 (Why is no real title available?)
• scientific article; zbMATH DE number 2063914 (Why is no real title available?)
• Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers
• Fast parallelizable methods for computing invariant subspaces of Hermitian matrices
• Computing several eigenpairs of Hermitian problems by conjugate gradient iterations

This page was built for publication: A Cubically Convergent Parallelizable Method for the Hermitian Eigenvalue Problem

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