An improved parallel Jacobi method for diagonalizing a symmetric matrix (Q1094816)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved parallel Jacobi method for diagonalizing a symmetric matrix |
scientific article; zbMATH DE number 4026667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved parallel Jacobi method for diagonalizing a symmetric matrix |
scientific article; zbMATH DE number 4026667 |
Statements
An improved parallel Jacobi method for diagonalizing a symmetric matrix (English)
0 references
1987
0 references
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.
0 references
parallel algorithms
0 references
performance analysis
0 references
parallel processors
0 references
Jacobi algorithm
0 references
eigenvalues
0 references
symmetric matrix
0 references
QR method
0 references
