Parallel solution of linear systems with striped sparse matrices

DOI10.1016/0167-8191(88)90082-8MaRDI QIDQ1102072zbMATH OpenOpenAlexFDO

Authors Rami Melhem

Publication date 1988

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(88)90082-8

zbMATH Keywords

parallel multiplicationstripe structuretriangular linear systemsVLSI network

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Recommendations

• 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

Cited in

(7)

• Determination of Stripe Structures for Finite Element Matrices
• Processor-efficient sparse matrix-vector multiplication
• Diagonally-striped matrices and approximate inverse preconditioners
• Block SSOR preconditionings for high order 3D FE systems
• On diagonally structured problems in unconstrained optimization using an inexact super Halley method
• FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method
• A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP

Describes a project that uses

Uses Software

• ELLPACK

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)