Parallel direct methods for solving banded linear systems

DOI10.1016/0024-3795(87)90128-5zbMath0615.65036MaRDI QIDQ1820554

Yousef Saad, Martin H. Schultz

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90128-5

zbMATH Keywords

complexity; hypercube; Gaussian elimination; banded linear systems; multiprocessor ring; grid array

Mathematics Subject Classification ID

65Y05: Parallel numerical computation

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Communication complexity of the Gaussian elimination algorithm on multiprocessors, Convergence analysis for a parallel Jacobi algorithm, Efficiency results for Gaussian elimination on the iPSC/2 hypercube, Use of indefinite pencils for computing damped natural modes

Cites Work

• Unnamed Item
• On some parallel banded system solvers
• Complexity of dense-linear-system solution on a multiprocessor ring
• Multiple array processors for ocean acoustic problems
• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• A parallel partition method for solving banded systems of linear equations
• Data communication in parallel architectures
• Solving Tridiagonal Systems on Ensemble Architectures
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• Solving narrow banded systems on ensemble architectures
• A Parallel Method for Tridiagonal Equations
• On the stability of Gauss-Jordan elimination with pivoting