The purpose of this paper is to measure, with explicit constants as small as possible, a priori error bounds for approximation by picewise polynomials. These constants play an important role in the numerical verification method of solutions for obstacle problems by using finite element methods.
AMS Mathematics Subject Classification
Key word and phrases
Numerical verification error estimates obstacle problem
This is a preview of subscription content, log in to check access.
R.Glowinski,Numerical Methods for Nonlinear Variational Problems, Springer, New York, (1984).MATHGoogle Scholar
M.T.Nakao,A numerical verification method for the existence of weak solutions for nonlinear boundary value problems, Journal of Math. Analysis and Applications 164(1992), 489–507.MATHCrossRefMathSciNetGoogle Scholar
M.T.Nakao, N.Yamamoto and S. Kimura,On best constant in the optimal error estimates for the H0/1-projection into piecewise polynomial spaces, to appear in J.Approximation Theory.Google Scholar
M.T.Nakao, S.H.Lee and C.S.Ryoo,Numerical verification of solutions for elastoplastic torsion problems, to appear in Computers and Mathematics with Applications.Google Scholar
M. Plum,Explicit H2-estimates and pointwise bounds for solutions of second order elliptic boundary value problems, Journal of Mathematical Analysis and Applications 165(1992), 36–61.MATHCrossRefMathSciNetGoogle Scholar