Divide and conquer methods for block tridiagonal systems

DOI10.1016/0167-8191(93)90037-LMaRDI QIDQ1208522zbMATH OpenOpenAlexFDO

Authors Volker Mehrmann

Publication date 16 May 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90037-l

zbMATH Keywords

domain decompositionparallelizationdivide and conquer methodblock-tridiagonal linear systemsmaximal rank decoupling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 66105
• scientific article; zbMATH DE number 52562
• scientific article; zbMATH DE number 1017513
• scientific article; zbMATH DE number 1481740
• An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
• Publication:4493154
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• Parallel solution of block tridiagonal linear systems
• scientific article; zbMATH DE number 2109657
• A parallel algorithm for solving block tridiagonal linear systems

Cited in

(7)

• scientific article; zbMATH DE number 66105 (Why is no real title available?)
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
• Techniques for Solving Block Tridiagonal Systems on Reconfigurable Array Computers
• scientific article; zbMATH DE number 2089178 (Why is no real title available?)
• A parallel algorithm for block-tridiagonal linear systems
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• Mathematics and numerics for balance partial differential-algebraic equations (PDAEs)

This page was built for publication: Divide and conquer methods for block tridiagonal systems

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