Related papers: An iterative method for spherical bounces
An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…
The tunneling decay rate per unit volume in Quantum Field Theory (QFT), at order $\hbar$, is given by $\Gamma/V = Ae^{-B}$, where $B$ is the Euclidean action evaluated at the so-called bounce, and $A$ is proportional to the determinant of a…
Approximate but reliable solutions of a quantum system with $N$ identical particles can be easily computed with the envelope theory, also known as the auxiliary field method. This technique has been developed for Hamiltonians with arbitrary…
In this paper, we first establish the convergence criteria of the residual iteration method for solving quadratic eigenvalue problem- s. We analyze the impact of shift point and the subspace expansion on the convergence of this method. In…
In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical…
A classical way for exploring the scattering behavior of a small sphere is to approximate Mie coefficients with a Taylor series expansion. This ansatz delivered a plethora of insightful results, mostly for small spheres supporting localized…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We introduce a new iterative method to recover a real compact supported potential of the Schr\"odinger operator from their fixed angle scattering data. The method combines a fixed point argument with a suitable approximation of the…
We discuss three ways of obtaining the Born approximations for Coulomb scattering: The standard way, making use of a convergence factor ("screening"), Oppenheimer's way using cylindrical (instead of spherical) coordinates, and finally…
We obtain a nonperturbative, analytical solution to integral equation of scattering theory by assuming the field within the scattering object is a spherical wave with a scattering amplitude equal to that of the far field. This approximation…
We introduce and investigate an iterative scheme for approximating common fixed point of a family of Bregman relatively-nonexpansive mappings in real reflexive Banach spaces. We prove strong convergence theorem of the sequence generated by…
The Feynman-Kac formula for the exterior-value problem for the fractional Laplacian leads to a walk-outside-spheres algorithm via sampling alpha-stable Levy processes on their exit from maximally inscribed balls and sampling their…
In this paper, we extend the analysis of the subcritical approximation of the Nirenberg problem on spheres recently conducted in \cite{MM19, MM}. Specifically, we delve into the scenario where the sequence of blowing up solutions exhibits a…
Differential equations of the form $\ddot R=-kR^\gamma$, with a positive constant $k$ and real parameter $\gamma$, are fundamental in describing phenomena such as the spherical gravitational collapse ($\gamma=-2$), the implosion of…
In this paper, explicit method of constructing approximations (the Triangle Entropy Method) is developed for nonequilibrium problems. This method enables one to treat any complicated nonlinear functionals that fit best the physics of a…
Scalars carrying a conserved global charge $Q$ can form stable localized field configurations composed of a large number of particles. These non-topological solitons are spherically symmetric and are called Q-balls. While usually analyzed…
Gradient descent method, as one of the major methods in numerical optimization, is the key ingredient in many machine learning algorithms. As one of the most fundamental way to solve the optimization problems, it promises the function value…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
Take a multidimensional normally or obliquely reflected diffusion in a smooth domain. Approximate it by solutions of stochastic differential equations without reflection using the penalty method. That is, we approximate the reflection term…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…