A COMPARISON OF THE QR AND QZ MATRIX FACTORISATION METHODS ON PARALLEL COMPUTERS
作者:
D. J. EVANS,
R. ABDULLAH,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1995)
卷期:
Volume 7,
issue 1-2
页码: 43-52
ISSN:1063-7192
年代: 1995
DOI:10.1080/10637199508915521
出版商: Taylor & Francis Group
关键词: QRandQZorthogonal decomposition;linear systems;shared memory parallel computer
数据来源: Taylor
摘要:
The well knownQRfactorisation methods for solving linear systems is compared with theQZorthogonal decomposition method [2]. Timings on a shared memory parallel computer confirm the superiority of the latter method by up to 14% for large linear systems for both sequential and parallel implementations.
点击下载:
PDF (128KB)
返 回