2013
DOI: 10.1016/j.cpc.2012.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A two-parameter continuation algorithm for vortex pinning in rotating Bose–Einstein condensates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
15
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(16 citation statements)
references
References 39 publications
1
15
0
Order By: Relevance
“…Various SCM have been exploited to solve numerical solutions of the GPE [7,14,20,29]. In particular, the Fourier sine functions [7], the Legendre polynomials [20], and the Chebyshev polynomials of the first kind and second kind [14,29] have been used as the basis functions for the trial function space of the SCM to solve the GPE.…”
Section: A Note On Scmsmentioning
confidence: 99%
See 3 more Smart Citations
“…Various SCM have been exploited to solve numerical solutions of the GPE [7,14,20,29]. In particular, the Fourier sine functions [7], the Legendre polynomials [20], and the Chebyshev polynomials of the first kind and second kind [14,29] have been used as the basis functions for the trial function space of the SCM to solve the GPE.…”
Section: A Note On Scmsmentioning
confidence: 99%
“…In particular, the Fourier sine functions [7], the Legendre polynomials [20], and the Chebyshev polynomials of the first kind and second kind [14,29] have been used as the basis functions for the trial function space of the SCM to solve the GPE. For the Fourier sine functions, one chooses uniform grids on the domain as the collocation points.…”
Section: A Note On Scmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Various condensate geometries [19], simplifications and special cases [20] were taken into account. Numerical methods involved finite-difference approach [19,21,22], bi-k-Lagrange elements [23], spectral collocation methods with Chebyshev polynomials of the first and second kind [24] as well as basis set expansion technique [25]. Time-dependent equations were solved with implicit and semi-implicit Crank-Nicolson methods [26,27,18,28,29], Euler scheme [22], third and fourth-order adaptive Runge-Kutta methods [30], splitstep finite difference method [22] and time-splitting sine and Fourier pseudospectral methods [31,32].…”
Section: Introductionmentioning
confidence: 99%