Abstract
Approximate matrix inverse has played key role in constructing preconditioners since last 1990s, because of their solid theoretical background. Sparse approximate inverse preconditioners (SAIPs) have attracted much attention recently, because their potential usefulness in a parallel environment. As a general matrix approach, in this paper, we propose an approximate eigen-decomposition preconditioners by combining a FFT-like multiplication algorithm. Some numerical tests are given to show this algorithm is more effective than the traditional method such as ILU with PETSc for solving a wide class of discrete elliptic problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
