A note on the recursive decoupling method for solving tridiagonal linear systems

DOI10.1016/S0096-3003(02)00218-7zbMath1027.65038MaRDI QIDQ1406230

Joan-Josep Climent, Leandro Tortosa, Antonio Zamora

Publication date: 9 September 2003

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

zbMATH Keywords

parallel computationSherman-Morrison formulaRecursive decoupling methodTridiagonal system

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A Sherman-Morrison approach to the solution of linear systems, Boundary value methods for solving transient solutions of Markovian queueing networks, The solution of linear systems by using the Sherman-Morrison formula, New algorithms for numerically solving a class of bordered tridiagonal systems of linear equations, Exact algorithms for singular tridiagonal systems with applications to Markov chains, A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system, Combined probabilistic algorithm for solving high dimensional problems

Cites Work

• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• The parallel recursive decoupling algorithm for solving tridiagonal linear systems
• A Parallel Method for Tridiagonal Equations
• A recursive decoupling method for solving tridiagonal linear systems
• 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
• Unnamed Item