Primal–dual weak Galerkin finite element methods for elliptic Cauchy problems
The authors propose and analyze a well-posed numerical scheme for a type of ill-posed elliptic Cauchy problem by using a constrained minimization approach combined with the weak Galerkin finite element method. The resulting Euler–Lagrange formulation yields a system of equations involving the origin...
Saved in:
| Published in | Computers & mathematics with applications (1987) Vol. 79; no. 3; pp. 746 - 763 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Oxford
Elsevier Ltd
01.02.2020
Elsevier BV |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0898-1221 1873-7668 |
| DOI | 10.1016/j.camwa.2019.07.031 |
Cover
| Summary: | The authors propose and analyze a well-posed numerical scheme for a type of ill-posed elliptic Cauchy problem by using a constrained minimization approach combined with the weak Galerkin finite element method. The resulting Euler–Lagrange formulation yields a system of equations involving the original equation for the primal variable and its adjoint for the dual variable, and is thus an example of the primal–dual weak Galerkin finite element method. This new primal–dual weak Galerkin algorithm is consistent in the sense that the system is symmetric, well-posed, and is satisfied by the exact solution. A certain stability and error estimates were derived in discrete Sobolev norms, including one in a weak L2 topology. Some numerical results are reported to illustrate and validate the theory developed in the paper. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0898-1221 1873-7668 |
| DOI: | 10.1016/j.camwa.2019.07.031 |