Related papers: Singularity-Avoiding Multi-Dimensional Root-Finder

A new four-component nonlinear Schr\"{o}dinger equation is first proposed in this work and studied by Riemann-Hilbert approach. Firstly, we derive a Lax pair associated with a $5\times5$ matrix spectral problem for the four-component…

This paper primarily presents numerical results for the Anderson accelerated Newton method on a set of benchmark problems. The results demonstrate superlinear convergence to solutions of both degenerate and nondegenerate problems. The…

Second-order methods are of great importance for composite convex optimization problems due to their local super-linear convergence rates (under appropriate assumptions). However, the presence of even a simple nonsmooth function in the…

Multiple solutions are common in various non-convex problems arising from industrial and scientific computing. Nonetheless, understanding the nontrivial solutions' qualitative properties seems limited, partially due to the lack of efficient…

The aim of this paper is to study negative classical solutions to a $k$-Hessian equation involving a nonlinearity with a general weight \begin{equation} \label{Eq:Ma:0} \tag{$P$} \begin{cases} S_k(D^2u)= \lambda \rho(|x|) (1-u)^q &\mbox{in…

The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…

We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…

We prove linear convergence for a new family of modified Dirichlet--Neumann methods applied to quasilinear parabolic equations, as well as the convergence of the Robin--Robin method. Such nonoverlapping domain decomposition methods are…

Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…

Recently Ahmadi et al. (2021) and Tagliaferro (2022) proposed some iterative methods for the numerical solution of linear systems which, under the classical hypothesis of strict diagonal dominance, typically converge faster than the Jacobi…

This paper is concerned with the inverse problem of constructing a symmetric nonnegative matrix from realizable spectrum. We reformulate the inverse problem as an underdetermined nonlinear matrix equation over a Riemannian product manifold.…

We present a new algorithm to solve polynomial equations, and publish its code, which is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement,…

We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.

Explicit solutions to the non-linear field equations of some gravitational theories can be obtained, by means of a Riemann-Hilbert approach, from a canonical Wiener-Hopf factorisation of certain matrix functions called monodromy matrices.…

The Newton-Raphson method is a fundamental root-finding technique with numerous applications in physics. In this study, we propose a parameterized variant of the Newton-Raphson method, inspired by principles from physics. Through analytical…

For a general formulation of linearised hybrid inverse problems in impedance tomography, the qualitative properties of the solutions are analysed. Using an appropriate scalar pseudo-differential formulation, the problems are shown to permit…

We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real…

In this paper, we introduce a quasi-Newton method optimized for efficiently solving quasi-linear elliptic equations and systems, with a specific focus on GPU-based computation. By approximating the Jacobian matrix with a combination of…

We investigate the problem of recovering a partially observed high-rank matrix whose columns obey a nonlinear structure such as a union of subspaces, an algebraic variety or grouped in clusters. The recovery problem is formulated as the…

Fixed-point or Newton-methods are typically employed for the numerical solution of nonlinear systems arising from discretization of nonlinear magnetic field problems. We here discuss an alternative strategy which uses local Quasi-Newton…