A least-squares Galerkin gradient recovery method for fully nonlinear elliptic equations

Abstract

We propose a least squares Galerkin based gradient recovery to approximate Dirichlet problems for strong solutions of linear elliptic problems in nondivergence form and corresponding apriori and aposteriori error bounds. This approach is used to tackle fully nonlinear elliptic problems, e.g., Monge-Ampère, Hamilton-Jacobi-Bellman, using the smooth (vanilla) and the semismooth Newton linearization. We discuss numerical results, including adaptive methods based on the aposteriori error indicators.

9 pages, 8 graphs/pictures

Cited by in corpus (11)

• An extended physics informed neural network for preliminary analysis of parametric optimal control problems
• A comparison of coarse spaces for Helmholtz problems in the high frequency regime
• A mechanically consistent model for fluid-structure interactions with contact including seepage
• DNN-MG: A Hybrid Neural Network/Finite Element Method with Applications to 3D Simulations of the Navier-Stokes Equations
• Efficient Wildland Fire Simulation via Nonlinear Model Order Reduction
• A modified combined active-set Newton method for solving phase-field fracture into the monolithic limit
• A Posteriori Single- and Multi-Goal Error Control and Adaptivity for Partial Differential Equations
• Space-time POD-Galerkin approach for parametric flow control
• Simulation of the Deformation for Cycling Chemo-Mechanically Coupled Battery Active Particles with Mechanical Constraints
• Fast hardware-aware matrix-free algorithm for higher-order finite-element discretized matrix multivector products on distributed systems
• Can DtN and GenEO coarse spaces be sufficiently robust for heterogeneous Helmholtz problems?