The paper deals with the approximation of contact problems of two elastic bodies by finite element method. Using piecewise linear finite elements, some error estimates are derived, assuming that the exact solution is sufficiently smooth. If the solution is not regular, the convergence itself is proven. This analysis is given for two types of contact problems: with a bounded contact zone and with enlarging contact zone.

Optimization problems with convex but non-smooth cost functional subject to an elliptic partial differential equation are considered. The non-smoothness arises from a L1-norm in the objective functional. The problem is regularized to permit the use of the semi-smooth Newton method. Error estimates with respect to the regularization parameter are provided. Moreover, finite element approximations are studied. A-priori as well as a-posteriori error estimates are developed and confirmed by numerical...

Optimization problems with convex but non-smooth cost functional subject to an elliptic partial differential equation are considered. The non-smoothness arises from a L1-norm in the objective functional. The problem is regularized to permit the use of the semi-smooth Newton method. Error estimates with respect to the regularization parameter are provided. Moreover, finite element approximations are studied. A-priori as well as a-posteriori error estimates are developed and confirmed by numerical...

We provide new sufficient convergence conditions for the convergence of the secant-type methods to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses recurrent functions, and Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than earlier ones and under our convergence hypotheses we can cover cases where earlier conditions...

The numerical minimization of the functional $\mathcal{F}\left(u\right)={\int }_{\mathrm{\Omega }}\varphi \left(x,{\nu }_u\right)\left|Du\right|+{\int }_{\partial \mathrm{\Omega }}\mu ud{\mathcal{H}}^{n-1}-{\int }_{\mathrm{\Omega }}\kappa udx$, $u\in BV\left(\mathrm{\Omega };\left\{-1,1\right\}\right)$ is addressed. The function $\varphi$ is continuous, has linear growth, and is convex and positively homogeneous of degree one in the second variable. We prove that $\mathcal{F}$ can be equivalently minimized on the convex set $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ and then regularized with a sequence ${\left\{{\mathcal{F}}_{ϵ}\left(u\right)\right\}}_{ϵ}$, of stricdy convex functionals defined on $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$. Then both $\mathcal{F}$ and ${\mathcal{F}}_{ϵ}$, can be discretized by continuous linear finite elements. The convexity property of the functionals on $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ is useful in the numerical minimization...

We address the numerical minimization of the functional $\mathcal{F}\left(v\right)={\int }_{\mathrm{\Omega }}\left|Dv\right|+{\int }_{\partial \mathrm{\Omega }}\mu vd{\mathcal{H}}^{n-1}-{\int }_{\mathrm{\Omega }}xvdx$, for $v\in BV\left(\mathrm{\Omega };\left\{-1,1\right\}\right)$. We note that $\mathcal{F}$ can be equivalently minimized on the larger, convex, set $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ and that, on that space, $\mathcal{F}$ may be regularized with a sequence $\mathit{\left\{}\mathcal{F}{}_{ϵ}\right(v)=\int {}_{\mathrm{\Omega }}\sqrt{{ϵ}^2+{\left|Dv\right|}^2}+\int {}_{\partial \mathrm{\Omega }}\mu vd\mathcal{H}{}^{n-1}-\int {}_{\mathrm{\Omega }}xvdx\mathit{\}}{}_{ϵ}$of regular functionals. Then both $\mathcal{F}$ and ${\mathcal{F}}_{ϵ}$ can be discretized by continuous linear finite elements. The convexity of the functionals in $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ is useful for the numerical minimization of $\mathcal{F}$. We prove the $\mathrm{\Gamma }-L^1\left(\mathrm{\Omega }\right)$-convergence of the discrete functionals to $\mathcal{F}$ and present a few numerical examples.