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

DOI10.1016/J.AMC.2003.08.130MaRDI QIDQ702669zbMATH OpenOpenAlexFDO

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

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

algorithmsBSP computerdiagonal dominant matrixdivide and conquernumerical examplesperformanceSherman-Morrison formulatridiagonal matrix

Mathematics Subject Classification ID

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

Recommendations

• A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix
• scientific article; zbMATH DE number 66105
• Publication:4493154
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• A recursive decoupling method for solving tridiagonal linear systems
• scientific article; zbMATH DE number 1017513
• scientific article; zbMATH DE number 52562
• An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
• scientific article; zbMATH DE number 1481740
• Divide and conquer methods for block tridiagonal systems

Cites work

• A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• A note on the recursive decoupling method for solving tridiagonal linear systems
• A Parallel Method for Tridiagonal Equations
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• BSP linear solvers for dense matrices
• Computer science today. Recent trends and developments
• Divide and conquer methods for block tridiagonal systems
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• On Stable Parallel Linear System Solvers
• The parallel recursive decoupling algorithm for solving tridiagonal linear systems

Cited in

(7)

• An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
• A binary tree implementation of a parallel distributed tridiagonal solver
• A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix
• scientific article; zbMATH DE number 2051109 (Why is no real title available?)
• Combined probabilistic algorithm for solving high dimensional problems
• A generalized adaptive Monte Carlo algorithm based on a two-step iterative method for linear systems and its application to option pricing
• A Sherman-Morrison approach to the solution of linear systems

Describes a project that uses

Uses Software

• BSPlib

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702669)