相关论文: On finite termination of the generalized Newton me…

This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

Computational electromagnetics (CEM) is employed to numerically solve Maxwell's equations, and it has very important and practical applications across a broad range of disciplines, including biomedical engineering, nanophotonics, wireless…

A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville…

Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an absolute value equation. It is equivalent to the general linear complementarity problem, and thus NP hard…

This study investigates the effectiveness of Genetic Algorithms (GAs) in solving both linear and nonlinear systems of equations, comparing their performance to traditional methods such as Gaussian Elimination, Newton's Method, and…

Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…

We propose \textbf{NewVEM}, a Newton vertex exchange method for efficiently solving self-concordant minimization problems under generalized simplex constraints. The algorithm features a two-level structure: the outer loop employs a…

In this paper, two numerical approaches based on the Newton iteration method with spectral algorithms are introduced to solve the Thomas-Fermi equation. That Thomas-Fermi equation is a nonlinear singular ordinary differential equation (ODE)…

In the present paper, in order to fnd a singularity of a vector field defined on Riemannian manifolds, we present a new globalization strategy of Newton method and establish its global convergence with superlinear rate. In particular, this…

We study a family of $H^m$-conforming piecewise polynomials based on artificial neural network, named as the finite neuron method (FNM), for numerical solution of $2m$-th order partial differential equations in $\mathbb{R}^d$ for any $m,d…

Explicit time integration for immersed finite element discretizations severely suffers from the influence of poorly cut elements. In this contribution, we propose a generalized eigenvalue stabilization (GEVS) strategy for the element mass…

Nonlinear systems of partial differential equations (PDEs) may permit several distinct solutions. The typical current approach to finding distinct solutions is to start Newton's method with many different initial guesses, hoping to find…

The main goal of this article is to study the existence of a unique positive definite common solution to a pair of matrix equations of the form \begin{eqnarray*} X^r=Q_1 + \displaystyle \sum_{i=1}^{m} {A_i}^*F(X)A_i \mbox{ and } X^s=Q_2 +…

Infinite-dimensional Newton methods can be effectively used to derive numerical proofs of the existence of solutions to partial differential equations (PDEs). In computer-assisted proofs of PDEs, the original problem is transformed into the…

New theorems about the existence of solution for a system of infinite linear equations with a Vandermonde type matrix of coefficients are proved. Some examples and applications of these results are shown. In particular, a kind of these…

In physics, accurately modeling large-scale phenomena such as core-collapse supernovae, (CCSN), and neutron star mergers are computationally challenging and require solving large sets of partial and ordinary differential equations.…

Global Value Numbering(GVN) is a method for detecting redundant computations in programs. Here, we introduce the problem of Global Value Numbering in its original form, as conceived by Kildall(1973), and present an algorithm which is a…

We propose an Artificial Neural Network (ANN) design to solve the inverse problem for a 1D Gross-Pitaevskii equation (GPE). More precise, the ANN takes the squared modulus of the stationary GPE solution as an input and returns the…

We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…