Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
2008 (Engelska)Ingår i: Euro-Par 2008 - Parallel Processing: 14th International Euro-Par Conference Conference Location: Las Palmas de Gran Canaria, SPAIN, Springer , 2008, s. 780-789Konferensbidrag, Publicerat paper (Refereegranskat)
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.
Ort, förlag, år, upplaga, sidor
Springer , 2008. s. 780-789
Serie
Lecture Notes in Computer Science ; LNCS 5168
Identifikatorer
URN: urn:nbn:se:umu:diva-23235OAI: oai:DiVA.org:umu-23235DiVA, id: diva2:222279
2009-06-082009-06-082018-06-08