DeepAI AI Chat
Log In Sign Up

Automatic stabilization of finite-element simulations using neural networks and hierarchical matrices

by   Tomasz Sluzalec, et al.

Petrov-Galerkin formulations with optimal test functions allow for the stabilization of finite element simulations. In particular, given a discrete trial space, the optimal test space induces a numerical scheme delivering the best approximation in terms of a problem-dependent energy norm. This ideal approach has two shortcomings: first, we need to explicitly know the set of optimal test functions; and second, the optimal test functions may have large supports inducing expensive dense linear systems. Nevertheless, parametric families of PDEs are an example where it is worth investing some (offline) computational effort to obtain stabilized linear systems that can be solved efficiently, for a given set of parameters, in an online stage. Therefore, as a remedy for the first shortcoming, we explicitly compute (offline) a function mapping any PDE-parameter, to the matrix of coefficients of optimal test functions (in a basis expansion) associated with that PDE-parameter. Next, as a remedy for the second shortcoming, we use the low-rank approximation to hierarchically compress the (non-square) matrix of coefficients of optimal test functions. In order to accelerate this process, we train a neural network to learn a critical bottleneck of the compression algorithm (for a given set of PDE-parameters). When solving online the resulting (compressed) Petrov-Galerkin formulation, we employ a GMRES iterative solver with inexpensive matrix-vector multiplications thanks to the low-rank features of the compressed matrix. We perform experiments showing that the full online procedure as fast as the original (unstable) Galerkin approach. In other words, we get the stabilization with hierarchical matrices and neural networks practically for free. We illustrate our findings by means of 2D Eriksson-Johnson and Hemholtz model problems.


page 13

page 16

page 18

page 20

page 21


Isogeometric analysis with piece-wise constant test functions

We focus on finite element method computations. We show that systems of ...

Automatic symbolic computation for discontinuous Galerkin finite element methods

The implementation of discontinuous Galerkin finite element methods (DGF...

Tensor train based isogeometric analysis for PDE approximation on parameter dependent geometries

This work develops a numerical solver based on the combination of isogeo...

A low-rank matrix equation method for solving PDE-constrained optimization problems

PDE-constrained optimization problems arise in a broad number of applica...

Learning quantities of interest from parametric PDEs: An efficient neural-weighted Minimal Residual approach

The efficient approximation of parametric PDEs is of tremendous importan...

Bi-Parametric Operator Preconditioning

We extend the general operator preconditioning framework [R. Hiptmair, C...