We present one-sweep parallel algorithms for the inversion of general and s
ymmetric positive definite matrices. The algorithms feature simple programm
ing and performance optimization while maintaining the same arithmetic cost
and numerical properties of conventional inversion algorithms. Our experim
ents on a Cray T3E-600 and a Beowulf cluster demonstrate high performance o
f implementations for distributed memory parallel computers.