Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
136 tokens/sec
GPT-4o
11 tokens/sec
Gemini 2.5 Pro Pro
50 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Optimized sparse approximate inverse smoothers for solving Laplacian linear systems (2206.05543v1)

Published 11 Jun 2022 in math.NA, cs.DC, and cs.NA

Abstract: In this paper we propose and analyze new efficient sparse approximate inverse (SPAI) smoothers for solving the two-dimensional (2D) and three-dimensional (3D) Laplacian linear system with geometric multigrid methods. Local Fourier analysis shows that our proposed SPAI smoother for 2D achieves a much smaller smoothing factor than the state-of-the-art SPAI smoother studied in [Bolten, M., Huckle, T.K. and Kravvaritis, C.D., 2016. Sparse matrix approximations for multigrid methods. Linear Algebra and its Applications, 502, pp.58-76.]. The proposed SPAI smoother for 3D cases provides smaller optimal smoothing factor than that of weighted Jacobi smoother. Numerical results validate our theoretical conclusions and illustrate the high-efficiency and high-effectiveness of our proposed SPAI smoothers. Such SPAI smoothers have the advantage of inherent parallelism. The MATLAB codes for implementing our proposed algorithms are publicly available online at http://github.com/junliu2050/SPAI-MG-Laplacian .

Citations (3)

Summary

We haven't generated a summary for this paper yet.