Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers

DOI10.1007/BF02307377zbMath0815.65035OpenAlexW361034564MaRDI QIDQ1340868

Roman Reith, Christian P. Ullrich

Publication date: 20 December 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02307377

zbMATH Keywords

numerical experimentsnumerical stabilitytriangular systemsscalar productinterval matrixtransputer systemparallel LU-factorization

Mathematics Subject Classification ID

Related Items (1)

A reliable linear algebra library for transputer networks

Cites Work

• The ijk forms of factorization methods. I: Vector computers
• The ijk forms of factorization methods. II: Parallel systems
• A reliable linear algebra library for transputer networks
• Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
• Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers