Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor

dc.contributor.authorKaya, D
dc.date.accessioned2026-08-12T17:43:40Z
dc.date.issued2005
dc.departmentFırat Üniversitesi
dc.description.abstractThis study is concerned with parallel algorithms for the reduction of a real symmetric matrix to tridiagonal 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 oil a shared memory Encore Multimax multiprocessor [Encore Computer Corporation, Encore Parallel Threads Manual No. 724-06210 Rev. A, 1988]. In this testing the filial version which involves most overlap was found to be the most efficient algorithm, and its efficiency is very high when the algorithm has some minor changes did give some improvements. (c) 2004 Elsevier Inc. All rights reserved.
dc.identifier.doi10.1016/j.amc.2004.11.008
dc.identifier.endpage1062
dc.identifier.issn0096-3003
dc.identifier.issn1873-5649
dc.identifier.issue2
dc.identifier.scopus2-s2.0-25844491844
dc.identifier.scopusqualityQ1
dc.identifier.startpage1045
dc.identifier.urihttps://doi.org/10.1016/j.amc.2004.11.008
dc.identifier.urihttps://hdl.handle.net/11508/60231
dc.identifier.volume169
dc.identifier.wosWOS:000232811600027
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.subjectthe symmetric tridiagonal eigenvalue problem
dc.subjectparallel computation
dc.subjecta shared memory Encore Multimax multiprocessor
dc.titleParallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor
dc.typeArticle

Dosyalar