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

KAYA D., Wright K.

Applied Mathematics and Computation, cilt.165, sa.1, ss.195-212, 2005 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 165 Sayı: 1
  • Basım Tarihi: 2005
  • Doi Numarası: 10.1016/j.amc.2004.04.046
  • Dergi Adı: Applied Mathematics and Computation
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.195-212
  • Anahtar Kelimeler: Eigenvalue problem, Hessenberg form, Parallel computation, Shared memory multiprocessors
  • İstanbul Ticaret Üniversitesi Adresli: Evet

Özet

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.