Nonconforming discretizations of convex minimization problems and precise relations to mixed methods
From MaRDI portal
Boundary value problems for second-order elliptic equations (35J25) Discrete approximations in optimal control (49M25) Numerical optimization and variational techniques (65K10) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Abstract: This article discusses nonconforming finite element methods for convex minimization problems and systematically derives dual mixed formulations. Duality relations lead to simple error estimates that avoid an explicit treatment of nonconformity errors. A reconstruction formula provides the discrete solution of the dual problem via a simple postprocessing procedure which implies a strong duality relation and is of interest in a posteriori error estimation. The framework applies to differentiable and nonsmooth problems, examples include -Laplace, total-variation regularized, and obstacle problems. Numerical experiments illustrate advantages of nonconforming over standard conforming methods.
This page was built for publication: Nonconforming discretizations of convex minimization problems and precise relations to mixed methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6334254)
