Fourier Neural Solver for large sparse linear algebraic systems
From MaRDI portal
Publication:6413288
arXiv2210.03881MaRDI QIDQ6413288FDOQ6413288
Authors: Chen Cui, Kai Jiang, Yun Liu, Shi Shu 
Publication date: 7 October 2022
Abstract: Large sparse linear algebraic systems can be found in a variety of scientific and engineering fields, and many scientists strive to solve them in an efficient and robust manner. In this paper, we propose an interpretable neural solver, the Fourier Neural Solver (FNS), to address them. FNS is based on deep learning and Fast Fourier transform. Because the error between the iterative solution and the ground truth involves a wide range of frequency modes, FNS combines a stationary iterative method and frequency space correction to eliminate different components of the error. Local Fourier analysis reveals that the FNS can pick up on the error components in frequency space that are challenging to eliminate with stationary methods. Numerical experiments on the anisotropy diffusion equation, convection-diffusion equation, and Helmholtz equation show that FNS is more efficient and more robust than the state-of-the-art neural solver.
Has companion code repository: https://github.com/cuichen1996/fourierneuralsolver
Artificial neural networks and deep learning (68T07) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) PDEs in connection with computer science (35Q68)
This page was built for publication: Fourier Neural Solver for large sparse linear algebraic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413288)
