On parallelizable eigensolvers
type: Item
instance of: scholarly article
title: On parallelizable eigensolvers
zbMATH Open document ID: 0760.65037
DOI: 10.1016/0196-8858(92)90011-K
author: Louis Auslander
author: Anna Tsao
published in: Advances in Applied Mathematics
publication date: 1993-01-17T00:00:00Z
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.
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 98830
zbMATH Keywords: parallel algorithms
zbMATH Keywords: invariant subspaces
zbMATH Keywords: block triangularization algorithm
zbMATH Keywords: eigenvalues
zbMATH Keywords: divide and conquer strategy
reviewed by: Axel Ruhe
MaRDI profile type: Publication
cites work: Q3359644
cites work: Q5614003
cites work: A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
cites work: Q5674306
description: scientific article; zbMATH DE number 98830