A survey of parallel direct methods for block bidiagonal linear systems on distributed memory computers
From MaRDI portal
Publication:1912863
DOI10.1016/0898-1221(96)00021-1zbMath0866.65022MaRDI QIDQ1912863
Tiziano Politi, Marcin Paprzycki, Pierluigi Amodio
Publication date: 13 July 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00021-1
computational complexity; parallel algorithms; survey paper; factorization method; transputer systems; cyclic reduction method; block bi-diagonal matrix; Brugnano's reduction algorithm; direct band solvers
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel solution of almost block diagonal systems on the CRAY Y-MP using level 3 BLAS
- Parallel treatment of block-bidiagonal matrices in the solution of ordinary differential boundary value problems
- On parallel methods for boundary value ODEs
- Solving almost block diagonal systems on parallel computers
- A parallel solver for tridiagonal linear systems for distributed memory parallel computers
- Parallel factorizations and parallel solvers for tridiagonal linear systems
- Parallel block preconditioning for the solution of boundary value methods
- Parallel iterative solvers for boundary value methods
- Stable Parallel Algorithms for Two-Point Boundary Value Problems
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
- Parallel Factorizations for Tridiagonal Matrices
