Michael Trott@
Wolfram Research, Inc., 100 Trade Center Drive, Champaign Illinois 61820-7237
April 5, 2001
This paper offers a demonstration of the appearance and general document features of the Physical Review style sheet as adapted from the American Physical Society specifications for journal submissions. Although the topics in this paper were written specifically for Publicon, it is hoped they will nonetheless be regarded with interest by the physics community. © 2004 Wolfram Research, Inc.
PACS numbers: 0000-1111-222
As is well known, only a very limited number of one-dimensional potentials allow for an exact solution of the Schrödinger equation. This means that for many model potentials one has to resort to numerical solution methods. For judging their accuracy, reliability, and speed it is important to have high-precision values of certain nonexactly solvable potentials. The most investigated of such potentials is the quartic anharmonic oscillator [1-19] described by
![]() | (1) |
The eigenfunctions to the eigenvalues decay exponentially for
.
A classical method to solve Sturm-Liouville problems of type 1
is to calculate the eigenvalues of a truncated version of the
corresponding Hill determinant. Using the harmonic oscillator basis we write
where
![]() | (2) |
![]() | (3) |
Forming the matrix elements . For
we obtain
![]() | (4) |
A rough estimation shows that one obtains about 0.2
digits per harmonic oscillator state. So by taking into account the
first 500 eigenstates and carrying out the calculation with about five
thousand digits one obtains about 120 reliable digits for . (This calculation takes about 20 minutes on a 2000 vintage workstation using Mathematica 4 [20].)
The Hill determinant approach allows in addition to the
calculation of the eigenvalues, the calculation of the eigenvectors.
The following graphic visualizes the matrix of eigenvectors of .
The graphic shows that the lowest eigenfunctions are quite similar to
the harmonic oscillator eigenfunctions. Higher states are complicated
mixtures of harmonic oscillator states. The overall “checkerboard”-like
structure results from the fact that the contribution of the
antisymmetric (symmetric) harmonic oscillator states to the symmetric
(antisymmetric) anharmonic oscillator states is identical zero. The
very high states are dominated by truncation effects and do not
correctly mimic the anharmonic oscillator states.
Figure 1: The matrix of eigenvectors of .
To get a very high-precision approximation of
![]() | (5) |
we start with the series expansion
![]() | (6) |
For the ground state we choose (ignoring normalization) . For “suitable chosen”
we then find high-precision approximations for the zeros of
and
. These zeros then bound
from below and above.
Using the differential equation one obtains the following recursion relation for the :
![]() | (7) |
For large (
) we want the function
to vanish as
. For a λ smaller than the smallest possible λ, the function
will not have a zero, but the function
will have a zero for a certain
. For a λ larger than the smallest possible λ, the function
will have a zero, but the function
will not have a zero for a certain
. This allows to find a bounding interval for
. The next two graphics show
and
for 10 equidistant values for λ from the interval
to visualize this bounding process. (For more details, see [21].)
Figure 2: and
for 10 equidistant values for λ from the interval
.
It is straightforward to implement the calculation of the bounding interval for in Mathematica in a three-line program (see [22]). Using FindRoot we calculate high-precision values for the zeros of
and
.
λBounds[n_, ξ_, opts___] :=
Function[f, λ /. FindRoot[f[n, λ, ξ] == 0,
{λ, 106/100, 107/100}, opts]] /@ {y, yPrime};
The calculation of and
is also straightforward based on a recursive calculations of the
.
y[n_, λ_Real, ξ_] := Module[{a6, a4, a2, ak, σ},
{a6, a4, a2} = {1, -λ/2, λ^2/24};
σ = a6 + a4*ξ^2 + a2*ξ^4;
Do[ak = a6 - λ*(a2/(k*(k - 1)));
{a6, a4, a2} = {a4, a2, ak};
σ = σ + ak*ξ^k, {k, 6, n, 2}]; σ]
y[n_, λ_Real, ξ_] := Module[{a6, a4, a2, ak, σ},
{a6, a4, a2} = {1, -λ/2, λ^2/24};
σ = a6 + 2*ξ*a4 + 4*ξ^3*a2;
Do[ak = a6 - λ*(a2/(k*(k - 1)));
{a6, a4, a2} = {a4, a2, ak};
σ = σ + k*ak*ξ^(k - 1), {k, 6, n, 2}]; σ]
Calculating now λBounds[16000, 16, startingValues, WorkingPrecision->6000, AccuracyGoal->600, MaxIterations->100] (where startingValues has been obtained from a call to λBounds recursively, one gets in a few minutes a 1184 digit approximation to the ground state energy of the quartic anharmonic oscillator.
Statistical analysis of the number does not show any regularity.
A power series based approach to the high-precision calculation of the ground state of the anharmonic oscillator was presented. Mathematica
code to carry out the calculation, as well as results were given. The
method can straightforwardly be used to calculate ten thousands of
digits of the quartic anharmonic, as well as other anharmonic
oscillators. Work concerning the application of the method to higher
states is in progress.
All calculations and visualizations have been carried out in Mathematica 4.
The next graphic shows the local density of states for the harmonic oscillator [21].
Figure 3: The local density of states for the harmonic oscillator.
The author would like to thank André Kuzniarek for making a prerelease version of the Publicon typesetting system. This work was supported by Wolfram Research, Inc.[23]
Brillouin zones are among the most popular objects a solid state physicists deals with [24-27].
Despite the fundamental importance for the explanation of most
properties of crystalline solids, Brillouin zones as an own subject
have rarely been investigated (the only ones we are aware of are [28-31]).
For electronic properties, mostly the low order Brillouin zones matter,
as an ownstanding subject the high order Brillouin zones are
interesting. Mathematically, the th Brillouin zone is the set of points that a line to them crosses exactly
bisector planes. In computational geometry a
th order Brillouin zones is also called
th degree Voronoi region or nth
nearest point Voronoi diagrams. The most important fact for high order
Brillouin zones is that their shape approaches that of a thin spherical
shell and their volume is a constant. Here, for the first time we
report on some computational results of higher order Brillouin zones.
All calculations and visualizations were done with Mathematica 4 [20].
Recursive definition of Brillouin zones: Given a lattice in
with lattice points
(
being a multiindex) the first Brillouin zone
is the closure of the set of all points
such that
for all
!=
. The
th order Brillouin zones is the closure of the set of all points
such that
for all
!=
and
.
Figure 4 shows the first twenty Brillouin zones of a 2D hexagonal lattice. It is interesting to observe that the first, third, and fourth Brillouin zones have the shape of an hexagon. For higher orders the shape becomes much more complicated.
Figure 4: The first twenty Brillouin zones of a 2D hexagonal lattice.
Figure 5 shows the 200th Brillouin zone in one symmetry unit (inside an angle of ). One sees many small and a few quite large Landsberg zones. The distribution
of the area of the Landsberg zones in the limit
might be an interesting subject to study.
Figure 5: The 200th Brillouin zone in one symmetry unit (inside an angle of ).
A good numerical fit to number of faces (line segments) of the
th Brillouin zone is
. Figure 6
shows the circumference of the Brillouin zones normalized to the
circumference of a circle with the same radius. Does the ratio approach
a finite value in the limit
?
Figure 6: The circumference of the Brillouin zones normalized to the circumference of a circle with the same radius.
In [32] we gave a complete implementation for the effective calculation of higher order Brillouin zones of the three cubic lattice in . Figure 7 shows the (outside of) 15th Brillouin zone for the simple cubic, Figure 8 shows the 18th for the face-centered cubic and Figure 9
shows the 10th for the body-centered cubic lattice. The higher order
Brillouin zones show quite complicated behavior. Large faces alternate
with small ones, relatively plane regions alternate with quite
structured ones. The appearance of the
th Brillouin zone is typically completely independent of the appearance of the
th Brillouin zone.
Figure 7: The (outside of) 15th Brillouin zone for the simple cubic.
Figure 8: The (outside of) 18th Brillouin zone for the face-centered cubic.
Figure 9: The (outside of) 10th Brillouin zone for the body-centered cubic lattice.
Using this implementation we analysed various properties of higher order Brillouin zones. Figure 10 shows the area of the Brillouin zones normalized to the area of a sphere of the same volume. The order of the three curves from the bottom is sc, fcc, bcc.
Figure 10: The area of the Brillouin zones normalized to the area of a sphere of the same volume.
The last result to be given here is the number of faces of the Brillouin zones. By a face we mean any connected planar part of the outside facing side of a Brillouin zone (point contacts separate faces). Table I gives the results for the first 25 Brillouin zones.
Table I. The results for the first 25 Brillouin zones.
n | sc | fcc | bcc |
1 | 6 | 14 | 12 |
2 | 12 | 72 | 48 |
3 | 72 | 96 | 30 |
Table II. The results for the first 25 Brillouin zones.
n | sc |
1 | 6 |
Table III. The results for the first 25 Brillouin zones.
n | sc | fcc | |
1 | 6 | 14 | |
2 | 12 | 72 |
Table IV. The results for the first 25 Brillouin zones.
n | sc | fcc | bcc | bcc |
1 | 6 | 14 | 12 | 12 |
2 | 12 | 72 | 48 | 48 |
3 | 72 | 96 | 30 | 30 |
Preliminary results about some computational results about higher order Brillouin zones have been presented. Further work is in progress and will be published elsewhere.
All calculations and visualizations have been carried out in Mathematica 4.
The author would like to take the opportunity to thank Amy Young for assistance in typesetting this paper.
[1] | C. J. Tymczak, G. S. Japaridze, C. R. Handy and X. Q. Wang, Phys. Rev. Lett., 80, 3673, (1998). |
[2] | S. Graffi and V. Grecchi, Phys. Rev. D, 8, 3487, (1973). |
[3] | A. V. Sergeev and D. Z. Goodson, J. Phys., A, 4301, (1998). |
[4] | J. Suzuki, J. Phys., A, 183, (1999). |
[5] | L. V. Chebotarev, Ann. Phys., 255, 305, (1997). |
[6] | P. E. Shanley, Ann. Phys., 186, 292, (1988). |
[7] | T. Hatsuda, T. Kunihiro and T. Tanaka, Phys. Rev. Lett., 78, 3229, (1997). |
[8] | E. J. Weniger, Phys. Rev. Lett., 77, 2859, (1996). |
[9] | K. C. Ho, et al., Phys. Rev. A., 53, 1280, (1996). |
[10] | J. Čizek, E. J. Weniger, P. Bracken and V. Špiro, Phys.Rev., 53, 2925, (1996). |
[11] | K. Bay and W. Lay, J. Math. Phys., 38, 2127, (1997). |
[12] | A. Voros, J. Phys., 32, 5993, (1999). |
[13] | P. B. Khan and Y. Zarmi, J. Math. Phys., 40, 4658, (1999). |
[14] | F. Antonsen, Phys. Rev. D., 56, 920, (1997). |
[15] | L. Skála, J. Čizek, V. Kapsa and E. J. Weniger, Phys. Rev. A, 56, 4471, (1997). |
[16] | H. Meißner and E. O. Steinborn, Phys. Rev., 56, 4471, (1997). |
[17] | E. Delabaere and F. Pham, Ann. Phys, 261, 180, (1997). |
[18] | F. Fernández and R. Guardiola, J. Phys. A., 26, 7169, (1993). |
[19] | F. Vinette and J. Čizek, J. Math. Phys., 26, 3392, (1991). |
[20] | S. Wolfram, The Mathematica Book (Cambridge University Press and Wolfram Media, Champaign, 1999). |
[21] | M. Trott, The Mathematica GuideBook: Mathematics in Mathematica (Springer-Verlag, New York, 2000). |
[22] | M. Trott, The Mathematica GuideBook: Programming in Mathematica (Springer-Verlag, New York, 2000). |
[23] | This is an example of a note/reference hybrid. In APS, notes and references are gathered together in the references section. |
[24] | L. Brillouin, Wave Propogation in Periodic Structures (McGraw-Hill, New York, 1946). |
[25] | N. W. Ashcroft and N. D. Mermin, Solid State Physics (Saunders College, Philadelphia, 1976). |
[26] | A. P. Crackwell and K. C. Wong, The Fermi Surface (Clarendon Press, Oxford, 1973). |
[27] | P. T. Landsberg, Solid State Theory (Wiley, London, 1969). |
[28] | L. Bieberbach, Monatsh. Math. Phys., 48, 509, (1939). |
[29] | G. A. Jones, Bull. London Math. Soc., 16, 241, (1984). |
[30] | M. M. Skriganov, Zap. Nautn. Sem.Leningrad. Otdel. Mat. Inst. Steklov., 134, 206, (1984). |
[31] | J. J. Veerman, et al., Comm. Math. Phys., 212, 725, (2000). |
[32] | M. Trott, The Mathematica GuideBook: Graphics in Mathematica (Springer-Verlag, New York, 2000). |