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

dc.contributor.authorKaya, D
dc.contributor.authorWright, K
dc.date.accessioned2026-08-12T17:43:33Z
dc.date.issued2005
dc.departmentFırat Üniversitesi
dc.description.abstractThis 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. (c) 2004 Elsevier Inc. All rights reserved.
dc.identifier.doi10.1016/j.amc.2004.04.046
dc.identifier.endpage212
dc.identifier.issn0096-3003
dc.identifier.issn1873-5649
dc.identifier.issue1
dc.identifier.scopus2-s2.0-17444414974
dc.identifier.scopusqualityQ1
dc.identifier.startpage195
dc.identifier.urihttps://doi.org/10.1016/j.amc.2004.04.046
dc.identifier.urihttps://hdl.handle.net/11508/60160
dc.identifier.volume165
dc.identifier.wosWOS:000229221400019
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Inc
dc.relation.ispartofApplied Mathematics and Computation
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260511
dc.subjectHessenberg form
dc.subjecteigenvalue problem
dc.subjectshared memory multiprocessors
dc.subjectparallel computation
dc.titleParallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor
dc.typeArticle

Dosyalar