pith. sign in

arxiv: 1801.09622 · v1 · pith:654NK3GOnew · submitted 2018-01-29 · 🧮 math.NA

First-Order Least-Squares Method for the Obstacle Problem

classification 🧮 math.NA
keywords caseerrorfirst-orderleast-squaresmethodobstacleproblemadaptive
0
0 comments X
read the original abstract

We define and analyse a least-squares finite element method for a first-order reformulation of the obstacle problem. Moreover, we derive variational inequalities that are based on similar but non-symmetric bilinear forms. A priori error estimates including the case of non-conforming convex sets are given and optimal convergence rates are shown for the lowest-order case. We provide also a posteriori bounds that can be be used as error indicators in an adaptive algorithm. Numerical studies are presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.