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

DOI10.1016/S0167-8191(05)80145-0zbMATH Open0739.65016OpenAlexW2041057519MaRDI QIDQ1179243FDOQ1179243

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

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

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)

Cited In (28)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An application of partition method for solving 3D Stokes equation
• Hybrid Parallel Linear System Solvers
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
• Exact algorithms for singular tridiagonal systems with applications to Markov chains
• 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
• Parallel algorithms for solving tridiagonal network equations by encountering runs method
• Divide and conquer methods for block tridiagonal systems
• A parallel algorithm for circulant tridiagonal linear systems
• Comprehensive study on complex-valued ZNN models activated by novel nonlinear functions for dynamic complex linear equations
• A note on the recursive decoupling method for solving tridiagonal linear systems
• 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
• Title not available (Why is that?)
• 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
• Parallel solution of tridiagonal systems for the Poisson equation
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• An accurate tridiagonal equation solver
• Mathematics and numerics for balance partial differential-algebraic equations (PDAEs)
• PaScaL\_TDMA: a library of parallel and scalable solvers for massive tridiagonal systems
• A general iteration algorithm to solve a tridiagonal equation
• Manycore algorithms for batch scalar and block tridiagonal solvers

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)