Parallel Jacobi algorithm for matrix diagonalisation on transputer networks (Q806955)
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: Parallel Jacobi algorithm for matrix diagonalisation on transputer networks |
scientific article; zbMATH DE number 4205872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Jacobi algorithm for matrix diagonalisation on transputer networks |
scientific article; zbMATH DE number 4205872 |
Statements
Parallel Jacobi algorithm for matrix diagonalisation on transputer networks (English)
0 references
1991
0 references
A Jacobi type parallel algorithm for the diagonalization of a real symmetric matrix is presented and analyzed in detail for the execution on a network of transputers. The maximal efficiency is limited by 2/3 because the parallel algorithm necessitates a shuffling of slices of matrices between the processors.
0 references
matrix diagonalization
0 references
parallel Jacobi method
0 references
eigenvalues
0 references
symmetric matrix
0 references
parallel algorithm
0 references
0.839328408241272
0 references
0.8160927891731262
0 references
0.8150351643562317
0 references
0.8092907071113586
0 references
0.8020264506340027
0 references
