Related papers: A new convergent algorithm to approximate potentia…
We consider the nonlinear Schrodinger equation, with mass-critical nonlinearity, focusing or defocusing. For any given angle, we establish the existence of infinitely many functions on which the scattering operator acts as a rotation of…
We analyse a class of time discretizations for solving the nonlinear Schr\"odinger equation with non-smooth potential and at low-regularity on an arbitrary Lipschitz domain $\Omega \subset \mathbb{R}^d$, $d \le 3$. We show that these…
We consider the task of recovering a Sobolev function on a connected compact Riemannian manifold $M$ when given a sample on a finite point set. We prove that the quality of the sample is given by the $L_\gamma(M)$-average of the geodesic…
This paper presents a method for the approximation of harmonic potentials that combines downward continuation of globally available data on a sphere $\Omega_R$ of radius $R$ (e.g., a satellite's orbit) with locally available data on a…
We prove several scattering results for dispersion-managed nonlinear Schr\"odinger equations. In particular, we establish small-data scattering for both `intercritical' and `mass-subcritical' powers by suitable modifications of the standard…
We propose an inertial variant of the strongly convergent inexact proximal-point (PP) method of Solodov and Svaiter (2000) for monotone inclusions. We prove strong convergence of our main algorithm under less restrictive assumptions on the…
We prove that the averaged scattering solutions to the Schr\"odinger equation with short-range electromagnetic potentials $(V,A)$ where $V(x)=O(|x|^{-\rho}), A(x)= O(|x|^{-\rho}), |x| \to \infty, \rho >1,$ are dense in the set of all…
This paper presents an accurate highly efficient method for solving the bound states in the one-dimensional Schr\"odinger equation with an arbitrary potential. We show that the bound state energies of a general potential well can be…
The transport of charged particles or photons in a scattering medium can be modelled with a Boltzmann equation. The mathematical treatment for scattering in such scenarios is often simplified if evaluated in a frame where the scattering…
In this paper we examine iterative methods for solving the forward ($A{\bf x}={\bf b}$) and adjoint ($A^{T}{\bf y}={\bf g}$) systems of linear equations used to approximate the scattering amplitude, defined by ${\bf g}^{T}{\bf x}={\bf…
The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is…
In this work, we deal with an iteration method for approximating a fixed point of a contraction mapping using the Mann's algorithm under functional random errors. We first show its almost complete convergence to the fixed point by mean of…
In this paper, based on a successively accuracy-increasing approximation of the $\ell_0$ norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class…
We consider scattering for the discrete Schr\"{o}dinger operator on the square lattice $\mathbb{Z}^d$, $d \ge 1$, with compactly supported potential. We give formulas for finding the phased scattering amplitude from phaseless near-field…
In this paper, we study the almost everywhere convergence results of Schr\"odinger operator with complex time along curves. We also consider the fractional cases. All results are sharp up to the endpoints.
We develop a fixed-point iterative algorithm that computes the matrix projection with respect to the Bures distance on the set of positive definite matrices that are invariant under some symmetry. We prove that the fixed-point iteration…
We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability…
We consider the problem of minimizing a sum of $n$ functions over a convex parameter set $\mathcal{C} \subset \mathbb{R}^p$ where $n\gg p\gg 1$. In this regime, algorithms which utilize sub-sampling techniques are known to be effective. In…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
An inverse scattering method based on an auxiliary inverse Sturm-Liouville problem recently proposed by Horv\'ath and Apagyi [Mod. Phys. Lett. B 22, 2137 (2008)] is examined in various aspects and developed further to (re)construct…