The formal development of a parallel program performing LU-decomposition

DOI10.1007/BF02915443zbMath0633.65007MaRDI QIDQ1096311

Johannes G. G. van de Vorst

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

efficiencycorrectnessparallel algorithmLU-decompositionGries-Owicki approachparallel invariant

Mathematics Subject Classification ID

Factorization of matrices (15A23) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (1)

A parallel interior point algorithm for linear programming on a network of transputers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derivation of distributed implementation of Warshall's algorithm
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Systolic algorithms as programs
• An axiomatic proof technique for parallel programs
• Verifying properties of parallel programs

This page was built for publication: The formal development of a parallel program performing LU-decomposition