This is the authors' abstract. We don't add key points for this paper.
We propose a cubically convergent algorithm for computing the invariant subspaces of an Hermitian matrix. The building blocks of the algorithm are matrix--matrix multiplication and QR decomposition which are highly parallelizable. We present a detailed convergence analysis and explore the so-called mixed convergence phenomenon, the understanding of which will be very helpful in devising convergence improvement. We also discuss a number of implementation details and demonstrate convergence properties of the algorithm using several numerical examples.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Zha et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: