Related papers: Aitken delta-squared generalized Juncgk-type itera…
The seminal paper of Jordan, Kinderlehrer, and Otto introduced what is now widely known as the JKO scheme, an iterative algorithmic framework for computing distributions. This scheme can be interpreted as a Wasserstein gradient flow and has…
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
In this paper we address the numerical solution of nonlinear ill-posed systems by iterative regularization methods in the classes of Levenberg-Marquardt, trust-region and adaptive quadratic regularization procedures. Both with exact and…
This paper deals with the construction of numerical stable solutions of random mean square Fisher-KPP models with advection. The construction of the numerical scheme is performed in two stages. Firstly, a semidiscretization technique…
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper begins the general study of…
The Petviashvili's iteration method has been known as a rapidly converging numerical algorithm for obtaining fundamental solitary wave solutions of stationary scalar nonlinear wave equations with power-law nonlinearity: \ $-Mu+u^p=0$, where…
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…
Laurin\v{c}ikas proposed that whether the universality theorem for the Riemann zeta-function shifted by an exponential function holds or not. This problem is solved for more general shifts by Andersson et al. In this paper, we generalize…
Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.
This article provides a general iterative approximation to partial differential equations, and thus establish existence of smooth solution. The heart of the method is to contract (or expand) the boundary conditions uniformly in the domain,…
In [Haglund, Remmel, Wilson 2018] the authors state two versions of the so called Delta conjecture, the rise version and the valley version. Of the former, they also give a more general statement in which zero labels are also allowed. In…
The generalized alternating direction method of multipliers (ADMM) of Xiao et al. [{\tt Math. Prog. Comput., 2018}] aims at the two-block linearly constrained composite convex programming problem, in which each block is in the form of…
In this paper we propose a new iteration process, called the K iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing leading iteration processes like Picard-S iteration process,…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
Globalization concepts for Newton-type iteration schemes are widely used when solving nonlinear problems numerically. Most of these schemes are based on a predictor/corrector step size methodology with the aim of steering an initial guess…
An iterative scheme for solving ill-posed nonlinear equations with locally $\sigma$-inverse monotone operators is studied in this paper. A stopping rule of discrepancy type is proposed. The existence of $u_{n_\delta}$ satisfying the…
A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We consider the variance of a function of $n$ independent random variables and provide new inequalities which, in particular, extend previous results obtained for symmetric functions in the i.i.d.~setting. For instance, we obtain various…