On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
From MaRDI portal
Publication:1179035
DOI10.1007/BF01385791zbMath0738.65015MaRDI QIDQ1179035
Publication date: 26 June 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133560
algorithmtridiagonal systemspartial pivotingvector computersparallel computerCRAY X-MPdiagonally dominant systemsincomplete Gaussian elimination without pivotingwrap-around partitioning
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallelization and vectorization aspects of the solution of tridiagonal linear systems
- A parallel partition method for solving banded systems of linear equations
- Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
- Data transport in Wang's partition method
- Solving tridiagonal systems of linear equations on the IBM 3090 VF
- A fast vector algorithm for solving tridiagonal linear equations
- Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
- Solving Tridiagonal Systems on Ensemble Architectures
- The computation and communication complexity of a parallel banded system solver
- Solving narrow banded systems on ensemble architectures
- A Parallel Method for Tridiagonal Equations
- The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
- A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
- A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
This page was built for publication: On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
