A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
Kai Weixian Lan, Elias Gueidon, Ayano Kaneda, Julian Panetta, Joseph Teran

TL;DR
This paper presents a neural-preconditioned iterative solver for Poisson equations with mixed boundary conditions, offering efficient and adaptable solutions that outperform traditional methods in fluid simulation scenarios.
Contribution
The authors introduce a neural preconditioner that generalizes across domain shapes and boundary conditions, reducing setup costs and improving solver efficiency.
Findings
Outperforms algebraic multigrid in test cases
Generalizes to unseen domain shapes and boundary conditions
Supports fast inference with a lightweight neural network
Abstract
We introduce a neural-preconditioned iterative solver for Poisson equations with mixed boundary conditions. Typical Poisson discretizations yield large, ill-conditioned linear systems. Iterative solvers can be effective for these problems, but only when equipped with powerful preconditioners. Unfortunately, effective preconditioners like multigrid require costly setup phases that must be re-executed every time domain shapes or boundary conditions change, forming a severe bottleneck for problems with evolving boundaries. In contrast, we present a neural preconditioner trained to efficiently approximate the inverse of the discrete Laplacian in the presence of such changes. Our approach generalizes to domain shapes, boundary conditions, and grid sizes outside the training set. The key to our preconditioner's success is a novel, lightweight neural network architecture featuring spatially…
Peer Reviews
Decision·ICML 2024 Poster
- In the context of traditional approaches of multigrid, either solver or preconditioner, either geometric or algebraic, imposing (nonhomogeneous) Neumann BC can be challenging and is usually an ad-hoc business. - The study, from preconditioning pov, is quite well-motivated by introducing the ever-changing BCs for the Poisson problem through the multiphase flow, since traditional AMG has to rebuilt the AMG hierarchy each time step. - The phase variables as channels are neat practices, which is n
- Personally, I am quite uncomfortable to impose Dirichlet boundary conditions on the pressure variable for the fluid problems among many formulations I have played with for NSE or Stokesian flow. While the temporal discretization of NSE presented on page 3 is a standard splitting scheme (aka "projection method" or "pressure-correction scheme"), the reference given is likely not the right one. In Chorin's 1967 JCP paper, he proposed the famous pressure marching scheme to impose divergence free c
The neural network can effectively approximate the inverse of the stiffness matrix from the Poisson equation such that the resulting iterative solver is much faster than the existing methods.
- The primary contributions of the paper, including the understanding of convolution as a smoother, pooling as the restriction, and the connection between multigrid and convolutional neural networks, have been extensively explored in the following reference: Juncai He and Jinchao Xu. "Mg-Net: A unified framework of multigrid and convolutional neural network." arXiv:1901.10415, 2019. - It appears that the comparison in the paper is limited to iterative solvers and does not account for the tim
1. The network design that encodes boundary information through spatially-varying convolutions is novel and well-motivated. This likely contributes significantly to the method's success in addressing mixed BCs. 2. Comprehensive empirical evaluation on simulation benchmarks demonstrates clear superiority over optimized baseline methods on problems. Statistical analysis provides convincing evidence of the method's benefits.
1. While the spatially-varying convolutions encode boundary data effectively, their implementation as CUDA kernels is noted to be a computational bottleneck. Further optimization could yield additional speedups. 2. Enforcing symmetry and positive-definiteness of the preconditioning operator was not achieved, limiting the method to a generalization of CG instead of CG itself. 3. The network does not yet leverage sparsity, so may not scale gracefully to extreme sparse problems with many empty gr
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Advanced Numerical Methods in Computational Mathematics · Numerical methods in engineering
MethodsConvolution
