An improved parallel Jacobi method for diagonalizing a symmetric matrix
type: Item
instance of: scholarly article
title: An improved parallel Jacobi method for diagonalizing a symmetric matrix
zbMATH Open document ID: 0631.65031
DOI: 10.1016/0167-8191(87)90038-X
author: Alan H. Karp
author: John Greenstadt
published in: Parallel Computing
publication date: 1987-01-01T00:00:00Z
review text: A parallel variant of the Jacobi algorithm for the computation of eigenvalues of a symmetric matrix is described. It involves a simplified search for a large pivot element, and is faster than both the classical (maximum pivot) and cyclical variants. Still it is not in any case faster than the QR method, so as the authors rightly state, it is mainly of interest to the little group of Jacobi afficionados, of which the present reviewer is one.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4026667
zbMATH Keywords: parallel algorithms
zbMATH Keywords: performance analysis
zbMATH Keywords: parallel processors
zbMATH Keywords: Jacobi algorithm
zbMATH Keywords: eigenvalues
zbMATH Keywords: symmetric matrix
zbMATH Keywords: QR method
reviewed by: Axel Ruhe
describes a project that uses: EISPACK
MaRDI profile type: Publication
full work available at URL: 0167-8191(87)90038-x
OpenAlex ID: W1967181145
description: scientific article; zbMATH DE number 4026667