2021
DOI: 10.1016/j.camwa.2020.08.012
|View full text |Cite
|
Sign up to set email alerts
|

A machine-learning minimal-residual (ML-MRes) framework for goal-oriented finite element discretizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
22
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(23 citation statements)
references
References 36 publications
0
22
0
Order By: Relevance
“…In step 4, we solve the strong form of the adjoint problem, which for nonlinear PDEs or nonlinear goal functionals also depends on the primal solution u l, (2) h . The strong form of the adjoint problem is of the form ( 7) and thus we can find a neural network based solution by minimizing the loss (9) with L-BFGS [29], a quasi-Newton method. We observed that by using L-BFGS sometimes the loss exploded or the optimizer got stuck at a saddle point.…”
Section: Algorithmic Realizationmentioning
confidence: 99%
“…In step 4, we solve the strong form of the adjoint problem, which for nonlinear PDEs or nonlinear goal functionals also depends on the primal solution u l, (2) h . The strong form of the adjoint problem is of the form ( 7) and thus we can find a neural network based solution by minimizing the loss (9) with L-BFGS [29], a quasi-Newton method. We observed that by using L-BFGS sometimes the loss exploded or the optimizer got stuck at a saddle point.…”
Section: Algorithmic Realizationmentioning
confidence: 99%
“…Due to the universal approximation property [42], a primer candidate are neural networks as they are already successfully employed for solving ordinary and partial differential equations (PDE) [6,10,24,25,30,31,33,34,44,45,50,52,58]. A related work in aiming to improve goal-oriented computations with the help of neural network data-driven finite elements is [9]. Moreover, a recent summary of the key concepts of neural networks and deep learning was compiled in [26].…”
Section: Introductionmentioning
confidence: 99%
“…
We consider the data-driven acceleration of Galerkin-based finite element discretizations for the approximation of partial differential equations (PDEs) [1]. The aim is to obtain approximations on meshes that are very coarse, but nevertheless resolve quantities of interest with striking accuracy.Our work is inspired by the the machine learning framework of Mishra [2], who considered the data-driven acceleration of finite-difference schemes.
…”
mentioning
confidence: 99%
“…We consider the data-driven acceleration of Galerkin-based finite element discretizations for the approximation of partial differential equations (PDEs) [1]. The aim is to obtain approximations on meshes that are very coarse, but nevertheless resolve quantities of interest with striking accuracy.…”
mentioning
confidence: 99%
See 1 more Smart Citation