Related papers: On finite termination of the generalized Newton me…

Convergence of the classical Newton's method and its DSM version for solving operator equations $F(u)=h$ is proved without any smoothness assumptions on $F'(u)$. It is proved that every solvable equation $F(u)=f$ can be solved by Newton's…

An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…

In this article we study adaptive finite element methods (AFEM) with inexact solvers for a class of semilinear elliptic interface problems. We are particularly interested in nonlinear problems with discontinuous diffusion coefficients, such…

We expose in full detail a constructive procedure to invert the so--called "finite Markov moment problem". The proofs rely on the general theory of Toeplitz matrices together with the classical Newton's relations.

Building on a strategy introduced in arXiv:1706.05364, we present exact analytic expressions for all the singlet eigenstates and eigenvalues of the simplest non-linear ($n=2, d=3$) gauged Gurau-Witten tensor model. This solves the theory…

We derive expansions of the resolvent Rn(x;y;t)=(Qn(x;t)Pn(y;t)-Qn(y;t)Pn(x;t))/(x-y) of the Hermite kernel Kn at the edge of the spectrum of the finite n Gaussian Unitary Ensemble (GUEn) and the finite n expansion of Qn(x;t) and Pn(x;t).…

The Conjugate Gradient method (CGM) is known to be the fastest generic iterative method for solving linear systems with symmetric sign definite matrices. In this paper, we modify this method so that it could find fundamental solitary waves…

This report addresses the boundary value problem for a second-order linear singularly perturbed FIDE. Traditional methods for solving these equations often face stability issues when dealing with small perturbation parameters. We propose an…

The ground state energy of a many-electron system can be approximated by an variational approach in which the total energy of the system is minimized with respect to one and two-body reduced density matrices (RDM) instead of many-electron…

Two common methods for solving absolute value equations (AVE) are SOR-like iteration method and fixed point iteration (FPI) method. In this paper, novel convergence analysis, which result wider convergence range, of the SOR-like iteration…

Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…

Recent research has indicated a substantial rise in interest in understanding Nesterov's accelerated gradient methods via their continuous-time models. However, most existing studies focus on specific classes of Nesterov's methods, which…

In this paper, we introduce the Deep Finite Volume Method (DFVM), an innovative deep learning framework tailored for solving high-order (order \(\geq 2\)) partial differential equations (PDEs). Our approach centers on a novel loss function…

In this paper, we introduce a generalized value iteration network (GVIN), which is an end-to-end neural network planning module. GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which enables GVIN to…

Training deep neural networks for solving machine learning problems is one great challenge in the field, mainly due to its associated optimisation problem being highly non-convex. Recent developments have suggested that many training…

{A defining characteristic of Newton's method is local superlinear convergence within a neighbourhood of a strict local minimum. However, outside this neighborhood Newton's method can converge slowly or even diverge. A common approach to…

A generalized Black-Scholes equation is considered on the semi-axis. It is transformed on the interval (0,1) in order to make the computational domain finite. The new parabolic operator degenerates at the both ends of the interval and we…

A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…

This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…

We describe a three precision variant of Newton's method for nonlinear equations. We evaluate the nonlinear residual in double precision, store the Jacobian matrix in single precision, and solve the equation for the Newton step with…