arrow
Return

Adaptive regularization, discretization, and linearization for nonsmooth problems based on primal-dual gap estimators

delete2024-01-01
delete4
delete
OA
AI
F
François Févotte
A
Ari Rappaport *
M
Martin Vohralı́k
DOI:10.1016/j.cma.2023.116558delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We consider nonsmooth partial differential equations associated with a minimization of an energy functional. We adaptively regularize the nonsmooth nonlinearity so as to be able to apply the usual Newton linearization, which is not always possible otherwise. We apply the finite element method as a discretization. We focus on the choice of the regularization parameter and adjust it on the basis of an a posteriori error estimate for the difference of energies of the exact and approximate solutions. Importantly, our estimates distinguish the different error components, namely those of regularization, linearization, and discretization. This leads to an algorithm that steers the overall procedure by adaptive stopping criteria with parameters for the regularization, linearization, and discretization levels. We prove guaranteed upper bounds for the energy difference and discuss the robustness of the estimates with respect to the magnitude of the nonlinearity when the stopping criteria are satisfied. Numerical results illustrate the theoretical developments.
Keywords:
Nonlinear elliptic problem
Nonsmooth nonlinearity
Adaptive regularization
Finite elements
Primal-dual gap
Equilibrated flux reconstruction
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computer Methods in Applied Mechanics and Engineering cover
Computer Methods in Applied Mechanics and Engineering
IF:
7.3
Papers:
1.3W
Citations:
5.6W

Organization

I
Inria
Scholars:
3.5K
Papers: 2.5K
Citations: 343
I
institut polytechnique de paris
Scholars:
1.3W
Papers: 1.0W
Citations: 6