scientific article; zbMATH DE number 17461

MaRDI QIDQ3974781zbMATH OpenFDO

Authors Nai-Kuan Tsao

Publication date 26 June 1992

zbMATH Keywords

algorithmscomparison of methodserror analysisparallel computationsequential computationtriangular linear systems

Mathematics Subject Classification ID

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

Review text

[For the entire collection see Zbl 0728.00018.] The paper deals with the error analysis of algorithms for solving triangular linear systems. The classical sequential algorithm is compared from the accuracy point of view to the parallel approach of \textit{A. H. Sameh} and \textit{R. P. Brent} [SIAM J. Numer. Anal. 14, 1101-1113 (1977; Zbl 0375.65016)]. The author introduces alternative accuracy measures and shows that the parallel approach possesses as good accuracy properties as the sequential one.

Recommendations

• On the accuracy of solving triangular systems in parallel
• A Parallel Triangular Solver for a Distributed-Memory Multiprocessor
• On the accuracy of solving triangular systems in parallel. II
• Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
• Improved parallel solution of a triangular linear system

Cited in

(4)

• On the accuracy of solving triangular systems in parallel
• On the accuracy of solving triangular systems in parallel. II
• The Accuracy of Solutions to Triangular Systems
• The accuracy of a parallel \(LU\) decomposition algorithm

This page was built for publication:

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