相关论文: Modified Potra-Pt\'ak method to determine the mult…

The convergence analysis of a third-order scheme for the highly nonlinear Landau-Lifshitz-Gilbert equation with a non-convex constraint is considered. In this paper, we first present a fully discrete semi-implicit method for solving the…

Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…

We investigate the iterative methods proposed by Maz'ya and Kozlov (see [KM1], [KM2]) for solving ill-posed inverse problems modeled by partial differential equations. We consider linear evolutionary problems of elliptic, hyperbolic and…

This research investigates using a mixed-precision iterative refinement method using posit numbers instead of the standard IEEE floating-point format. The method is applied to solve a general linear system represented by the equation $Ax =…

Nonnegative matrix factorization has been widely applied in face recognition, text mining, as well as spectral analysis. This paper proposes an alternating proximal gradient method for solving this problem. With a uniformly positive lower…

In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…

Using matrix function theory, Perron-Frobenius theory, combinatorial matrix theory, and elementary number theory, we characterize, classify, and describe in terms of the Jordan canonical form the matrix pth-roots of imprimitive irreducible…

In this paper we study nonlinear partial differential equations (PDEs) that are used to model different value adjustments denoted generally as xVA. These adjustments are nowadays commonly added to the risk-free financial derivative values…

The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…

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…

We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…

In this paper, we introduce a novel approach called the Iterative Aboodh Transform Method (IATM) which utilizes Daftardar--Jafari polynomials for solving non-linear problems. Such method is employed to derive solutions for non-linear…

The Monte Carlo method is a thriving and mathematically beautiful numerical technique used extensively, nowadays, to deal with many demanding problems in diverse fields. Here, we present an iterative Monte Carlo algorithm to work out very…

The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…

In this pedagogical article, we present a simple direct matrix method for analytically computing the Jacobian of nonlinear algebraic equations that arise from the discretization of nonlinear integro-differential equations. The method is…

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

We compare three methods to calculate the nucleon-nucleon t-matrix based on the three-dimensional formulation of J. Golak et al., Phys. Rev. C 81, 034006, (2010). In the first place we solve a system of complex linear inhomogeneous…

Fixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one. We ask whether such stagnation can be removed without storing long…

In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…

In this paper, we investigate a class of non-convex sum-of-ratios programs relevant to decision-making in key areas such as product assortment and pricing, and facility location and cost planning. These optimization problems, characterized…