Inexact Newton methods are constructed by combining Newton’s method with another iterative method that is used to solve the Newton equations inexactly. In this paper, we establish two semilocal convergence theorems for the inexact Newton methods. When these two theorems are specified to Newton’s method, we obtain a different Newton-Kantorovich theorem about Newton’s method. When the iterative m...

Halley’s method is a famous iteration method for solving nonlinear equations F (X) = 0. Some Kantorovich-like theorems have been given, including extensions for general spaces. Quasi-Halley methods were proposed too. This paper uses the generalized inverse approach in order to obtain a robust generalized Halley method.

The R-Function Method (RFM) solution structure is a functional expression that satisfies all given boundary conditions exactly and contains some undetermined functional components. It is complete if there exists a choice of undetermined component that transform the solution structure into an exact solution. Such a structure was used by Kantorovich (Kantorovich and Krylov, 1958) and his students...

By looking at the Γ-convergence of some easy functionals in terms of underlying Young measures, we emphasize the connection of this issue with the Monge-Kantorovich mass transfer problem. After exploring this relationship, we study a typical example in periodic homogenization to realize the difference between the Monge-Kantorovich problem and the usual cell-problem. We also state a version of t...

2 Formulation of the mass transport problems 4 2.1 The original Monge-Kantorovich problem . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Guessing a good dual to the Monge-Kantorovich problem . . . . . . . . . . . . . 6 2.3 Properties of ”Extreme points of C” . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Existence of a minimizer . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

We propose an approach to solving two-dimensional linear and nonlinear boundary-value problems of statics for shallow shells based on the generalized method finite integral transformations Newton– Kantorovich–Raphson linearization. In case, application is reduced construction two with respect different variables in analyzed domain under assumption that kernels one transformation are transforms ...

We propose a new algorithm to solve the unbalanced and partial L1-Monge– Kantorovich problems. The proposed method is a first-order primal-dual method that is scalable and parallel. The method’s iterations are conceptually simple, computationally cheap, and easy to parallelize. We provide several numerical examples solved on a CUDA GPU, which demonstrate the method’s practical effectiveness.

We revisit a one-step intermediate Newton iterative scheme that was used by Uko and Velásquez in [17] for the constructive solution of nonlinear equations of the type f(u) + g(u) = 0 . By utilizing weaker hypotheses of the Zabrejko-Nguen kind and a modified majorizing sequence we perform a semilocal convergence analysis which yields finer error bounds and more precise information on the locatio...