1 November 1993 Efficient eigenvalue computation on the Maspar
Author Affiliations +
Abstract
Many applications of the eigenvalue decomposition of dense matrices are well known. This work was prompted by research in the numerical simulation of disordered electronic systems, in which one of the most common approaches is to diagonalize random Hamiltonian matrices in order to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems. Results of numerical tests and timings are also presented.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yan Huo, Yan Huo, Robert Schreiber, Robert Schreiber, } "Efficient eigenvalue computation on the Maspar", Proc. SPIE 2027, Advanced Signal Processing Algorithms, Architectures, and Implementations IV, (1 November 1993); doi: 10.1117/12.160461; https://doi.org/10.1117/12.160461
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

CORDIC Algorithms: Theory And Extensions
Proceedings of SPIE (November 13 1989)
CULA: hybrid GPU accelerated linear algebra routines
Proceedings of SPIE (April 26 2010)
Evolutionary algorithm in group theory
Proceedings of SPIE (March 10 2002)
Numerical Linear Algebra On The CEDAR Multiprocessor
Proceedings of SPIE (January 20 1988)

Back to Top