Umeå University's logo

umu.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Algorithm 1019: A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).ORCID-id: 0000-0002-3689-0899
2022 (engelsk)Inngår i: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 48, nr 1, s. 1-36, artikkel-id 11Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The QR algorithm is one of the three phases in the process of computing the eigenvalues and the eigenvectors of a dense nonsymmetric matrix. This paper describes a task-based QR algorithm for reducing an upper Hessenberg matrix to real Schur form. The task-based algorithm also supports generalized eigenvalue problems (QZ algorithm) but this paper concentrates on the standard case. The task-based algorithm adopts previous algorithmic improvements, such as tightly-coupled multi-shifts and Aggressive Early Deflation (AED), and also incorporates several new ideas that significantly improve the performance. This includes, but is not limited to, the elimination of several synchronization points, the dynamic merging of previously separate computational steps, the shortening and the prioritization of the critical path, and experimental GPU support. The task-based implementation is demonstrated to be multiple times faster than multi-threaded LAPACK and ScaLAPACK in both single-node and multi-node configurations on two different machines based on Intel and AMD CPUs. The implementation is built on top of the StarPU runtime system and is part of the open-source StarNEig library.

sted, utgiver, år, opplag, sider
Association for Computing Machinery (ACM), 2022. Vol. 48, nr 1, s. 1-36, artikkel-id 11
Emneord [en]
aggressive early deflation, MPI, multi-shift, QR algorithm, QZ algorithm, real Schur form, distributed memory, StarPU, shared memory, task-based, Eigenvalue problem, GPU
HSV kategori
Forskningsprogram
datalogi
Identifikatorer
URN: urn:nbn:se:umu:diva-190558DOI: 10.1145/3495005ISI: 000759468700012Scopus ID: 2-s2.0-85125191396OAI: oai:DiVA.org:umu-190558DiVA, id: diva2:1621413
Forskningsfinansiär
EU, Horizon 2020, 671633eSSENCE - An eScience CollaborationSwedish Research Council, E0485301Tilgjengelig fra: 2021-12-18 Laget: 2021-12-18 Sist oppdatert: 2023-09-05bibliografisk kontrollert

Open Access i DiVA

fulltext(1004 kB)199 nedlastinger
Filinformasjon
Fil FULLTEXT02.pdfFilstørrelse 1004 kBChecksum SHA-512
3c8ec88ac5cb6b6315c629b8c383771698499c755515a8c0e70880081cbb51394df7a75c13d9cd0ce7090fcc720862ca6d5752ce6717867b7f98d07a4feea038
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Person

Myllykoski, Mirko

Søk i DiVA

Av forfatter/redaktør
Myllykoski, Mirko
Av organisasjonen
I samme tidsskrift
ACM Transactions on Mathematical Software

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 199 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 708 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf