Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations

DOI10.1016/S0167-8191(05)80145-0MaRDI QIDQ1179243zbMATH OpenOpenAlexFDO

Authors Stefan Bondeli

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(05)80145-0

zbMATH Keywords

Gaussian eliminationparallel algorithmscomparison of methodscyclic reductiontiming resultsAlliant FX/8divide and conquer algorithmCPU-timesCRAY X-MP/28linear tridiagonal systemsSequent Symmetry S81b

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 52562
• scientific article; zbMATH DE number 1017513
• scientific article; zbMATH DE number 1481740
• scientific article; zbMATH DE number 66105
• A parallel algorithm for solving tridiagonal linear systems
• A fast parallel algorithm for the solution of tridiagonal linear systems
• The parallel recursive decoupling algorithm for solving tridiagonal linear systems
• Unified framework for the parallelization of divide and conquer based tridiagonal systems
• A parallel algorithm for solving block tridiagonal linear systems

Cited in

(28)

• Manycore algorithms for batch scalar and block tridiagonal solvers
• scientific article; zbMATH DE number 52562 (Why is no real title available?)
• scientific article; zbMATH DE number 66105 (Why is no real title available?)
• scientific article; zbMATH DE number 1481740 (Why is no real title available?)
• scientific article; zbMATH DE number 1484037 (Why is no real title available?)
• An application of partition method for solving 3D Stokes equation
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
• Exact algorithms for singular tridiagonal systems with applications to Markov chains
• Hybrid Parallel Linear System Solvers
• A parallel divide and conquer algorithm for non symmetric tridiAgonal toeplitz systems using conjugate gradient
• THE PARALLEL SOLUTION OF TRIDIAGONAL AND BLOCK TRIDIAGONAL SYSTEMS OF EQUATIONS BY A SCHUR COMPLEMENT METHOD
• \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators
• Divide and conquer methods for block tridiagonal systems
• A parallel algorithm for circulant tridiagonal linear systems
• Parallel algorithms for solving tridiagonal network equations by encountering runs method
• A note on the recursive decoupling method for solving tridiagonal linear systems
• Comprehensive study on complex-valued ZNN models activated by novel nonlinear functions for dynamic complex linear equations
• An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
• A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix
• scientific article; zbMATH DE number 4003350 (Why is no real title available?)
• On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
• A binary tree implementation of a parallel distributed tridiagonal solver
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• Parallel solution of tridiagonal systems for the Poisson equation
• Mathematics and numerics for balance partial differential-algebraic equations (PDAEs)
• An accurate tridiagonal equation solver
• PaScaL\_TDMA: a library of parallel and scalable solvers for massive tridiagonal systems
• A general iteration algorithm to solve a tridiagonal equation

This page was built for publication: Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations

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