A fast algorithm for the solution of the time-independent Gross--Pitaevskii equation

Authors:
Yung-Sze Choi;Juha Javanainen;Israel Koltracht;Marijan Koštrun;Patrick J. McKenna;Nataliya Savytska
Affiliations:
Department of Mathematics, University of Connecticut, Storrs, CT;Department of Physics, University of Connecticut, Storrs, CT;Department of Mathematics, University of Connecticut, Storrs, CT;Department of Physics, University of Connecticut, Storrs, CT;Department of Mathematics, University of Connecticut, Storrs, CT;Department of Mathematics, University of Connecticut, Storrs, CT
Venue:
Journal of Computational Physics
Year:
2003

Citing 3
Cited 1

Matrix analysis

Matrix analysis
Numerical recipes: the art of scientific computing

Numerical recipes: the art of scientific computing
An alternative numerical method for initial value problems involving the contact nonlinear Hamiltonians

Journal of Computational Physics

High accuracy representation of the free propagator

Applied Numerical Mathematics

Quantified Score

Hi-index	31.45

Visualization

Abstract

A new efficient numerical method for the solution of the time-independent Gross-Pitaevskii partial differential equation in three spatial variables is introduced. This equation is converted into an equivalent fixed-point form and is discretized using the collocation method at zeros of Legendre polynomials. Numerical comparisons with a state-of-the-art method based on propagating the solution of the time-dependent Gross-Pitaevskii equation in imaginary time are presented.