Error-estimates for the Ritz's method of finding eigenvalues and eigenfunctions
We extend the applicability of Newton's method for approximating a solution of a nonlinear operator equation in a Banach space setting using nondiscrete mathematical induction concept introduced by Potra and Pták. We obtain new sufficient convergence conditions for Newton's method using Lipschitz and center-Lipschitz conditions instead of only the Lipschitz condition used in F. A. Potra, V. Pták, Sharp error bounds for Newton's process, Numer. Math., 34 (1980), 63–72, and F. A. Potra, V. Pták, Nondiscrete...
Here we present an approximation method for a rather broad class of first order variational problems in spaces of piece-wise constant functions over triangulations of the base domain. The convergence of the method is based on an inequality involving norms obtained by Nečas and on the general framework of Γ-convergence theory.
The paper is concerned with guaranteed and computable bounds of the limit (or safety) load, which is one of the most important quantitative characteristics of mathematical models associated with linear growth functionals. We suggest a new method for getting such bounds and illustrate its performance. First, the main ideas are demonstrated with the paradigm of a simple variational problem with a linear growth functional defined on a set of scalar valued functions. Then, the method is extended to...
The Mumford-Shah functional for image segmentation is an original approach of the image segmentation problem, based on a minimal energy criterion. Its minimization can be seen as a free discontinuity problem and is based on Γ-convergence and bounded variation functions theories. Some new regularization results, make possible to imagine a finite element resolution method. In a first time, the Mumford-Shah functional is introduced and some existing results are quoted. Then, a discrete formulation...
We present a local convergence analysis of inexact Newton-like methods for solving nonlinear equations. Using more precise majorant conditions than in earlier studies, we provide: a larger radius of convergence; tighter error estimates on the distances involved; and a clearer relationship between the majorant function and the associated least squares problem. Moreover, these advantages are obtained under the same computational cost.
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...