Diagonal Dominance in the Parallel Partition Method for Tridiagonal Systems

DOI10.1137/S0895479893245498MaRDI QIDQ4857570zbMATH OpenOpenAlexFDO

Authors C. Walshaw

Publication date 1 July 1996

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479893245498

zbMATH Keywords

stabilityparallel computationdiagonal dominancetridiagonal matricesglobal pivotingparallel partition method

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

• On the accuracy of the parallel diagonal dominant algorithm
• scientific article; zbMATH DE number 1481740
• A communication-less parallel algorithm for tridiagonal Toeplitz systems
• Application and accuracy of the parallel diagonal dominant algorithm
• scientific article; zbMATH DE number 624932

Cited in

(4)

• An application of partition method for solving 3D Stokes equation
• Accurate solutions of diagonally dominant tridiagonal linear systems
• scientific article; zbMATH DE number 7156672 (Why is no real title available?)
• On the accuracy of the parallel diagonal dominant algorithm

This page was built for publication: Diagonal Dominance in the Parallel Partition Method for Tridiagonal Systems

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