Results 101 to 110 of about 331,959 (146)

ON THE NEWTON–KANTOROVICH THEOREM

open access: yesAnalysis and Applications, 2012
The Newton–Kantorovich theorem enjoys a special status, as it is both a fundamental result in Numerical Analysis, e.g., for providing an iterative method for computing the zeros of polynomials or of systems of nonlinear equations, and a fundamental result in Nonlinear Functional Analysis, e.g., for establishing that a nonlinear equation in an infinite-
Ciarlet, Philippe G., Mardare, Cristinel
openaire   +2 more sources

A Tarski–Kantorovich theorem for correspondences

Journal of Mathematical Economics
For a strong set order increasing (resp., strongly increasing) upper order hemicontinuous correspondence mapping a complete lattice A into itself (resp., a sigma-complete lattice into itself), we provide conditions for tight fixed-point bounds for sufficiently large iterations starting from any initial point in A.
Lukasz Balbus   +2 more
exaly   +3 more sources

Kantorovich theorem for variational inequalities

Applied Mathematics and Mechanics (English Edition), 2004
The authors consider the known Newton method for variational inequalities and establish its local convergence properties. They specialize some estimates which determine the convergence neighborhood and can be computed explicitly.
Wang, Zhengyu, Shen, Zuhe
exaly   +3 more sources

A GENERALIZED THEOREM OF MIRANDA AND THE THEOREM OF NEWTON–KANTOROVICH

Numerical Functional Analysis and Optimization, 2002
ABSTRACT In this paper, we discuss the theorems of Newton–Kantorovich, the Theorem of Miranda, and the relationship between them. We begin by generalizing Miranda's theorem and propose a converse. Then we show that mappings satisfying the assumptions of the Theorem of Newton–Kantorovich in a strong sense automatically satisfy those of our ...
exaly   +2 more sources

Extensions of Kantorovich theorem to complementarity problem

ZAMM Zeitschrift Fur Angewandte Mathematik Und Mechanik, 2008
AbstractThe Kantorovich theorem is extended to Newton‐Josephy method for solving nonlinear complementarity problem. All the convergence conditions established in this article can be tested in the digital computer.
exaly   +2 more sources

An updated version of the Kantorovich theorem for Newton's method

Computing (Vienna/New York), 1981
An affine invariant version of the Kantorovich theorem for Newton's method is presented. The result includes the Gragg-Tapia error bounds, as well as recent optimal and sharper upper bounds, new optimal and sharper lower bounds, and new inequalities showingq-quadratic convergence all in terms of the usual majorizing sequence.
exaly   +5 more sources

The Newton-Kantorovich Theorem

2020
Solving nonlinear equations is one of the mathematical problems that is frequently encountered in diverse scientific disciplines. Thus, with the notation $$\displaystyle f(x)=0, $$ we include the problem of finding unknown quantity x, which can be a real or complex number, a vector, a function, etc., from data provided by the function f, which ...
José Antonio Ezquerro Fernández   +1 more
openaire   +1 more source

GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems [PDF]

open access: yesComputers and Mathematics With Applications, 2011
This paper proposes a parallel solver for the nonlinear systems in Bernstein form based on subdivision and the Newton–Raphson method, where the Kantorovich theorem is employed to identify the existence of a unique root and guarantee the convergence of ...
Hongwei Lin, Jieqing Feng
exaly   +2 more sources

The Kantorovich Theorem and interior point methods

Mathematical Programming, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Optimal Error Bounds for the Newton–Kantorovich Theorem

SIAM Journal on Numerical Analysis, 1974
Best possible upper and lower bounds for the error in Newton’s method are established under the hypotheses of the Kantorovich theorem.
Gragg, W. B., Tapia, R. A.
openaire   +2 more sources

Home - About - Disclaimer - Privacy