An overlapped two-way method for solving tridiagonal linear systems in a BSP computer

DOI10.1016/j.amc.2003.12.044zbMath1062.65030OpenAlexW2084334648MaRDI QIDQ1763313

Joan-Josep Climent, Leandro Tortosa, Carmen Perea, Antonio Zamora

Publication date: 22 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.044

zbMATH Keywords

numerical experimentsparallel computationtridiagonal linear systemdiagonally dominant matrixSchwarz iterationBulk synchronous parallelismoverlapping partitionstwo-way methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Uses Software

• BSPlib

Cites Work

• Analysis of a parallel solution method for tridiagonal linear systems
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• Compact finite difference schemes with spectral-like resolution
• BSP linear solvers for dense matrices
• Review of general and Toeplitz vector bidiagonal solvers
• The parallel recursive decoupling algorithm for solving tridiagonal linear systems
• Computer science today. Recent trends and developments
• A Parallel Method for Tridiagonal Equations
• A Tricyclic Tridiagonal Equation Solver
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations