Data sparse techniques for parallel hybrid solvers
Résumé
In this talk we will describe how H-matrix data sparse techniques can be implemented in a parallel hybrid sparse linear solver based on algebraic non overlapping domain decomposition approach.
Strong-hierarchical matrix arithmetic and various clustering techniques to approximate the local Schur complements will be investigated, aiming at reducing workload and memory consumption while complying with structures of the local interfaces of the sub-domains. Utilization of these techniques to form effective global preconditioner will be presented.