相关论文: Iterative Solution of the Ornstein-Zernike Equatio…
In this paper, we introduce a new three-step iteration process in Banach space and prove convergence results for approximating fixed points for nonexpansive mappings. Also, we show that the newly introduced iteration process converges…
We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm and subsequently show the strong convergence of the generated…
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…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
In a previous work, we developed the idea to solve Kepler's equation with a CORDIC-like algorithm, which does not require any division, but still multiplications in each iteration. Here we overcome this major shortcoming and solve Kepler's…
Efficient solvers for tensor eigenvalue problems are important tools for the analysis of higher-order data sets. Here we introduce, analyze and demonstrate an extrapolation method to accelerate the widely used shifted symmetric higher order…
In this paper the authors show how to use Riemann-Hilbert techniques to prove various results, some old, some new, in the theory of Toeplitz operators and orthogonal polynomials on the unit circle (OPUC's). There are four main results: the…
We propose a method to solve the Non Perturbative Renormalization Group equations for the $n$-point functions. In leading order, it consists in solving the equations obtained by closing the infinite hierarchy of equations for the $n$-point…
We present a collection of integral equation methods for the solution to the two-dimensional, modified Helmholtz equation, $u(\x) - \alpha^2 \Delta u(\x) = 0$, in bounded or unbounded multiply-connected domains. We consider both Dirichlet…
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…
We present a new solver for nonlinear parabolic problems that is L-stable and achieves high order accuracy in space and time. The solver is built by first constructing a single-dimensional heat equation solver that uses fast O(N)…
We develop efficient and high-order accurate solvers for the Helmholtz equation on complex geometry. The schemes are based on the WaveHoltz algorithm which computes solutions of the Helmholtz equation by time-filtering solutions of the wave…
In this work we are interested in general linear inverse problems where the corresponding forward problem is solved iteratively using fixed point methods. Then one-shot methods, which iterate at the same time on the forward problem solution…
Analysis of the generalized Weierstrass-Enneper system includes the estimation of the degree of indeterminancy of the general analytic solution and the discussion of the boundary value problem. Several different procedures for constructing…
Machine learning approaches relying on such criteria as adversarial robustness or multi-agent settings have raised the need for solving game-theoretic equilibrium problems. Of particular relevance to these applications are methods targeting…
We consider the following system linearly coupled by nonlinear Schr\"odinger equations in $\R^3$ $$ \left\{\begin{array}{ll} -\Delta u_j+u_j=u^3_j-\va\sum\limits_{i\neq j}^N u_i,\{1cm}& x\in \R^3, \{0.2cm}\\ u_j\in H^1(\R^3),\quad…
We define a time-changed fractional Ornstein-Uhlenbeck process by composing a fractional Ornstein-Uhlenbeck process with the inverse of a subordinator. Properties of the moments of such process are investigated and the existence of the…
We consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…
An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…