Verticillate Structures in Multi-Component Bose-Einstein Condensates
Shu-Ming Changa
Department of Mathematics National Tsing Hua University
Hsinchu, Taiwan
December 18, 2004
aThis is a joint work with Chang-Shou Lin (NCCU), Tai-Chia Lin (NTU), Wen-Wei Lin (NTHU) & Shih-Feng Shieh (NTHU).
Outline
• Introduction of Bose-Einstein Condensation (BEC)
• Coupled Nonlinear Schr¨odinger Equations and Coupled Gross-Pitaevskii Equations (CGPEs)
• Nonlinear Algebraic Eigenvalue Problems (NAEPs)
• Fixed Point Iteration for NAEPs
• Numerical Results
• Conclusions
Results
• Theoretical
– Propose a Jacobi-type fixed point iteration (J-FPI) and a Gauss-Seidel-type fixed point iteration (GS-FPI) to solve Multi-Component BEC.
– Prove that the GS-FPI method converges locally and linearly to a fixed point if and only if the associated
minimized energy functional problem has a strictly local minimum at the feasible fixed point.
• Numerical
– Simulate multi-component BEC.
– A New phenomenon: verticillate multipling structure.
1 Introduction of BEC
• What is BEC?
A new form of matter at the coldest temperatures in the universe...
• Theoretical prediction 1924 ...
– S. Bose: derived Planck’s black body radiation law from considering the cavity radiation as an ideal photon gas and worked out Bose statistics for photons.
– A. Einstein: generalized Bose statistics to other Bosonic particles and atoms (Bose-Einstein statistics) and predicted if the atoms were cold enough, almost all of the particles would congregate in the ground states (BEC).
A. Einstein S. Bose
• Physical experiments – Superfluid He4 1938:
P. L. Kapitza, Allen and Misener: discovered the superfluidity of liquid helium.
F. London: proposed that the superfluid fraction consisting of those atoms which have “condensed” to the ground state.
P. L.Kapitza F. London
• – E. A. Cornell & C. E. Wieman (JILA, 1995):
first observed BEC of rubidium (87Rb) atoms at 20 nK, i.e.
0.000 000 02 K.
C. E. Wieman & E. A. Cornell BEC at 400, 200, and 50 nK
– W. Ketterle (MIT, 1995):
observed BEC of sodium (23Na) atoms.
W. Ketterle Two-Component BEC
• Experimental implementation
– The BEC named Science Magazine’s ”Molecule of the Year 1995”!
– Nobel Prize in Physics (2001), E. A. Cornell, C. E. Wieman (JILA), W. Ketterle (MIT):
for the achievement of BEC in dilute gases of alkali atoms, and for early fundamental studies of the properties of the condensates.
• Applications of BEC: atom laser, quantum computer, MEMS.
• Mathematical model: nonlinear Schr¨odinger equations, Gross-Pitaevskii equations (GPEs), coupled nonlinear
Schr¨odinger equations, coupled Gross-Pitaevskii equations (CGPEs).
2 Coupled Nonlinear Schr¨ odinger Eqs.
and CGPEs
ι~∂ψj(x, t)
∂t = − ~2
2ma∇2ψj+ bVjψj+µjj|ψj|2ψj+X
j6=i
µij|ψi|2ψj, j = 1, . . . , m.
• Coupled Gross-Pitaevskii equations (CGPEs):
ι~∂ψ(x, t)
∂t = − ~2
2ma ∇2ψ(x, t) + bV (x) ◦ ψ(x, t) + bB(ψ) ◦ ψ(x, t), (2.1) ψ(x, t) = (ψ1(x, t), . . . , ψm(x, t))⊤: wave ft.,
Vb (x) = ( bV1(x), . . . , bVm(x))⊤: trap potential,
Bb (ψ) = ( bB1(ψ), . . . , bBm(ψ))⊤: intra- and inter-species scattering
Vbj(x) = ma
2 ωx,j2 (x − ˆx0,j)2 + ωy,j2 (y − ˆy0,j)2 + ωz,j2 (z − ˆz0,j)2 . µjℓ = 4π~m2bjℓ
a , bjℓ: scattering length. (+: repulsive, −: attractive) Z
D
|ψj(x, t)|2dx = Nj0 > 0, j = 1, . . . , m.
Assume that
(i) ωx,1 ≤ · · · ≤ ωx,m ≤ ωy,1 ≤ · · · ≤ ωy,m ≤ ωz,1 ≤ · · · ≤ ωz,m. (ii) bjℓ = bℓj, j, ℓ = 1, . . . , m.
• Dimensionless
˜t = t
ts, x˜ = x
xs, ψ˜j(˜x, ˜t) = x3/2s qNj0
ψj(x, t).
ts = 1
ωx,1 : dimensionless “time”.
xs =
s ~
maωx,1 : dimensionless “length”.
• Dimensionless CGPEs
ι∂ψ(x, t)
∂t = −1
2∇2ψ(x, t) + V (x) ◦ ψ(x, t) + B(ψ) ◦ ψ(x, t), (2.2)
ψ(x, t) = 0, x ∈ D, (2.3)
D: A smooth bounded domain in Rd, d = 2, 3, n(ψj) :=
Z
D
|ψj(x, t)|2dx = 1, j = 1, . . . , m,
B(ψ) = (B1(ψ), . . . , Bm(ψ))⊤, Bj(ψ) = βj1|ψ1|2 + · · · + βjm|ψm|2.
ψ(x, t) = (ψ1(x, t), . . . , ψm(x, t))⊤, V (x) = (V1(x), . . . , Vm(x))⊤,
Vj(x) = 1
2(γx,j2 (x − x0,j)2 + γy,j2 (y − y0,j)2 + γz,j2 (z − z0,j)2), γx,j = ωx,j
ωx,1, γy,j = ωy,j
ωx,1, γz,j = ωz,j ωx,1 , x0,j = xˆ0,j
b0 , y0,j = yˆ0,j
b0 , z0,j = zˆ0,j b0 , βj,ℓ = µjℓNℓ0
b30~ωx,1 = 4π~2bjℓNℓ0
mab30~ωx,1 = 4πbjℓNℓ0 b0 .
Energy
E(ψ) =
Xm j=1
Nj0
N0 Ej(ψ),
where Nj0 > 0 is the number of particles with Pm
j=1
Nj0 = N0 and
Ej(ψ) = Z
D
"
1
2|∇ψj|2 + Vj(x)|ψj|2 + 1 2
Xm k=1
βj,k|ψj|2|ψk|2
# dx, for j = 1, . . . , m.
Let ψ(x, t) = e−ιλ(c)t ◦ φ(x), where λ(c) = (λ(c)1 , . . . , λ(c)m )⊤, φ(x) = (φ(x), . . . , φm(x))⊤.
Substituting ψ(x, t) into CGPEs gives the NEP for (λ, φ):
λ(c) ◦ φ(x) = −1
2∇2φ(x) + V (x) ◦ φ(x) + B(φ) ◦ φ(x), (2.4) with
Z
D
|φj(x)|2dx = 1, j = 1, . . . , m, where
B(φ) = (B1(φ), . . . , Bm(φ))⊤, Bj(φ) =
Xm k=1
βjk|φk|2.
Multiplying the j-th eq. in NEP (2.4) by φj(x), the eigenvalue λ(c)j and the corresp. eigenfunction φj for (2.4) satisfy
λ(c)j = Z
D
"
1
2|∇φj|2 + Vj(x)|φj|2 +
Xm k=1
βjk|φj|2|φk|2
# dx
= Ej(φ) + 1 2
Z
D
Xm k=1
βjk|φj|2|φk|2dx.
The ground state φg(x) of multi-comp. BEC can be found by minimizing E(φ):
Minimize
φ=(φ1,...,φm)⊤E(φ) subject to
Z
D
|φj(x)|2dx = 1, j = 1, . . . , m,
(2.5)
where E(φ) = Pm j=1
Nj0
N0Ej(φ) with Ej(φ) =
Z
D
"
1
2|∇φj|2 + Vj(x)|φj|2 + 1 2
Xm k=1
βjk|φj|2|φk|2
# dx.
The NEP (2.4) can be regarded as the Euler-Lagrange eq. of the opt. problem (2.5).
3 Nonlinear Algebraic Eigenvalue Problems (NAEPs)
For computational purpose, we derive the discretization of NEP and the associated opt. problem. We consider D ⊆ R2 a bounded domain.
The central finite difference discretizes −∇2φj(x) into Auj = A[uj1, . . . , ujl, . . . , ujN]⊤, A ∈ RN ×N, where uj is an approx. of the j-th wave ft. φj(x).
Ab and bA⊤ are irreducible and diag.-dominant with positive diag.
and nonpositive off-diag. elements. bA is symmetrizable to a s.p.d.
A by a D > 0, i.e.,
Ab = D−1AD, A⊤ = A ≻ 0.
1
2 1 32 2 52 3 72 4
Note that D = diag(dl1,l2) with d2l1,l2 = (l1 − 12)δr2δθ is equal to the area of the (l1 + ν(l2 − 1))-th sector.
Applying −∇2 ≈ A to NEP and rewriting uj ≡ huj, βjk = βhjk2 , the discretization of NEP, referred as a NAEPs, can be formulated by
1
2Auj + V j ◦ uj +
Xm k=1
βjku k2 ◦ uj = λ(c)j uj, (3.1) u⊤j uj = 1, j = 1, . . . , m, (3.2) where V j = [Vj, . . . , Vj], j = 1, . . . , m. h is the grid size.
Let u = (u⊤1 , . . . , u⊤m)⊤. Since the j-th kinetic energy Z
D
1
2|∇φj|2dx = − Z
D
φj(∇2φj)dx,
we approximate it by 12u⊤j Auj. Then the discretized eq. of the j-th energy Ej(φ) becomes
Ej(u) = 1
2u⊤j Auj + V ⊤j u j2 + 1 2
Xm k=1
βjku k2 ⊤u j2 .
Multiplying NAEPs (3.1) by u⊤j , the eigenvalues
λ(c) = (λ(c)1 , . . . , λ(c)m )⊤ and the assoc. EVs u = (u⊤1 , . . . , u⊤m)⊤ satisfy
λ(c)j = 1
2u⊤j Auj + V ⊤j u j2 +
Xm k=1
βjku k2 ⊤u j2
= Ej(u) + 1 2
Xm k=1
βjku k2 ⊤u j2 , j = 1, . . . , m.
Furthermore, E(u) =
Xm j=1
Nj0
N0 Ej(u) =
Xm j=1
Nj0
N0 λ(c)j − 1 2
Xm k=1
βjku k2 ⊤u j2
! .
For convenience, we let Nj0/N0 = 1/m. Then
E(u) = 1 m
Xm j=1
Ej(u) = 1 2m
Xm j=1
u⊤j Auj + 1 m
Xm j=1
V ⊤j u j2
+ 1 2m
Xm j=1
βjju j2 ⊤u j2 + 1 m
X
1≤j<k≤m
βjku k2 ⊤u j2 . The discretization of the opt. problem (2.5) becomes
Minimize
u=(u⊤1 ,...,u⊤m)⊤E(u)
subject to u⊤j uj = 1, j = 1, . . . , m.
(3.3)
Applying the optimality condition to the opt. problem (3.3), a local minimum ((λ(L)1 , . . . , λ(L)m ), (u⊤1 , . . . , u⊤m)⊤) satisfies the Karash-Kuhn-Tucker (KKT) eq.
1 m
A + [[V j]] + 2βjj[[u j2 ]]
uj + 2 m
X
k6=j
βjku k2 ◦ uj = 2λ(L)j uj, (3.4) where {λ(L)j }mj=1 are Lagrange multipliers. Multiplying (3.4) by
m/2 gives 1
2Auj + V j ◦ uj +
Xm k=1
βjku k2 ◦ uj = mλ(L)j uj.
We now define
Aj := A + 2[[V j]] + 2βjj[[u j2 ]],
λj := 2mλ(L)j , βjk := 2βjk, j 6= k, for j, k = 1, . . . , m. Then the NAEPs becomes
Ajuj + X
k6=j
βjku k2 ◦ uj = λjuj, j = 1, . . . , m and the associated opt. problem (3.3) becomes
Minimize
u=(u⊤1 ,...,u⊤m)⊤E(u)
subject to u⊤j uj = 1, j = 1, . . . , m, where
E(u) ≡
Xm 1
2u⊤j Auj + V ⊤j u j2
+ 1 2
X βjku k2 ⊤u j2 .
4 Fixed Point Iteration for NAEPs
Define
M = {v ∈ RN|v⊤v = 1, v ≥ 0}, M= interior of M.◦ We suppose
βjj > 0 small, βjk = βkj > 0 (j 6= k), j, k = 1, . . . , m.
A in (3.1) is diagonal dominant and Ae 0, where e = (1, . . . , 1)⊤. For V j ≥ 0 and (u1, . . . , um) ∈ ×m
j=1 M, the matrix A¯ j ≡ Aj +
Xm k=1
[[βjku k2 ]],
−1
By Perron-Frobenious Theorem there is a unique positive eigenvector ¯uj > 0 with ¯u⊤j u¯j = 1 corresp. to the maximal eigenvalue µmaxj of ¯A−1j . i.e., ¯uj > 0 is uniquely determined by (u1, . . . , um) and satisfies
A¯ju¯j ≡ Aj +
Xm k=1
[[βjku k2 ]]
!
¯
uj = λminj u¯j, where λminj = 1/µmaxj and ¯u⊤j u¯j = 1, for j = 1, . . . , m.
We now define a function f : ×m
j=1 M → ×m
j=1 M by f(u1, . . . , um) = (¯u1, . . . , ¯um), where ¯uj > 0 is well-defined, j = 1, . . . , m.
Theorem 4.1 The function f given has a fixed point in ×m
j=1
M. In◦
other words, there is a point (u∗1, . . . , u∗m) ∈ ×m
j=1
M and◦
λ = (λ∗1, . . . , λ∗m) which solve the NAEPs, that is, Aju∗j +
Xm k=1
βjku∗ k 2 ◦ u∗j = λ∗ju∗j, j = 1, . . . , m.
We define the restricted Lagragian function of the opt. problem by L(u) = E(u) − 1
2
Xm j=1
λj(u⊤j uj − 1),
where
E(u) ≡ 1 2
Xm j=1
u⊤j Ajuj + 1 2
X
1≤j<k≤m
βjku k2 ⊤u j2 .
Theorem 4.2 Let u∗ = (u∗1, . . . , u∗m) be a KKT point of the opt.
problem assoc. with the Lagrangian multipliers (λ∗1, . . . , λ∗m).
Denote the Hessian of L(u) at u∗ by ∇2L(u∗) =
∇2L(u∗)ijm i,j=1, where
∇2L(u∗)jj = Aj +
Xm k=1
[[βjku∗ k 2 ]] − λ∗jIN
!
and
∇2L(u∗)ij = ∇2L(u∗)ji = 2[[βjiu∗i ◦ u∗j]], j 6= i, Let d = (d⊤1 , . . . , d⊤m)⊤ ∈ RN m. The positivity condition
d⊤(∇2L(u∗))d > 0
holds, for all d with u∗j⊤dj = 0, j = 1, . . . , m, if and only if u∗ is a
Jacobi Iteration (JI)
Define f : ×m
j=1 M → ×m
j=1 M by
f(u1, . . . , um) = (¯u1, . . . , ¯um), where ¯uj > 0 is well-defined, j = 1, . . . , m.
Theorem 4.3 Let (λ∗, u∗) = ((λ∗1, . . . , λ∗m), (u∗1, . . . , u∗m)) be a
fixed point of NAEPs. Suppose βjj > 0 suff. small, j = 1, . . . , m. If the JI converges to (λ∗, u∗) locally and linearly with an initial in
×m j=1
M, then u◦ ∗ = (u∗1, . . . , u∗m) is a strictly local min. of the opt.
problem.
Gauss-Seidel Iteration (GSI)
Define g : ×m
j=1 M → ×m
j=1 M by
g(u1, . . . , um) = (¯u1, . . . , ¯um), where
¯
u1 = g1(u1, . . . , um) = f1(u1, u2, . . . , um),
¯
u2 = g2(u1, . . . , um) = f2(¯u1, u2, u3, . . . , um),
... ...
¯
um = gm(u1, . . . , um) = fm(¯u1, ¯u2, . . . , ¯um−1, um),
in which {fj}mj=1 are given in JI. The ft. g defines a Gauss-Seidel
Theorem 4.4 Let (λ∗, u∗) = ((λ∗1, . . . , λ∗m), (u∗1, . . . , u∗m)) be a fixed point of the NAEPs. Suppose the matrix Z⊤∇2L(u∗)Z is nonsingular. Suppose βjj > 0 suff. small, j = 1, . . . , m. The GSI converges to (λ∗, u∗) locally and linearly with an initial in ×m
j=1
M iff◦
u∗ = (u∗1, . . . , u∗m) is a strictly local min. of the opt. problem.
J∗s = Ω∗12J∗fΩ∗−12 = −2 [ ∗ ],
0 β12Ω
∗− 12 1 Z∗T
1 [[u∗ 1 ◦ u∗
2 ]]Z∗ 2Ω
∗− 12
2 · · · · · · β1mΩ
∗− 12 1 Z∗T
1 [[u∗ 1 ◦ u∗
m ]]Z∗ mΩ
∗− 12 m
0 β2mΩ
∗− 12 2 Z∗T
2 [[u∗ 2 ◦ u∗
m ]]Z∗ mΩ
∗− 12 m ..
.
.. .
Symm.
..
. βm−1,mΩ
∗− 12 m−1Z∗T
m−1[[u∗ 1 ◦ u∗
2 ]]Z∗ mΩ
∗− 12 m 0
where
Ω∗12 = diag{Ω∗112, . . . , Ω∗m12}, Ω∗j = diagn
1
ζj2∗ −λ∗j , . . . , ζ∗ 1
jN−λ∗j
o.
5 Numerical Results
Two-component BEC
(a) green: β∗ = 1000, λ∗1 = λ∗2 = 7.07, E(u∗) = 7.02
(b) red: β∗ = 1000, λ∗ = 10.34, λ∗ = 14.54, E(u∗) = 12.43
0 4.1 10.8 20 40 2
4 6 8 10 12 14 16
1061071081091010
β1 β2
(a) m = 2
β
Eigenvaluesλ
∗ 1(β),λ
∗ 2(β)
0 4.1 10.8 20 40
2 4 6 8 10 12 14
106107 108 109 1010
m = 2
β1 β2
(b)
β EnergyE(u∗ (β))
Figure 5.1: (a): Eigenvalue curves, (b): energy curves, vs β.
Three-component BEC
(a) green: β∗ = 1000, λ∗1 = λ∗2 = λ∗3 = 9.57, E(u∗) = 9.52
(b) red: β∗ = 1000, λ∗1 = λ∗3 = 18.36, λ∗2 = 20.85, E(u∗) = 19.09
(c) blue: β∗ = 1000, λ∗1 = 20.84, λ∗2 = 24.84, λ∗3 = 32.14, E(u∗) = 25.85
0 3.9 10.8 20 29.4 40 0
5 10 15 20 25 30 35
106107 108 109 1010
β1 β2
β3 (a)
β
Eigenvalueλ
∗ j(β),j=1,2,3
0 3.9 10.8 20 29.4 40
0 5 10 15 20 25 30
106107 108 109 1010
m = 3
β1 β2
β3 (b)
β EnergyE(u∗ (β))
Figure 5.2: (a): Eigenvalue curves, (b): energy curves, vs β.
Verticillate Structures
• How to distribute in multi-component BEC when the scattering length is sufficiently large?
• All positive bound state solutions may repel each other and form finitely segregated nodal domains when scattering length approaches to infinity.
• Verticillate: [Botany] leaf, arranged in verticils.
We observe that verticillate or multiple verticillate structure (i) (n1, . . . , nγ) depends on m and
Pγ i=1
ni = m (β ≫ 1), (Single, Double, Triple, Quadruple verticillate, ...) (ii) 1 ≤ n1 ≤ 5.
Figure 5.3: Single, Double, Triple, Quadruple verticillate:
2 3 4 5 6 7 5
10 15 20 25
8 9 10 11 12 13 14
20 25 30 35 40 45 50
45 50 55 60 65 70 75 80
70 80 90 100 110 120 (2)
(3)
(4)
(5)
(1,5)
(2,7) (1,7)
(1,6)
(3,9) (2,9)
(2,8)
(4,10) (4,9)
(1,6,10)
(1,5,12) (1,5,13)
(1,7,12) (1,7,13)
(2,8,12)
(2,8,14)
(3,8,14) (3,9,14)
(4,9,14) (4,10,14) (1,3)
(1,4)
(6)
(7)
(8) (1,8)
(9)
(1,20)
(1,10) (12)
(10)
(1,19) (1,18)
(1,17) (1,16)
(1,15) (1,14)
(1,13)
(1,21) (1,22)
(1,23)
(1,24) (1,25)
(1,12)
(1,27) (1,11)
(1,26) (1,9)
(a)
(d) (c)
(b)
Energy
29 30 31 32 33 70
80 90 100 110 120 130
(1,28)
(1,29)
(4,10,15)
(5,10,15)
(5,10,16)
(1,5,11,15)
(1,5,11,16)
m-component BEC (e)
Energy
(i) Single verticillate (2) occur- ring at m = 2,
(ii) Double verticillate (1,5) oc- curring at m = 6,
(iii) Triple verticillate (1,6,10) occurring at m = 17,
(iv) Quadruple verticillate (1,5,11,15) occurring at m = 32.
(a) (b)
Figure 5.4: m = 5: (a) Ground state solutions, (b) bound state
(a) (b)
Figure 5.5: m = 6: (a) Ground state solutions, (b) bound state solutions.
(a) m = 14 (b) m = 17
(a) m = 29 (b) m = 32
Figure 5.7: Ground state solutions, (a) m = 29, (b) m = 32.
0 2.75 5.37 10 0
5 10 15 20 25 30 35
Λ
Energy
(1)
(1,8) (1,7)
(2,7)
(1,8) (2,7)
(9)
Λ1(9)
Λ2(9)
105 105.5 106
6 Conclusion
• Theoretical
– The JI and GSI are proposed from the viewpoint of eigenvalue approach.
– The necessary and sufficient conditions of convergence of the GSI method are proven that the energy functional has a strictly local minimum at the fixed point.
• Numerical
– GSI method converges much faster than JI, globally and linearly between 10 to 20 steps.
– New phenomenon: verticillate multipling.
• Future works
7 Numerical Algorithms
Gauss-Seidel Type Iteration (GSI(m))
(i) Given Aj = A + 2[[V j]] + 2βjj[[u(0) j 2 ]], βjj ≪ 0, βjk = βkj ≥ 0 (j 6= k), j, k = 1, . . . , m and u(0)j > 0 with ku(0)j k2 = 1,
j = 1, . . . , m. Let n = 0;
(ii) Repeat n: until convergence, (ii) For j = 1, . . . , m,
Use e.g., the Shift-Invert Arnoldi algorithm or the
Jacobi-Davidson algorithm to solve the minimal positive EW.
λ(n+1)j of A(n+1)j and the assoc. EV u(n+1)j with ku(n+1)j k2 = 1, where
A(n+1)j := Aj + X
k<j
[[βjku(n+1)j ]] + X
k≥j
[[βjku(n)j ]],
Comment: we denote u(n+1)j =fj(u(n+1)1 , . . . , u(n+1)j−1 ,u(n)j+1, . . . , u(n)m );
(iv) Compute the residual,
res(n+1)j = A(n+1)j u(n+1)j − λ(n+1)j u(n+1)j , j = 1, . . . , m, (7.1) (v) If kres(n+1)j k2 < Tol, j = 1, . . . , m, then stop, else n ← n + 1, go
to Repeat.
Variant GSI(2)≡ V1-GSI(2)
(i) Given Aj = A + 2[[V j]] + 2αj[[u(0) j 2 ]], u(0)j > 0 with ku(0)j k2 = 1, j = 1, 2, αj ≪ 1, β > 0; Let n = 0;
(ii) Repeat n: until convergence,
(iii) Compute u(n+1)1 = f1(u(n)2 ), u(n+1)1 ← nl(ave(u(n+1)1 )), Compute u(n+1)2 = f2(u(n+1)1 ),
(iv) Compute the residuals as in (7.1),
(v) If converges, then stop; else n ← n + 1, go to Repeat (ii).
Variant GSI(3)
(i) Given Aj := A + 2[[V j]] + 2αj[[u(0) j 2 ]], u(0)j > 0 with ku(0)j k2 = 1, j = 1, 2, 3, αj ≪ 1, β > 0; Let n = 0;
(ii) Repeat n: until convergence, V1-GSI(3)
(iii) Compute u(n+1)1 = f1(u(n)2 , u(n)3 ), u(n+1)1 ← nl(ave(u(n+1)1 )), Compute u(n+1)2 = f2(u(n+1)1 , u(n)3 ),
u(n+1)3 = f3(u(n+1)1 , u(n+1)2 ),
(iv) Compute the residuals as in (7.1),
(v) If converges, then stop, else n ← n + 1, go to Repeat (ii);
V2-GSI(3)
(iii) Compute u(n+1)1 = f1(u(n)2 , u(n)3 ), u(n+1)1 ← nl(ave(u(n+1)1 )), Compute u(n+1)2 = f2(u(n+1)1 , u(n)3 ), u(n+1)2 ← nl(ave(u(n+1)2 )), Compute u(n+1)3 = f3(u(n+1)1 , u(n+1)2 ),
(iv) Compute the residuals as in (7.1),
(v) If converges, then stop; else n ← n + 1, go to Repeat (ii).
The energy curves E(u∗(β)) in Figure 7.10(b) and 7.11(b) are computed by
E(u∗(β)) = 1 2
Xm j=1
u∗j⊤Aju∗j + β 2
X
1≤j<k≤m
u∗ k 2 ⊤u∗j 2 .
Table 7.1: (g): ground states, (b): bound states.
m = 2 m = 3 green curves (g) GSI(2) GSI(3) red curves (b) V1-GSI(2) V1-GSI(3) blue curves (b) — V2-GSI(3)
(a) green: β∗ = 1000, λ∗1 = λ∗2 = 7.07, E(u∗) = 7.02
(b) red: β∗ = 1000, λ∗ = 10.34, λ∗ = 14.54, E(u∗) = 12.43
Table 7.2: Two-component BEC.
θ = π, m = 2 green red
(0, β1) λ∗1 = λ∗2, u∗1 = u∗2 —
(β1, β2) λ∗1 = λ∗2, λ∗1 = λ∗2, u∗1 = u∗2 (β2, β∞) u∗2 = Rθ(u∗1) λ∗1 6= λ∗2,
u∗j = ave(u∗j), j = 1, 2
0 4.1 10.8 20 40 2
4 6 8 10 12 14 16
1061071081091010
β1 β2
(a) m = 2
β
Eigenvaluesλ
∗ 1(β),λ
∗ 2(β)
0 4.1 10.8 20 40
2 4 6 8 10 12 14
106107 108 109 1010
m = 2
β1 β2
(b)
β EnergyE(u∗ (β))
Figure 7.10: (a): Eigenvalue curves, (b): energy curves, vs β.
(a) green: β∗ = 1000, λ∗1 = λ∗2 = λ∗3 = 9.57, E(u∗) = 9.52
(b) red: β∗ = 1000, λ∗1 = λ∗3 = 18.36, λ∗2 = 20.85, E(u∗) = 19.09
(c) blue: β∗ = 1000, λ∗1 = 20.84, λ∗2 = 24.84, λ∗3 = 32.14, E(u∗) = 25.85
Table 7.3: Three-component BEC.
θ = 2π3 , m = 3 green red blue
(0, β1) λ∗1 = λ∗2 = λ∗3,
u∗1 = u∗2 = u∗3 — —
(β1, β2) —
(β2, β3)
λ∗1 = λ∗2 = λ∗3, u∗2 = Rθ(u∗1), u∗3 = Rθ(u∗2)
λ∗1 = λ∗2 6= λ∗3, u∗1 = u∗2,
{u∗j = ave(u∗j)}3j=1
(β3, β∞)
λ∗1 6= λ∗2 = λ∗3, u∗1 = Rπ(u∗1), u∗3 = Rπ(u∗2)
λ∗1 6= λ∗2 6= λ∗3, {u∗j = ave(u∗j)}3j=1
0 3.9 10.8 20 29.4 40 0
5 10 15 20 25 30 35
106107 108 109 1010
β1 β2
β3 (a)
β
Eigenvalueλ
∗ j(β),j=1,2,3
0 3.9 10.8 20 29.4 40
0 5 10 15 20 25 30
106107 108 109 1010
m = 3
β1 β2
β3 (b)
β EnergyE(u∗ (β))
Figure 7.11: (a): Eigenvalue curves, (b): energy curves, vs β.