Related papers: Kantorovich's theorem on Newton's method for solvi…

The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised…

The textbook Newton's iteration is practically inapplicable on solutions of nonlinear systems with singular Jacobians. By a simple modification, a novel extension of Newton's iteration regains its local quadratic convergence toward…

Mustafa and Sims [12] introduced the notion of $G$-metric as a possible generalization of usual notion of a metric space. The author generalized the notion of G-metric to more than three variables and introduced the concept of Generalized…

We first investigate properties of M-tensor equations. In particular, we show that if the constant term of the equation is nonnegative, then finding a nonnegative solution of the equation can be done by finding a positive solution of a…

In this article we prove an existence theorem for coincidence points of mappings in Banach spaces. This theorem generalizes the Kantorovich fixed point theorem.

We describe a post-Minkowskii approximation of general relativity as a power series expansion in G, Newton's gravitational constant. Material sources are hidden behind boundaries, and only the vacuum Einstein equations are considered. An…

Monsky's celebrated equidissection theorem follows from his more general proof of the existence of a polynomial relation $f$ among the areas of the triangles in a dissection of the unit square. More recently, the authors studied a different…

In this article we introduce a generalization of the Newton transformation to the case of a system of endomorphisms. We show that it can be used in the context of extrinsic geometry of foliations and distributions yielding new integral…

We present generalizations of the Newton-Raphson-Simpson method. Specifically, for a positive integer $m$ and the sequence of coefficients of a Taylor series of a function $f(z)$, we define an algorithm we denote by NRS($m$) which is a way…

This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…

Local fractional derivative and integrals are revealed as one of useful tools to deal with everywhere continuous but nowhere differentiable functions in fractal areas ranging from fundamental science to engineering. In this paper, a…

We show the following result: Let $A,B\in \mathbb{B}\left( \mathcal{H} \right)$ be two strictly positive operators such that $A\le B$ and $m{{\mathbf{1}}_{\mathcal{H}}}\le B\le M{{\mathbf{1}}_{\mathcal{H}}}$ for some scalars $0<m<M$. Then…

Motivated by the framework constructed by Brugnano and Casulli $[$SIAM J. Sci. Comput. 30: 463--472, 2008$]$, we analyze the finite termination property of the generalized Netwon method (GNM) for solving the absolute value equation (AVE).…

This paper concerns the study and resolution of wave equations in the space of Schwartz distributions. Wave phenomena are widespread in many branches of physics and chemistry, such as optics, gravitation, quantum mechanics, chemical waves…

We propose the generalized quadrature methods for numerical solution of singular integral equation of Abel type. We overcome the singularity using the analytical calculation of the singular integral expression. The problem of solution of…

In this paper, we study large-scale convex optimization algorithms based on the Newton method applied to regularized generalized self-concordant losses, which include logistic regression and softmax regression. We first prove that our new…

The Kantorovich function $(x^TAx)(x^T A^{-1} x)$, where $A$ is a positive definite matrix, is not convex in general. From matrix/convex analysis point of view, it is interesting to address the question: When is this function convex? In this…

In this paper, applying the Newton method, we transform the complex continuous-time algebraic Riccati matrix equation into a Lyapunov equation. Then, we introduce an efficient general alternating-direction implicit (GADI) method to solve…

While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…