Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
DOI10.1137/0914008zbMATH Open0771.65019OpenAlexW2094383180WikidataQ114074361 ScholiaQ114074361MaRDI QIDQ5286339FDOQ5286339
Authors: Ya Yan Lu, Shing-Tung Yau
Publication date: 29 June 1993
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0914008
Recommendations
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Publication:4721525
- Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer
- scientific article; zbMATH DE number 27983
- Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
eigenvectorssymmetric matrixmatrix eigenvalue problemsmatrix multiplicationshigh performance parallel computers
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (6)
- PROVABLE DIMENSION DETECTION USING PRINCIPAL COMPONENT ANALYSIS
- Implementing the one-sided Jacobi method on a 2D/3D mesh multicomputer
- Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices
- On reduction schemes and the symmetry of a matrix
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
- Massively parallel sparse matrix function calculations with NTPoly
Uses Software
This page was built for publication: Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286339)