Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations
2007 (English)In: Applied Parallel Computing - State of the Art in Scientific Computing: 8th International Workshop, PARA 2006, Springer , 2007, 531-539 p.Conference paper (Refereed)
Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and Kagstrom. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today's HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and add (GEMM) operations. We extend and apply the recursive blocking technique to solving periodic Sylvester-type matrix equations. Successive recursive splittings are performed on 3-dimensional arrays, where the third dimension represents the periodicity of a matrix equation.
Place, publisher, year, edition, pages
Springer , 2007. 531-539 p.
, Lecture Notes in Computer Science, LNCS 4699
IdentifiersURN: urn:nbn:se:umu:diva-23266OAI: oai:DiVA.org:umu-23266DiVA: diva2:222521