Abstract
A numerical scheme to approximate a semilinear PDE involving a (singular) maximal monotone graph is analyzed inL ?. A preliminary regularization is combined with piecewise linear finite elements defined on a triangulation which is not assumed to be acute; the discrete maximum principle is thus avoided. Sharp pointwise error estimates are derived for both the smoothing and the discretization procedures. An optimal choice of the regularization parameter as a function of the mesh size leads to a sharp global rate of convergence. These error estimates for solutions, in conjunction with nondegeneracy properties of continuous problems, provide sharp interface error estimates. Two model examples are discussed: the obstacle problem and a combustion equation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
