Divide and conquer methods for block tridiagonal systems

DOI10.1016/0167-8191(93)90037-LzbMath0765.65035OpenAlexW2038430052MaRDI QIDQ1208522

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

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

Related Items (4)

A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system ⋮ 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