scientific article; zbMATH DE number 3978274
[For the entire collection see Zbl 0595.00022.] The parallel matrix computation community has lately devoted considerable attention to the Jacobi family of methods for computing eigenvalues and singular values. These methods map rather neatly onto various nearest neighbor architectures. If the processors are reasonably powerful and have significant local memory then block Jacobi procedures are appealing because they render a more favorable computation/communication ratio. We examine the scope of these claims by implementing a block Jacobi singular value decomposition procedure on the IBM Kingston Loosely Coupled Array Processor (LCAP) system. The LCAP system consists of ten FPS-164/MAX array processors connected in a ring via some large bulk memories. Our basic finding is that the algorithm is well-suited to the architecture but that its advantage over a single processor implementation of the Golub-Reinsch procedure is rather unclear.
- Computing the singular value decomposition on a distributed system of vector processors
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- scientific article; zbMATH DE number 3963085
- scientific article; zbMATH DE number 17443
- scientific article; zbMATH DE number 741117
- Parallel singular value decomposition with cyclic storing
- scientific article; zbMATH DE number 1497146
- An algorithm for the generalized singular value decomposition on massively parallel computers
- Singular value decomposition on SIMD hypercube and shuffle-exchange computers
- Computing the singular value decomposition on the Connection Machine
- A triangular processor array for computing singular values
- Computing the singular value decomposition on a distributed system of vector processors
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Scalable parallel processor array for Jacobi-type matrix computations
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- Reducing the Computations of the Singular Value Decomposition Array Given by Brent and Luk
- Solving Eigenvalue and Singular Value Problems on an Undersized Systolic Array
- Computing the singular value decomposition on the Connection Machine
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742610)