Dynamic ordering for a parallel block-Jacobi SVD algorithm

Parallel Computing

Volumn 28, Issue 2, 2002, Pages 243-262

  Becka M ^a   Oksa G ^a   Vajtersic M ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Dynamic ordering; Maximum weight perfect matching problem; Parallel linear algebra; Serial and parallel cyclic ordering; Singular value decomposition; Two sided block Jacobi method

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

SINGULAR VALUE DECOMPOSITION (SVD);

PARALLEL PROCESSING SYSTEMS;

EID: 0036467463     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(01)00138-7     Document Type: Article

References (21)

1. Divide-and-conquer algorithms for the computation of the SVD of bidiagonal matrices
2. Experiments with parallel one-sided and two-sided algorithms for SVD
3. Block-Jacobi SVD algorithms for distributed memory systems I: Hypercubes and rings
4. Block-Jacobi SVD algorithms for distributed memory systems II: Meshes
5. Computing the singular value decomposition on a distributed system of vector processors
6. The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays
7. Spectral portrait for nonHermitian large matrices
8. Computing minimum-weight perfect matchings
9. Data structures for weighted matching and nearest common ancessors with linkings
10. Eigenvalues of large highly nonnormal matrices
11. Spectral portrait of matrices and criteria of the spectrum dichotomy
12. Parallel orderings for SVD computing on hypercube multiprocessors
13. Über ein leichtes Verfahren, die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen