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....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Parallel algorithms and applications Ročník 11; číslo 1-2; s. 97 - 112
Hlavní autori:	CALINESCU, RADU, EVANS, DAVID J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis Group 01.01.1997
Predmet:	bulk-synchronous parallel model linear system solving QR factorisation QZ factorisation
ISSN:	1063-7192
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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