Sökning: id:"swepub:oai:DiVA.org:umu-23235" >
Parallel Algorithms...
Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
-
- Andersson, Per (författare)
- Umeå universitet,Institutionen för datavetenskap
-
- Granat, Robert (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
- Jonsson, Isak (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
visa fler...
-
- Kågström, Bo (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
visa färre...
-
(creator_code:org_t)
- Springer, 2008
- 2008
- Engelska.
-
Ingår i: Euro-Par 2008 - Parallel Processing. - : Springer. ; , s. 780-789
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- 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.
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)