On parallelizable eigensolvers

DOI10.1016/0196-8858(92)90011-KMaRDI QIDQ1201930zbMATH OpenFDO

Authors Louis Auslander, Anna Tsao

Publication date 17 January 1993

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-8858(92)90011-K

zbMATH Keywords

block triangularization algorithmdivide and conquer strategyeigenvaluesinvariant subspacesparallel algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

It is shown that, if one has a polynomial that is close to zero on a subset of the eigenvalues of a matrix, one can approximatively divide its eigenvalue problem into two. It is proposed that such a division should be the basis of a divide and conquer strategy for eigenvalue computation, but no way is devised to find such an annihilating polynomial.

Recommendations

• A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
• scientific article; zbMATH DE number 4155755
• A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
• scientific article; zbMATH DE number 819138
• A divide and conquer method for unitary and orthogonal eigenproblems

Cites work

• A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3336895 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)

Cited in

(10)

• Fast spectral projection algorithms for density-matrix computations
• Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
• International workshop on eigenvalue problems: algorithms; software and applications, in petascale computing (EPASA2018)
• A fixed-point method for approximate projection onto the positive semidefinite cone
• A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem
• scientific article; zbMATH DE number 1247167 (Why is no real title available?)
• Evaluating products of matrix pencils and collapsing matrix products
• An efficient Jacobi-like algorithm for parallel eigenvalue computation
• Exponentially convergent parallel algorithm for nonlinear eigenvalue problems
• Efficient eigenvalue and singular value computations on shared memory machines

This page was built for publication: On parallelizable eigensolvers

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