Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
DOI10.1016/S0167-8191(05)80145-0zbMath0739.65016OpenAlexW2041057519MaRDI QIDQ1179243
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
comparison of methodsGaussian eliminationparallel algorithmscyclic reductiontiming resultsAlliant FX/8divide and conquer algorithmCPU-timesCRAY X-MP/28linear tridiagonal systemsSequent Symmetry S81b
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (15)
This page was built for publication: Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations