On the accuracy of solving triangular systems in parallel. II

DOI10.1016/0168-9274(92)90067-NzbMath0783.65024OpenAlexW4247894517MaRDI QIDQ1184726

Nai-Kuan Tsao

Publication date: 28 June 1992

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(92)90067-n

zbMATH Keywords

numerical experimentserror boundssequential algorithmparallel algorithmround-off errorserror complexityuni-diagonal triangular systems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the accuracy of solving triangular systems in parallel
• A Simple Approach to the Error Analysis of Division-Free Numerical Algorithms
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• Solving Triangular Systems on a Parallel Computer

This page was built for publication: On the accuracy of solving triangular systems in parallel. II