A note on parallel matrix inversion


Journal Article

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

Full Text

Duke Authors

Cited Authors

  • Quintana, ES; Quintana, G; Sun, X; Van de Geijn, R

Published Date

  • November 10, 2001

Published In

Volume / Issue

  • 22 / 5

Start / End Page

  • 1762 - 1771

International Standard Serial Number (ISSN)

  • 1064-8275

Digital Object Identifier (DOI)

  • 10.1137/S1064827598345679

Citation Source

  • Scopus