2022
DOI: 10.1016/j.cma.2022.115716
|View full text |Cite
|
Sign up to set email alerts
|

Neural control of discrete weak formulations: Galerkin, least squares & minimal-residual methods with quasi-optimal weights

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 60 publications
0
4
0
Order By: Relevance
“…Thus, a more general framework allowing for a less restrictive assumption must be considered. To this end, following [9], we start by considering the following definition:…”
Section: Error Estimates In the Quasi-minimizer Sensementioning
confidence: 99%
See 1 more Smart Citation
“…Thus, a more general framework allowing for a less restrictive assumption must be considered. To this end, following [9], we start by considering the following definition:…”
Section: Error Estimates In the Quasi-minimizer Sensementioning
confidence: 99%
“…The difference with classical VPINNs is that our strategy is robust and independent of the choice of the basis functions. Other works employ similar ideas closely related to minimum residual methods [11,9]. In [2], the authors approximate the solution of symmetric and positive definite problems employing the discrete weak residual of the variational problem.…”
Section: Introductionmentioning
confidence: 99%
“…In the last decade, Neural Networks (NNs) have emerged as a powerful alternative for solving Partial Differential Equations (PDEs). For example, [1][2][3][4] employ NNs to generate optimal meshes for later solving PDEs by a Finite Element Method (FEM), [5] proposes a Deep-FEM method that mimics mesh-refinements within the NN architecture, [6] employs a NN to generate the mesh via r -adaptivity, and [7,8] use NNs to improve discrete weak formulations. Alternatively, there exist approaches to directly represent the PDE solutions via NNs.…”
Section: Introductionmentioning
confidence: 99%
“…In general, VΘ is non-convex and non-closed, possibly preventing the uniqueness and existence of minimizers (e.g., see Example 2.3 in[1]). …”
mentioning
confidence: 99%