BULK-SYNCHRONOUS PARALLEL ALGORITHMS FOR QR AND QZ MATRIX FACTORISATION

This paper presents bulk-synchronous parallel (BSP) algorithms for linear system solving through QR and QZ factorisation. The two new algorithms are analysed in terms of the BSP cost model, and portable implementations of the QR and QZ decomposition methods are devised using the Oxford BSP Library....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel algorithms and applications Jg. 11; H. 1-2; S. 97 - 112
Hauptverfasser: CALINESCU, RADU, EVANS, DAVID J.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis Group 01.01.1997
Schlagworte:
bulk-synchronous parallel model
linear system solving
QR factorisation
QZ factorisation
ISSN:1063-7192
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents bulk-synchronous parallel (BSP) algorithms for linear system solving through QR and QZ factorisation. The two new algorithms are analysed in terms of the BSP cost model, and portable implementations of the QR and QZ decomposition methods are devised using the Oxford BSP Library. The experimental results obtained on a shared-memory multiprocessor accurately match the theoretical predictions, permitting a thorough comparison of the two algorithms.
ISSN:1063-7192
DOI:10.1080/10637199708915589