umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).
Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).
Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).
2008 (English)In: Euro-Par 2008 - Parallel Processing: 14th International Euro-Par Conference Conference Location: Las Palmas de Gran Canaria, SPAIN, Springer , 2008, 780-789 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels-Stewart-like solution method for general periodic Sylvester-type matrix equations based on variants of the periodic Schur decomposition. The presented algorithms are designed and implemented in the framework of the recently developed HPG library SCASY and are based on explicit blocking, 2-dimensional block cyclic data distribution and a wavefront-like traversal of the right hand side matrices. High performance is obtained by rich usage of level 3 BLAS operations. It is also demonstrated how several important key concepts of SCASY regarding communications and the treatment of quasi-triangular coefficient matrices are generalized to the periodic case. Some experimental results from a distributed memory Linux cluster demonstrate are also presented.

Place, publisher, year, edition, pages
Springer , 2008. 780-789 p.
Series
Lecture Notes in Computer Science, LNCS 5168
Identifiers
URN: urn:nbn:se:umu:diva-23235OAI: oai:DiVA.org:umu-23235DiVA: diva2:222279
Available from: 2009-06-08 Created: 2009-06-08 Last updated: 2009-09-17

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Granat, RobertKågström, Bo
By organisation
Department of Computing ScienceHPC2N (High Performance Computing Centre North)

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 73 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf