A binary tree implementation of a parallel distributed tridiagonal solver

DOI10.1016/0167-8191(94)00074-KzbMATH Open0835.65050OpenAlexW2020947060MaRDI QIDQ1907152FDOQ1907152

Authors: Juan C. Agüí, Javier Jiménez 

Publication date: 29 January 1996

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)00074-k

Recommendations

• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• Parallel Factorizations for Tridiagonal Matrices
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
• A tridiagonal solver for massively parallel computer systems
• Solving Tridiagonal Systems on Ensemble Architectures

zbMATH Keywords

parallel computationdivide-and-conquer algorithmperformance resultstransputer systembinary tree implementationdistributed linear tridiagonal systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cited In (1)

• A parallel algorithm for circulant tridiagonal linear systems

This page was built for publication: A binary tree implementation of a parallel distributed tridiagonal solver

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