Abstract
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, K., Kim, S. & Zhang, J. A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning. Journal of Mathematical Modelling and Algorithms 2, 203–215 (2003). https://doi.org/10.1023/B:JMMA.0000015831.64190.1e
Issue Date:
DOI: https://doi.org/10.1023/B:JMMA.0000015831.64190.1e