Search

We develop convergence acceleration procedures that enable a gradient descent-type iteration method to efficiently simulate Hartree--Fock equations for atoms interacting both with each other and with an external potential. Our development focuses on three aspects: (i) optimization of a parameter in the preconditioning operator; (ii) adoption of a technique that eliminates the slowest-decaying mode to the case of many equations (describing many atoms); and (iii) a novel extension of the above technique that allows one to eliminate multiple modes simultaneously. We illustrate performance of the numerical method for the 2D model of the first layer of helium atoms above a graphene sheet. We demonstrate that incorporation of aspects (i) and (ii) above into the ``plain" gradient descent method accelerates it by at least two orders of magnitude, and often by much more. Aspect (iii) -- a multiple-mode elimination -- may bring further improvement to the convergence rate compared to aspect (ii), the single-mode elimination. Both single- and multiple-mode elimination techniques are shown to significantly outperform the well-known Anderson Acceleration. We believe that our acceleration techniques can also be gainfully employed by other numerical methods, especially those handling hard-core-type interaction potentials., Comment: main text (39 pages); supplement appended (7 pages)

We consider the implementation of the split-step method where the linear part of the nonlinear Schr\"odinger equation is solved using a finite-difference discretization of the spatial derivative. The von Neumann analysis predicts that this method is unconditionally stable on the background of a constant-amplitude plane wave. However, simulations show that the method can become unstable on the background of a soliton. We present an analysis explaining this instability. Both this analysis and the instability itself are substantially different from those of the Fourier split-step method, which computes the spatial derivative by spectral discretization. We also found that the modes responsible for the numerical instability are supported by the sides of the soliton, in contrast to unstable modes of linearized nonlinear wave equations, which (the modes) are supported by the soliton's core., Comment: 25 pages, 8 figures

We obtain local (i.e., linearized) convergence conditions for iterative methods that seek solitary waves with prescribed values of quadratic conserved quantities of multi-component Hamiltonian nonlinear wave equations. These conditions extend the ones found for single-component solitary waves in [J. Yang and T.I. Lakoba, Stud. Appl. Math. {\bf 120}, 265--292 (2008)]. We also show that, and why, these convergence conditions coincide with dynamical stability conditions for ground-state solitary waves., Comment: 20 pages, 1 multi-part figure

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 $M$ is a positive definite self-adjoint operator and $p={\rm const}$. In this paper, we propose a systematic generalization of this method to both scalar and vector Hamiltonian equations with arbitrary form of nonlinearity and potential functions. For scalar equations, our generalized method requires only slightly more computational effort than the original Petviashvili method., Comment: to appear in J. Comp. Phys.; 35 pages

We extend the key idea behind the generalized Petviashvili method of Ref. \cite{gP} by proposing a novel technique based on a similar idea. This technique systematically eliminates from the iteratively obtained solution a mode that is "responsible" either for the divergence or the slow convergence of the iterations. We demonstrate, theoretically and with examples, that this mode elimination technique can be used both to obtain some nonfundamental solitary waves and to considerably accelerate convergence of various iteration methods. As a collateral result, we compare the linearized iteration operators for the generalized Petviashvili method and the well-known imaginary-time evolution method and explain how their different structures account for the differences in the convergence rates of these two methods., Comment: to appear in J. Comp. Phys.; 24 pages