A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system

DOI10.1016/J.AMC.2003.08.130zbMath1060.65032OpenAlexW2038554248MaRDI QIDQ702669

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

Publication date: 17 January 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.08.130

zbMATH Keywords

performancealgorithmsnumerical examplesdiagonal dominant matrixtridiagonal matrixSherman-Morrison formuladivide and conquerBSP computer

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

A Sherman-Morrison approach to the solution of linear systems ⋮ Combined probabilistic algorithm for solving high dimensional problems

Uses Software

• BSPlib

Cites Work

• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• Divide and conquer methods for block tridiagonal systems
• BSP linear solvers for dense matrices
• A note on the recursive decoupling method for solving tridiagonal linear systems
• The parallel recursive decoupling algorithm for solving tridiagonal linear systems
• Computer science today. Recent trends and developments
• A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix
• A Parallel Method for Tridiagonal Equations
• On Stable Parallel Linear System Solvers
• 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

This page was built for publication: A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system