Parallel solution of linear systems with striped sparse matrices
The multiplication of a vector by a matrix and the solution of triangular linear systems are the two basic ingredients in most iterative solvers. In order to avoid computations that involve zero operands, the non-zero elements in a sparse matrix are organized in the form of non-overlapping stripes, and only the elements within the stripe structure of the matrix are manipulated. This paper contains (i) the definition of the stripe structure of a general sparse matrix, (ii) a description of a VLSI network which uses the stripe structure in the parallel multiplication of a vector by a matrix, (iii) some results concerning the property of non-overlapping stripes, (iv) an extension of (ii) to a network for the solution of triangular linear systems.
- Determination of Stripe Structures for Finite Element Matrices
- Parallel solution of arbitrarily sparse linear systems
- Processor-efficient sparse matrix-vector multiplication
- Efficient VLSI implementation of iterative solutions to sparse linear systems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- Processor-efficient sparse matrix-vector multiplication
- Diagonally-striped matrices and approximate inverse preconditioners
- Determination of Stripe Structures for Finite Element Matrices
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- Block SSOR preconditionings for high order 3D FE systems
- FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method
This page was built for publication: Parallel solution of linear systems with striped sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102072)
