On the accuracy of solving triangular systems in parallel. II

DOI10.1016/0168-9274(92)90067-NMaRDI QIDQ1184726zbMATH OpenOpenAlexFDO

Authors 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

error boundsparallel algorithmnumerical experimentsround-off errorssequential algorithmerror complexityuni-diagonal triangular systems

Mathematics Subject Classification ID

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

Recommendations

• On the accuracy of solving triangular systems in parallel
• Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
• scientific article; zbMATH DE number 17461
• scientific article; zbMATH DE number 4076454
• scientific article; zbMATH DE number 598182

Cites work

• scientific article; zbMATH DE number 862514 (Why is no real title available?)
• A Simple Approach to the Error Analysis of Division-Free Numerical Algorithms
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• On the accuracy of solving triangular systems in parallel
• Solving Triangular Systems on a Parallel Computer

Cited in

(12)

• The accuracy of a parallel \(LU\) decomposition algorithm
• scientific article; zbMATH DE number 598182 (Why is no real title available?)
• Multiplicative Error Analysis of Matrix Transformation Algorithms
• Product Triangular Systems with Shift
• The Instability of Parallel Prefix Matrix Multiplication
• scientific article; zbMATH DE number 17461 (Why is no real title available?)
• scientific article; zbMATH DE number 671774 (Why is no real title available?)
• Machine error of parallel algorithms
• Stability of Parallel Triangular System Solvers
• Error analysis of two parallel algorithms for solving linear recurrence systems
• The Accuracy of Solutions to Triangular Systems
• Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers

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

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