An efficient method for computing eigenvalues of a real normal matrix-Reference-Cited by-同舟云学术

An efficient method for computing eigenvalues of a real normal matrix

Published:2003-06 Issue:6 Volume:63 Page:638-648
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Zhou B.B,Brent R.P

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference28 articles.

1. The two-sided block Jacobi method on a hypercube;Bischof,1988

2. R.P. Brent, Parallel algorithms for digital signal processing, Proceedings of NATO Advanced Study Institute on Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, Leuven, Belgium, August, 1988.

3. The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays;Brent;SIAM J. Sci. Statist. Comput.,1985

4. Jacobi's method is more accurate than QR;Demmel;SIAM J. Sci. Statist. Comput.,1992

5. On the Schur decomposition of a matrix for parallel computation;Eberlein;IEEE Trans. Comput.,1987

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Evaluation of Eigenvalues and Eigenvectors;Springer Texts in Statistics;2024

2. Evaluation of Eigenvalues and Eigenvectors;Springer Texts in Statistics;2017

3. Numerical Linear Algebra;Springer Texts in Statistics;2017

4. Numerical Linear Algebra;Handbook of Computational Statistics;2011-12-21

5. On tridiagonal matrices unitarily equivalent to normal matrices;Linear Algebra and its Applications;2010-07