Related papers: Kantorovich's Theorem on Newton's Method
An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…
In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…
We explore possibilities and limitations of a purely topological approach to the Dvoretzky Theorem.
We give a new proof of an important theorem by Nakazi using recent results by Sarason in his seminal paper on agebraic properties of truncated Toeplitz operators.
We give a modern account of Agafonov's original proof of his eponymous theorem. The original proof was only reported in Russian in a journal not widely available, and the work most commonly cited in western literature is instead the English…
In this paper, we give a counter-example, in the general case, Kronecker theorem will derive contradiction. Kronecker theorem be correct after removing some conditions.
Kolmogorov's invariant torus theorem is proved using a simple fixed point theorem.
In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…
We introduce a general notion of transport cost that encompasses many costs used in the literature (including the classical one and weak transport costs introduced by Talagrand and Marton in the 90's), and prove a Kantorovich type duality…
We prove some new results related to Tanaka's formula.
We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.
In the framework of the majorization technique, an improved condition is proposed for the semilocal convergence of the Newton method under the mild assumption that the derivative of the involved operator F(x) is continuous. Our starting…
The aim of this note is to give a proof of the Schottky theorem in general domains in $\mathbb{C}^n$. The proof is short and works for the cases $n = 1$ and $n > 1$ at the same time.
In this article, we analyse the Kantorovich type exponential sampling operators and its linear combination. We derive the Voronovskaya type theorem and its quantitative estimates for these operators in terms of an appropriate K-functional.…
The paper contains an alternative proof of M. Kontsevich Formality Theorem.
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
Kapranov Theorem is a well known generalization of Newton-Puiseux theorem for the case of several variables. This theorem is stated mainly in the context of tropical geometry. We present a new, constructive proof, that also characterizes…
We obtain some results related to Romanoff's theorem.
In this paper we derive a Newton type method to solve the non-linear system formed by combining the Tikhonov normal equations and Morozov's discrepancy principle. We prove that by placing a bound on the step size of the Newton iterations…
The article begins with a quantitative version of the martingale central limit theorem, in terms of the Kantorovich distance. This result is then used in the study of the homogenization of discrete parabolic equations with random i.i.d.…