ePrints

Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor

Lookup NU author(s): Dr Kenneth Wright

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

This study is concerned with parallel algorithms for the orthogonal reduction of a general matrix to upper Hessenberg form. A variety of algorithms are investigated, which involve varying amounts of overlap between different parts of the calculation. Empirical comparison was carried out using C++ and the THREADS package on a shared memory Encore Multimax multiprocessor. In this testing the final version which involves most overlap was found to be the most efficient algorithm, and its efficiency is very high. The algorithms illustrate the advantages of parallel algorithms using dynamic allocation of tasks to THREADs on this shared memory machine. © 2004 Elsevier Inc. All rights reserved.

Publication metadata

Author(s): Kaya D, Wright K

Publication type: Article

Publication status: Published

Journal: Applied Mathematics and Computation

Year: 2005

Volume: 165

Issue: 1

Pages: 195-212

ISSN (print): 0096-3003

ISSN (electronic): 1873-5649

Publisher: Elsevier Inc.

URL: http://dx.doi.org/10.1016/j.amc.2004.04.046

DOI: 10.1016/j.amc.2004.04.046

Altmetrics

Share