Optimal isoparametric finite elements and error estimates for domains involving curved boundaries
SIAM Journal on Numerical Analysis
Optimal finite-element interpolation on curved domains
SIAM Journal on Numerical Analysis
Optimal least-squares finite element method for elliptic problems
Computer Methods in Applied Mechanics and Engineering
First-order system least squares for second-order partial differential equations: part I
SIAM Journal on Numerical Analysis - Special issue: the articles in this issue are dedicated to Seymour V. Parter
Least-squares mixed finite elements for second-order elliptic problems
SIAM Journal on Numerical Analysis
Interior maximum-norm estimates for finite element methods, part II
Mathematics of Computation
SIAM Journal on Numerical Analysis
SIAM Journal on Numerical Analysis
SIAM Journal on Numerical Analysis
Sharp $L_2$-Norm Error Estimates for First-Order div Least-Squares Methods
SIAM Journal on Numerical Analysis
Journal of Computational and Applied Mathematics
Hi-index | 7.29 |
First-order div least-squares (LS) finite element methods for second-order elliptic partial differential equations are considered. The main idea of this paper is a consideration of the LS solution u"h for the primary function u as the solution of a perturbation form of the Galerkin methods. Consequently, the results concerning the perturbation form of the Galerkin methods can be applied for the LS methods. Here, we use the pointwise error estimates for the perturbation form provided by Schatz [A.H. Schatz, Pointwise error estimates and asymptotic error expansion inequalities for the finite element method on irregular grids: Part II. Interior estimates, SIAM J. Numer. Anal. 38 (2000) 1269-1293] to obtain the pointwise estimates for the LS solution. The estimates consist of the local truncation error and pollution terms. We provide estimates for pollution terms. Our process for arriving at the estimates involves obtaining the norm of a linear functional which accounts for the perturbation. Our estimates are valid for both smooth and nonsmooth problems. For the smooth problems, the pollution is weaker than the local truncation error. For the nonsmooth problems, we provide a criterion for determining the strength of the pollution. In particular, we identify superconvergent points for nonconvex polygonal domains.