The Numerical Methods For Solving Schrödinger Equation
The Numerical Methods For Solving Schrödinger Equation
By
Hadeel Muaffaq Hejja
Supervisor
Prof. Naji Qatanani
Dedication
I dedicate this thesis to all my family members, to my
Acknowledgement
At the beginning, I am greatful to God for the completion
اإلقرار
حيثما ورد ،وأن هذه الرسالة ككل ،أو أي جزء منها لم يقدم من قبل لنيل أي درجة علمية أو بحث
علمي أو بحثي لدى أي مؤسسة تعليمية أو بحثية أخرى.
Declaration
Table of contents
Dedication ................................................................................................... III
Acknowledgement....................................................................................... IV
Declaration ................................................................................................... V
Table of contents ......................................................................................... VI
List of Figures .......................................................................................... VIII
List of Tables ................................................................................................ X
Abstract ....................................................................................................... XI
Introduction ................................................................................................... 1
Chapter One................................................................................................... 6
Introduction to Schrödinger Equation ........................................................... 7
1.1Schrödinger Equation ……………………………………………… 7
1.2Derivation of the Time-Independent Schrödinger Equation ................ 9
1.3Derivation of the Time-dependent Schrödinger Equation .................. 11
1.4Schrödinger's operators……………………………........................... 12
1.5Linear Operators…………………………………….. ....................... 14
1.6Wave function…………………………………….. ........................... 14
1.7The equation of motion of the wave function…………..................... 15
1.8Properties of the solutions of the time independent Schrödinger
equation………………………………………………………..………….16
1.9Basis of quantum mechanics...................................... ........................ 18
1.10 Stationary states………………………………………………………………………….19
Conclusion..................................................................................... ............. 77
References ................................................................................................... 78
Appendix ..................................................................................................... 83
الملخص........................................................................................................... ب
VIII
List of Figures
Fig 1.1: Eigenfunctions and the energy for a particle in a box. .................. 27
Fig 1.2: A finite square well, depth V0, width 2L. ..................................... 27
Fig 1.3: A semilog graph for the energy of finite square well. ................... 36
Fig 1.4:The first five wave functions of the quantum harmonic oscillator.36
Fig 1.5: Grid lines and mesh points of the grid using Finite difference
method ........................................................................................................41
Fig. 4.1(𝑎): A comparison between the exact and approximate solution in
example 4.1. ................................................................................................ 59
Fig 4.1(b): Absolute error between exact and numerical solution in example
4.1 ................................................................................................................ 59
Fig 4.2 (a): A comparison between The exact and approximate results of
𝐸𝑛. ............................................................................................................... 60
Fig 4.2 (b): Absolute error between The exact and approximate results of
𝐸𝑛. ............................................................................................................... 61
Fig 4.3 (a): A comparison between exact and numerical solution in example
4.1. ............................................................................................................... 63
Fig 4.3 (b): Absolute error between exact and numerical solution in example
4.1. ............................................................................................................... 64
Fig 4.4 (a): A comparison between the exact and approximate solution in
example 4.2. ................................................................................................ 68
Fig 4.4 (b): Absolute error between exact and numerical solution in example
4.2. ............................................................................................................... 69
Fig 4.5 (a):A comparison between The exact and approximate results of 𝐸𝑛.
..................................................................................................................... 70
Fig 4.5 (b): Absolute error between exact and numerical energy in example
4.2. ............................................................................................................... 70
IX
Fig 4.6 (a): A comparison between the exact and approximate solution in
example 4.3. ................................................................................................ 74
Fig 4.6 (b): Absolute error between exact and numerical solution in example
4.3. ............................................................................................................... 75
Fig 3.7 (a):A comparison between The exact and approximate results of 𝐸𝑛.
..................................................................................................................... 76
Fig 4.7 (b): Absolute error between exact and numerical energy in example
4.3. ............................................................................................................... 76
X
List of Tables
Table 𝟒. 𝟏: The exact and the numerical solutions using finite difference
method algorithm where 𝑵=9……………………………………….…….58
Table 𝟒. 𝟐: The exact and the numerical solutions for the energy in example
𝟒. 𝟏 where 𝑵=9. .......................................................................................... 60
Table (4.3): The exact and the numerical solutions using pseudo-spectral
method algorithm where 𝑵=9. .................................................................... 63
Table 𝟒. 𝟒: The exact and the numerical solutions using finite difference
method algorithm where 𝑵=3. ................................................................... 68
Table 𝟒. 𝟓: The exact and the numerical results for the energy in example
𝟒. 𝟐. .............................................................................................................. 69
Table 𝟒. 𝟔: The exact and the numerical solutions using finite difference
method algorithm where 𝑵=5. ................................................................... 74
Table 𝟒. 𝟕: numerical The exact and the results for the energy in example
𝟒. 𝟑. .............................................................................................................. 75
XI
The Numerical Methods for Solving Schrödinger Equation
By
Hadeel Muaffaq Hejja
Supervisor
Prof. Dr. Naji Qatanani
Abstract
integrable systems.
In this thesis we review some basic details of quantum mechanics
such as Schrödinger equation of both types: these include time-
dependent and time-independent Schrödinger equation. Moreover, we
focus mainly on some analytical and numerical methods for solving
Schrödinger equation and its variants. For the analytical solution of the
Introduction
[11,14].
Schrödinger equation is a type of differential equation known as a
wave-equation, which serves as a mathematical model of the moment of
wave nature of matter and particle that correlates to wave [11]. Thus the
equation is analogous to the equation for waves in optics, which assumes
2
that the particle behaves as wave and yields solution in terms of a function
called the wave function. When this equation is solved, it generates two of
the following; namely the wave function 𝜑 and the energy 𝐸, of the particle
under consideration.
In 1926, Irwin Schrödinger inserted de Broglie's wave-like
wave function 𝜑 is the most important thing, which itself does not have
any physical significance, however the absolute square of 𝜑, i.e. |𝜑|2 gives
the probability of finding the particle in a particular region of space at a
particular instant of time [11,14].
A wave equation is an example of an 'equation of motion' which,
as the name suggests, can be used to predict the motion of an object. In
this case the object is a wave. In other words, if we know the amplitude
and velocity of the wave at a given time and place, we can project forward
(or backward) and predict the amplitude and velocity of the wave at some
other time and place. For example, if one dropps a pebble into a pond it
makes a wave of a given height (amplitude) which will decrease with time
as the wave spreads. Knowing the rate at which the wave spreads and loses
amplitude, we can predict what it will look like in ten seconds, twenty
3
seconds and so on. Or conversely, we can look at the circular wave pattern
at a given time and run the whole thing in reverse to re-create the original
described the Fourier grid Hamiltonian method for bound state eigenvalues
and eigenfunctions. Monovasilis [28] studied the exponential-fitting
symplectic methods for the numerical integration of the Schrödinger
equation. Doescher and Rice, in their work [8] studied the infinite square
well potential with a moving wall. Jackiewicz technique [17] is used to
find the solutions by spectral collocation method and wave method form
levels for use in wave-packet studies. Robinson and Fairweather [33] have
obtained an orthogonal spline collocation method for Schrödinger -type
equation in one space variable. Gildener and Patrascioui [13] have shown
that the energy spectrum of a one-dimensional system by using the pseudo
4
Furthermore, Bulirsch, Miele and Stoer [4] have used the direct collocation
as numerical method to find the numerical solution of optimal control
problems.
For the numerical handling of the Schrödinger equation, we employ
the Finite Difference Method (FDM). In order to implement the FDM
method, Schrödinger equation is first transformed into a diffusion equation
Schrödinger equation including the finite square well and infinite square
well are illustrated. Finally, Conclusion are drawn.
6
Chapter One
Introduction to Schrödinger Equation
7
Chapter One
∂ ̂ 𝜑(𝑥, 𝑡)
𝑖ħ ∂t φ(𝑥, 𝑡) = 𝐻 (1.1)
h
where ħ = is the plank constant, φ(𝑥, 𝑡) is the wave function or
2𝑚
∂
state function, 𝑖 is the imaginary unit, 𝑖ħ is the energy operator, and
∂t
ħ 2 d2
̂=−
𝐻 + V(𝑥)
2𝑚 dx2
The Schrödinger equation has two types, in the first one, the time
is obvious in the form with certain description and characterization
that will show the wave function and how it will change with time.
or
∂ ħ2 ∂ 2
𝑖ħ φ(𝑥, 𝑡) = (− + V(𝑥)) φ(𝑥, 𝑡), (1.3)
∂t 2𝑚 ∂𝑥 2
of the particle. There are three important properties of the solution for
time-dependent Schrödinger functional equation as the following:
2. The time dependent Schrödinger equation has linear and singular value
of de Broglie.
9
we have,
𝜕2𝑢 𝜕2
= 𝜑(𝑥) 𝑓(𝑡)
𝜕𝑥 2 𝜕𝑥 2
𝜕2𝑢 𝜕2
= 𝜓(𝑥) 2 𝑓(𝑡)
𝜕𝑡 2 𝜕𝑡
then we obtain,
𝜕2 1 𝜕2
𝑓(𝑡) 2
𝜓(𝑥) = 2
𝜓(𝑥) 𝑓(𝑡), (1.7)
𝜕𝑥 c 𝜕𝑡 2
using the total energy which contains kinetic and potential energy[17]
𝑝2
𝐸= + 𝑉(𝑥), (1.9)
2𝑚
𝜕2 2𝑚[𝐸−𝑉(𝑥)]
𝜓(𝑥) + 𝜓(𝑥) = 0 (1.11)
𝜕𝑥 2 ħ2
−ħ2
Multiplying both side of equation (1.12) by gives:
2𝑚
−ħ2 𝜕2
𝜓(𝑥) − 𝐸𝜓(𝑥) + 𝑉(𝑥)𝜓(𝑥) = 0
2𝑚 𝜕𝑥 2
or
−ħ2 𝜕2
𝜓(𝑥) + 𝑉(𝑥)𝜓(𝑥) = 𝐸𝜓(𝑥). (1.13)
2𝑚 𝜕𝑥 2
𝜕2 𝜕2 𝜕2
where ∇= 2
+ 2
+ .
𝜕𝑥 𝜕𝑦 𝜕𝑧 2
𝜓 = 𝐴 ∙ 𝑒 −𝑖𝜔𝑡 (1.16)
since 𝐸 = ℎ𝑣
𝜕𝜓 2𝜋𝐸 2𝜋𝐸
= −𝑖 ( ) 𝐴 ∙ 𝑒 −𝑖𝜔𝑡 = −𝑖( )𝜓
𝜕𝑡 ℎ ℎ
−ℎ 𝜕𝜓 𝑖ℎ 𝜕𝜓 𝜕𝜓
𝐸𝜓 = ∙ = = 𝑖ħ (1.18)
2𝜋𝑖 𝜕𝑡 2𝜋 𝜕𝑡 𝜕𝑡
12
∂2 2𝑚 𝜕𝜓 2𝑚𝑉
𝜓 + ∙ 𝑖ħ − 2 𝜓=0
∂𝑥 2 ħ2 𝜕𝑡 ħ
2𝑚𝑖 𝜕𝜓 2𝑚𝑉
∙ = 𝜓 − ∇2 𝜓 (1.19)
ħ 𝜕𝑡 ħ2
ħ2
Multiplying equation (1.19) by , we get
2𝑚
𝜕 ħ2 ∂2
𝑖ħ 𝜓(𝑥, 𝑡) = 𝑉𝜓(𝑥, 𝑡) − 𝜓(𝑥, 𝑡) (1.20)
𝜕𝑡 2𝑚 ∂𝑥 2
or
̂ 𝜑 = 𝜑́ ,
𝐷
13
̂ is an operator. Every operator in quantum mechanics can be
where 𝐷
typically structured from the fundamental factors of both position and
momentum.
𝑥̂𝜑 = 𝑥𝜑
𝑑
𝑝̂𝑥 𝜑 = −𝑖ħ 𝜑.
𝑑𝑥
̂ , if
Definition (𝟏. 𝟏)[11,14]: For an operator 𝐷
̂ 𝑓(𝑥; 𝐷) = 𝐷𝑓(𝑥; 𝐷)
𝐷
for a given 𝐷 ∈ ℂ where 𝑐 denotes any complex number, then 𝑓(𝑥)
̂ and 𝐷 is the corresponding
denotes an eigenfunction of the operator 𝐷
eigenvalue.
Operators act on the eigenfunctions in a way identical to multiplying the
eigenfunction by a constant number as seen in definition (1.1).
𝑥̂ = 𝑥
the energy operator is
𝑝̂ 2 𝜕
𝐸̂ = + 𝑉(𝑥̂) = 𝑖 ħ
2𝑚 𝜕𝑥
and so on.
while,
14
𝑑𝑓(𝑥) 𝑑𝑓(𝑥)
𝑥̂𝑝̂ 𝑓(𝑥) = 𝑥̂ (−𝑖ħ ) = −𝑖ħ𝑥 . (1.22)
𝑑𝑥 𝑑𝑥
and
where 𝑓(𝑥) and 𝑔(𝑥) are any two appropriate functions and c is a
complex constant.
̂ are all linear operators.
Examples: the operators 𝑥̂, 𝑝̂ , 𝑎𝑛𝑑 𝐻
𝜑2.
𝑝(𝑥) = |𝜑(𝑥)|2 determines the probability that an object in the state
𝜑(𝑥) will be found at position 𝑥. The total probability is the probability of
∞
∫−∞|φ(𝑥)|2 𝑑𝑥 = 1 (1.26)
ħ2 d2
̂ = 𝑇̂ + 𝑉̂ = −
𝐻 + 𝑉(𝑥). (1.27)
2𝑚 d𝑥 2
where
2 𝜕2 𝜕2 𝜕2
∇1 = + +
𝜕𝑥1 2 𝜕𝑦1 2 𝜕𝑧1 2
and
2 𝜕2 𝜕2 𝜕2
∇2 = + +
𝜕𝑥2 2 𝜕𝑦2 2 𝜕𝑧2 2
The Hamiltonian operator typically plays an essential role in
the time-dependent development of the wave function. time- dependent
wave function will have its equation of motion given by the time-
dependent Schrödinger equation (TDSE):
𝜕𝜑
𝑖ħ =𝐻 ̂ 𝜑.
𝜕𝑡
This obtain a basic equation that describes the movement of a quantum
mechanical system.
and
∆𝐴 ≡ √〈𝐴2 〉 − 〈𝐴〉2
19
equation as
φ(𝑥,t)= φ(𝑥)g(t)
then the concept of a stationary state arises naturally. It then turns
Both sides of equation (1.39) must be equal to a constant, since the left-
hand side is only dependent on 𝑡 and the right-hand side only on 𝑥, which
we can denote 𝐸. Thus we have two separated sides as:
1 𝜕𝑔(𝑡) 𝑑𝑔 𝑖
𝑖ħ =𝐸 ⇒ = − 𝐸𝑑𝑡
𝑔(𝑡) 𝜕𝑡 𝑔 ħ
𝑖
ln( 𝑔) = − 𝐸𝑡 + 𝑐𝑜𝑛𝑠𝑡. ⇒ 𝑔(𝑡) = 𝑐𝑜𝑛𝑠𝑡. 𝑒 −𝑖𝐸𝑡⁄ħ (1.40)
ħ
So, we have
𝑑
〈𝐴(𝑥, 𝑝𝑥 )〉 = ∫ 𝜑 ∗ (𝑥)𝑒 𝑖𝐸𝑡⁄ħ 𝐴(𝑥, −𝑖ħ )𝜑(𝑥)𝑒 −𝑖𝐸𝑡⁄ħ 𝑑𝑥
𝑑𝑥
𝑑
= ∫ 𝜑 ∗ (𝑥) 𝐴(𝑥, −𝑖ħ )𝜑(𝑥)𝑑𝑥 = constant. (1.42)
𝑑𝑥
21
̂ φ(𝑥) = Eφ(𝑥)
H
ħ2
̂= −
where 𝐻 ∇ + 𝑉(𝑥) is the Hamiltonian.
2𝑚
Definition (𝟏. 𝟐)[ 𝟏𝟏, 𝟏𝟒, 𝟑𝟕]: A state is called stable if it is performed
by the wave function:
𝜑(𝑥, t) = 𝜑(𝑥) 𝑒 −𝑖𝐸𝑡⁄ħ
Corollary (𝟏. 𝟓)[ 𝟏𝟏, 𝟏𝟒]: As a direct result, the eigenvalues of the
Hamiltonian, which represent the potential energy levels of
the system, are clearly time-independent.
̂ (𝑥, 𝑝𝑥 ) instead of 𝐴(𝑥, 𝑝𝑥 ) in equation (1.42)
To see this, just take 𝐻
Chapter Two
Analytical Methods
23
Chapter Two
Analytical Methods
2.1 Introduction
the infinite potential well, the finite potential well and the quantum
harmonic oscillator.
Regarding the infinite square well, the particle exists only in the
finite interval [0, L]. Such that [8],
0, 𝑥 ∈ [0, 𝐿]
𝑉(𝑥) = { (2.1)
∞, 𝑒𝑙𝑠𝑒
equation.
and,
𝜓(0) = 0 and 𝜓(𝐿) = 0 (2.3)
24
we recall that the Hamiltonian is simply the sum of the kinetic and
potential energies, so equation (2.4) becomes
̂ 𝜓 = 𝐸𝜓
H
̂ + 𝑉̂ ]𝜓 = 𝐸𝜓
[𝐾 (2.5)
√2𝑚𝐸 2𝑚𝐸
𝐾= , 𝐾2 = (2.6)
ħ ħ2
𝜕2
2
𝜓(𝑥) = −𝐾 2 𝜓(𝑥)
𝜕𝑥
𝜕2
𝜓(𝑥 ) + 𝐾 2 𝜓(𝑥 ) = 0 (2.7)
𝜕𝑥 2
𝑎 and 𝑏 are two constants that are being specified by the boundary
conditions
𝜓(0) = 0 and 𝜓(𝐿) = 0 , (2.9)
and the particle would disappear. The condition that sin 𝐾𝐿 = 0 implies
that
𝑛𝜋
𝐾𝐿 = 𝑛𝜋 ⇒ 𝐾= , (2.12)
𝐿
𝑛 2 𝜋 2 ħ2
𝐸𝑛 = , (2.13)
2𝑚𝐿2
4. As 𝐿 → ∞, 𝐸𝑚𝑖𝑛 = 0 .
26
5. As 𝑚 → ∞, 𝐸𝑚𝑖𝑛 = 0 .
𝑛𝜋 2𝜋 𝑛𝜆
6. We know that 𝐾 = = , so 𝐿 = .
𝐿 𝜆 2
𝑛𝜋
The eigenfunctions in equation (2.8) with 𝑏 = 0 and 𝐾 = , is
𝐿
given by:
𝑛𝜋𝑥
𝜓𝑛 (𝑥) = 𝑎 sin , 𝑛 = 1,2,3, … (2.14)
𝐿
Finally, we get the value of the constant (𝑎) from the normalization of the
wave function.
𝐿
∫0 |𝜓𝑛 |2 𝑑𝑥 = 1 (2.15)
𝑛𝜋𝑥
We have made the substitution 𝜃 = and used the fact that the average
𝐿
1
value of sin2 𝜃 over an integral of half wavelengths equals . From
2
2
equation (2.16) we can identify the normalization constant 𝑎 = ( )1/2 for
𝐿
2 𝑛𝜋
𝜓𝑛 (𝑥) = √ cos( 𝑥) , 𝑛 = 1,3,5, … (2.17)
𝐿 𝐿
2 𝑛𝜋
𝜓𝑛 (𝑥) = √ sin ( 𝑥), 𝑛 = 2,4,6 … (2.18)
𝐿 𝐿
𝜓4 (𝑥) 𝐸4 = 16𝐸1
𝑛=4
𝜓3 (𝑥) 𝐸3 = 9𝐸1
𝑛=3
𝐸2 = 4𝐸1
𝜓2 (𝑥) n=2
𝐸1
𝜓1 (𝑥) n=1
0 𝑥 L
In this section we want to solve the finite square well. Consider the
potential shown in
𝑉(𝑥)
V = V0
E < V0 E > V0 E < V0
V=0
−L L
0 𝑥
Region 2:
−𝐿 < 𝑥 < 𝐿, 𝑉(𝑥) = 0.
substituting into these equation:
−ħ2 𝜕2 𝜕2 2𝑚
( 2𝑚 ) 𝜕𝑥 2 𝜓(𝑥) = 𝐸 𝜓(𝑥) 𝜓(𝑥) = − 𝐸 𝜓(𝑥)
𝜕𝑥 2 ħ2
meaning
𝜕2 2𝑚𝐸
𝜓(𝑥) = −𝐾 2 𝜓(𝑥) with 𝐾 2 = .
𝜕𝑥 2 ħ2
−ħ2 𝜕 2
( ) 𝜓 + 𝑉0 𝜓(𝑥) = 𝐸 𝜓(𝑥)
2𝑚 𝜕𝑥 2
29
𝜕2 2𝑚
𝜓= (𝑉0 − 𝐸)𝜓 (2.19)
𝜕𝑥 2 ħ2
yielding
∂2 2𝑚
𝜓 = 𝛼 2 𝜓, with 𝛼 2 = (𝑉0 − 𝐸) > 0
∂x2 ħ2
So,
2𝑚
𝛼=√ (𝑉0 − 𝐸), which is real.
ħ2
𝜓(𝑥) = 𝐶𝑒 −𝛼𝑥 + 𝐷𝑒 𝛼𝑥 ,
but since 𝜓 → 0 as 𝑥 → ∞, 𝐷 = 0
−𝐿 0 𝐿
30
This leaves us with three unknowns: (𝐸, 𝐶, 𝐷)and right now we
have three boundary conditions to consider: the continuity of the
wave function and the continuity of its derivative. The last boundary
condition is that the wave function must have a sensible behavior at
infinity [1,23]. That is, 𝜑(𝑥) is finite at infinity, we require 𝜑(𝑥) to be
finite as 𝑥 → ±∞.
∂ cos(K𝑥)
= −K sin(K𝑥)𝑥=L = −K sin(KL)
∂𝑥 𝑥=L
∂Ce−α𝑥
= −αCe−α𝑥 𝑥=L = −αCe−αL ,
∂𝑥 𝑥=L
∂φ(L) ∂φ(L)
hence the condition = gives :
∂𝑥 left ∂𝑥 right
equation:
2𝑚𝐸
√𝐸 tan(𝐿√ ħ2
) = √𝑉 − 𝐸 (2.22)
Figure 1.3: A semilog graph for the energy of finite square well.
the well at a power of 𝐸 = 45.4 𝑒𝑉. There is an odd bound state corres-
ponding respectively to 𝑛 = 2 at roughly 20 𝑒𝑉.
4 ħ2 ħ
thus 𝑎 = → 𝑎2 = , where 𝑎 is the length.
𝑚2 𝜔2 𝑚 𝜔
2
Multiplying equation (2.24) by , we get:
ħ𝜔
ħ 𝑑2 𝜑 𝑚𝜔 2𝐸
− + 𝑥2𝜑 = 𝜑, (2.26)
𝑚𝜔 𝑑𝑥 2 ħ ħ𝜔
2𝐸
let 𝜀 = be the dimensionless value of the energy, so equation (2.26)
ħ𝜔
let, 𝑥 = 𝑎𝑢 , (2.28)
𝑑 1 𝑑 𝑑2 1 𝑑2
= → =
𝑑𝑥 𝑎 𝑑𝑢 𝑑𝑥 2 𝑎2 𝑑𝑢2
𝛼𝑢2⁄
let 𝜑 = 𝑢𝜇 𝑒 2, where 𝛼 is any number.
𝛼𝑢2⁄ 𝛼𝑢2⁄
𝜑́ = 𝛼𝑢𝑢𝜇 𝑒 2 + 𝜇𝑢𝜇−1 𝑒 2,
34
𝛼𝑢 2
𝜑́́ = (𝛼𝑢)2 𝑢𝜇 𝑒 ⁄2
+…………..
𝛼𝑢 2
2𝜇+1 1 𝜇(𝜇−1) 1
𝜑́́ = 𝛼 2 𝑢2 𝑢𝜇 𝑒 ⁄2
[1 + + ]
𝛼 𝑢2 𝛼2 𝑢4
2𝜇+1 1 𝜇(𝜇−1) 1
= 𝛼 2 𝑢2 𝜑 [1 + + ].
𝛼 𝑢2 𝛼2 𝑢4
−𝑢2⁄ 𝑢2⁄
𝜑(𝑢) = 𝐴𝑢𝜇 𝑒 2 + 𝐵𝑢𝜇 𝑒 2, (2.30)
𝑢2⁄
Let, 𝜑(𝑢) = ℎ(𝑢)𝑒 − 2 , (2.31)
ℎ(𝑢) = ∑∞ 𝑗
𝑗=0 𝑎𝑗 𝑢 , (2.33)
𝑑ℎ
= ∑∞
𝑗=0 𝑗 𝑎𝑗 𝑢
𝑗−1
, (2.34)
𝑑𝑢
𝑑2ℎ
= ∑∞
𝑗=0 𝑗(𝑗 − 1)𝑎𝑗 𝑢
𝑗−2
= ∑∞
𝑗=2 𝑗(𝑗 − 1)𝑎𝑗 𝑢
𝑗−2
, (2.35)
𝑑𝑢2
∑∞ 𝑗
𝑗=0((𝑗 + 2)(𝑗 + 1) 𝑎𝑗+2 − (2𝑗 + 1 − 𝜀)𝑎𝑗 )𝑢 = 0, (2.37)
2𝑗 + 1 − 𝜀 = 0, (2.39)
2𝑛 + 1 − 𝜀𝑛 = 0, (2.40)
Figure 1.4: The first five wavefunctions of the quantum harmonic oscillator.
Chapter Three
Numerical Techniques for Solving
Schrödinger Equation
38
Chapter Three
pseudo-spectral methods.
Let 𝜑(𝑥) has 𝑛 ∈ 𝑁 continuous derivatives over the interval (𝑎, 𝑏). Then,
for 𝑎 < 𝑥0 , 𝑥0 + ℎ < 𝑏, we can write the value of 𝜑(𝑥) and its derivatives
nearby the point 𝑥0 + ℎ as follows:
𝜑́ (𝑥0 ) 𝜑́́ (𝑥0 )
𝜑(𝑥0 + ∆𝑥) = 𝜑(𝑥0 ) + (𝑥 − 𝑥0 ) + (𝑥 − 𝑥0 )2
1! 2!
́
𝜑́ (𝑥0 )
+ (𝑥 − 𝑥0 )3 +..
3!
39
ℎ2
𝜑(𝑥0 + ℎ) = 𝜑(𝑥0 ) + ℎ𝜑́ (𝑥0 ) + 𝜑́́ (𝑥0 )+
2!
ℎ3 ℎ𝑛−1
𝜑́́ (𝑥0 )+. . + (𝑛−1)! 𝜑 (𝑛−1) (𝑥0 ) + 𝑂(ℎ𝑛 ) (3.1)
3!
∞
𝜑 (𝑛) (𝑥0 )
∑ (𝑥 − 𝑥0 )𝑛 + 𝑂(ℎ𝑛 )
𝑛!
𝑛=0
where
specific point 𝑥0 .
2. 𝜑 (𝑛−1) (𝑥0 ) is the 𝑛 − 1𝑡ℎ derivative of 𝜑 with respect to 𝑥 at the
point 𝑥0 .
3. 𝑂(ℎ𝑛 ) denotes an unknown error term that satisfies the property: for
𝜑(ℎ) = 𝑂(ℎ𝑛 )
𝜑(ℎ)
lim = 𝑐, for any nonzero constant c.
ℎ→0 ℎ𝑛
When we eliminate the error term, 𝑂(ℎ𝑛 ), from the right-hand side
of functional equation (3.1), we get an approximation to 𝜑(𝑥0 + ℎ).
the forward–difference formula for approximating 𝜑́ (𝑥0 )
𝜑(𝑥0 +∆𝑥)−𝜑(𝑥0 )
𝜑́ (𝑥0 ) ≅ + 𝑂(∆𝑥),
∆𝑥
−ħ2 𝜕2 𝜕
𝜓(𝑥𝑖 , 𝑡𝑗 ) + 𝑉(𝑥𝑖 , 𝑡𝑗 )𝜓(𝑥𝑖 , 𝑡𝑗 ) = 𝑖ħ 𝜑(𝑥𝑖 , 𝑡𝑗 ), for(𝑥, 𝑡) ∈ 𝑅 (3.2)
2𝑚 𝜕𝑥 2 𝜕𝑡
The rectangular domain 𝑅 = {(𝑥, 𝑡)|𝑎 < 𝑥 < 𝑏, 𝑐 < 𝑡 < 𝑑} and 𝜑(𝑥, 𝑡) =
𝑔(𝑥, 𝑡) for any (𝑥, 𝑡) ∈ 𝑆, where: 𝑆 denotes the boundary of a region 𝑅,
𝑔(𝑥, 𝑡) is continuous on 𝑆.
Now, we will use the finite difference algorithm for solving the time-
independent Schrödinger equation [5,35]:
41
𝑏−𝑎 𝑑−𝑐
Step 2: Define ∆𝑥 = ℎ = and ∆𝑡 = 𝑘 = .
𝑁 𝑀
This step partitions the interval [a, b] into 𝑁 equal parts of width ℎ and
partitions the interval [c, d] into 𝑀 equal parts of width 𝑘 as step 3
illustrates.
Step 3: Define the mesh point (𝑥𝑖 , 𝑡𝑗 ) as
𝑥𝑖 = 𝑎 + 𝑖ℎ, 𝑖 = 0,1,2, … . . , 𝑁
𝑡𝑗 = 𝑗𝑘, 𝑗 = 0,1,2, … . . , 𝑀
𝑡
𝑡𝑀 = 𝑑
𝑡2
𝑡1
𝑡0 = 𝑐
𝑥
𝑥0 = 𝑎 𝑥1 𝑥2 … 𝑥𝑁 = 𝑏
Figure 1.5: Grid lines and mesh points of the grid using Finite difference method.
It is clear from figure 1.5 that we obtain horizontal and vertical lines inside
the rectangle 𝑅. These lines are called "grid lines" and
42
their intersections are named "mesh points" of the grid. For each mesh
point inside the grid, (𝑥𝑖 , 𝑡𝑗 ), 𝑖 = 1,2, … , 𝑁 − 1 and
Substituting equation (3.3) and equation (3.4) into equation (3.2), we get:
𝜑(𝑥𝑖 ,𝑡𝑗+1)−𝜑(𝑥𝑖 ,𝑡𝑗 ) 𝑘 𝜕2
𝑖ħ − ∙ 𝜑(𝑥𝑖 , 𝜉𝑗 ) =
𝑘 2 𝜕𝑡 2
Clarifying the last equation and typically let 𝜑𝑖,𝑗 approximate 𝜑(𝑥𝑖 , 𝑡𝑗 ),
we form[2,5]:
𝑖ħℎ2 ħ2 𝑖ħℎ2 ħ2
[ + + ℎ2 𝑉(𝑥𝑖 )]𝜑𝑖,𝑗 − 𝜑𝑖,𝑗+1 − ∙ [𝜑𝑖+1,𝑗 + 𝜑𝑖−1,𝑗 ] = 0(3.6)
𝑘 𝑚 𝑘 2𝑚
2 2
̂ = (−ħ ) 𝜕 2 + 𝑉(𝑥)
𝐻
2𝑚 𝜕𝑥
̂𝑗 𝜓(𝑥𝑗 ) = 𝐸𝜓(𝑥𝑗 )
𝐻
̂𝑗 is the Hamiltonian operator evaluated at 𝑉(𝑥𝑗 ). Taking into
Where 𝐻
equations:
̂0 𝜓(𝑥0 ) = 𝐸𝜓(𝑥0 )
𝐻
̂𝑗 𝜓(𝑥𝑗 ) = 𝐸𝜓(𝑥𝑗 )
𝐻 (3.9)
….
̂𝑛 𝜓(𝑥𝑛 ) = 𝐸𝜓(𝑥𝑛 )
𝐻
….
]We will limit our analysis the evaluation of 𝜑 (𝑥) in the case of the
infinite square well, and for scattering states within a finite interval[5,16].
and n is an integer.
In the second order, the centered finite difference approximation:
1
𝜑́́ (𝑥𝑗 ) ≈ ( 2 ) (𝜑(𝑥𝑗−1 ) − 2𝜑(𝑥𝑗 ) + 𝜑(𝑥𝑗+1 ))
ℎ
́́ (𝑥) system (3.10) becomes
Substituting the approximation for 𝜑
1 2 1
(− (ℎ2) 𝜑(𝑥−1 ) + ℎ2 𝜑(𝑥0 ) − ℎ2 𝜑(𝑥1 )) + 𝑉(𝑥0 ). 𝜑(𝑥0 ) = 𝐸𝜑(𝑥0 ),
Simplifying,
1 2 1
− ( 2 ) 𝜑(𝑥−1 ) + [𝑉 (𝑥0 ) + 2 ] 𝜑(𝑥0 ) − ( 2 ) 𝜑(𝑥1 ) = 𝐸𝜑(𝑥0 )
ℎ ℎ ℎ
1 2 1
−( ) 𝜑(𝑥0 ) + [𝑉 (𝑥1 ) + ] 𝜑(𝑥1 ) − ( ) 𝜑(𝑥2 ) = 𝐸𝜑(𝑥1 )
ℎ2 ℎ2 ℎ2
……..
1 2 1
− ( 2 ) 𝜑(𝑥𝑛−2 ) + [𝑉 (𝑥𝑛−1 ) + 2 ] 𝜑(𝑥𝑛−1 ) − ( 2 ) 𝜑(𝑥𝑛 ) = 𝐸𝜑(𝑥𝑛−1 )
ℎ ℎ ℎ
1 2 1
−( ) 𝜑(𝑥𝑛−1 ) + [𝑉 (𝑥𝑛 ) + ] 𝜑(𝑥𝑛 ) − ( ) 𝜑(𝑥𝑛+1 ) = 𝐸𝜑(𝑥𝑛 )
ℎ2 ℎ2 ℎ2
now we define the vector
46
𝜑(𝑥0 )
𝜑(𝑥1 )
𝜑= …
𝜑(𝑥𝑛−1 )
[ 𝜑(𝑥𝑛 ) ]
Employing a suitable finite differencing scheme, as well as using a
boundary conditions, the system of linear equations may be expressed
only in terms of the sample points 𝑢(𝑥𝑗 ) such that j = 0, 1, …, n
𝐻𝜑
⃗⃗ = 𝐸𝜑
⃗⃗
where 𝐻 is a matrix containing the coefficients of each 𝜑(𝑥𝑗 ) in the system
of linear equations. 𝐸 is the energy of eigenvector 𝜑
⃗⃗(𝑥𝑗 ) at each sample
points 𝑥𝑗 , and is an eigenvalue of 𝐻.
−ħ2 𝜕 2 𝜑
𝐸𝜑 = ( ) + 𝑉(𝑥)𝜑
2𝑚 𝜕𝑥 2
𝜑1 𝜑1
𝜑2 𝜑2
𝐸 . =[ 𝐻 ] .
. 𝑁×𝑁 .
[𝜑𝑛 ] [𝜑𝑛 ]
The eigenvalues of the 𝑁 by 𝑁 matrix (𝐻) can be evaluated. There will
be 𝑁 eigenvalues and 𝑁 eigenvectors. For a large value of 𝑁, Matlab can
be used to find eigenvalues and eigenvectors.
1 2 1
−( ) 𝜑(𝑥𝑗−1 ) + [𝑉(𝑥𝑗 ) + ] 𝜑(𝑥𝑗 ) − ( ) 𝜑(𝑥𝑗+1 ) = 𝐸𝜑(𝑥𝑗 ),
ℎ2 ℎ2 ℎ2
where 𝜑(𝑥𝑘 ) = 0, ∀ 𝑥𝑘 ∉ [0, L].
Thus, the matrix 𝐻 will take a form
2 1
+ 𝑉1 −
∆𝑥 2 ∆𝑥 2
1 2 1
− 2 + 𝑉2 −
∆𝑥 ∆𝑥 2 ∆𝑥 2
⋱ ⋱ ⋱
⋱ ⋱ ⋱
1 2 1
− 2 + 𝑉𝑛−1 − 2
∆𝑥 ∆𝑥 2 ∆𝑥
1 2
− + 𝑉𝑛
∆𝑥 2 ∆𝑥 2
( )
The bound states of the finite square well which shows in figure
(1.2):
48
Region 2:
−𝐿 < 𝑥 < 𝐿, 𝑉(𝑥) = 0.
Use second-order centered difference formula for 𝜑́́ (𝑥𝑖 ), 𝑖 = 1,2, … ,9 and
drop the error term,
𝜑𝑖+1 − 2𝜑𝑖 + 𝜑𝑖−1
2
= 𝛼 2 𝜑𝑖 .
ℎ
When we use second-order centered difference formula for 𝜑́́ (𝑥𝑖 ), and
drop the error term, we get
𝜑𝑖+1 −2𝜑𝑖 +𝜑𝑖−1
= −𝐸𝜑𝑖 .
ℎ2
𝜑: [−1,1] → 𝑅
51
𝜑𝑛 (𝑥) = ∑𝑁
𝑛=0 𝑐𝑛 𝑇𝑛 (𝑥), (3.15)
Let:
𝜃 = cos −1 𝑥 ⇒ 𝑥 = cos 𝜃
Then:
𝜑(𝑥) = ∑𝑁
𝑛=0 𝑐𝑛 cos(𝑛𝜃) (3.19)
𝜑(1) = ∑ 𝑐𝑛 𝑇𝑛 (1)
𝑛=0
𝑁 𝑁 𝑁
So
𝑐0
1
0 −1 0 1 0 −1 0 1 0 𝑐1
0
2
[
1 ] 𝑐 2. = [ ] (3.23)
1 1 1 1 1 1 1 1 1 ; 0
2 ;
[ 𝐶𝑁 ]
Step 8: Find the matrix of the coefficient of the vector 𝑐𝑛, by using this
formula
(2𝑛 − 1)𝜋
𝜃𝑛 = , 𝑛 = 1, … … , 8
𝑁−1
Step 9: Using inverse Fourier transform to find the wave function 𝜑(𝑥).
54
Chapter Four
Numerical Examples and Results
55
Chapter Four
𝜑(𝑥) = √2 sin(𝜋𝑥)
the following algorithm is applied to obtain the solution of the equation
(4.1) using the finite difference method.
0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0
for 𝑖 = 2,
1 2 1
− ( 2) 𝜑(𝑥1 ) + 2 𝜑(𝑥2 ) − ( 2) 𝜑(𝑥3 ) = 𝐸𝜑(𝑥2 )
ℎ ℎ ℎ
57
for 𝑖 = 3,
1 2 1
− ( 2) 𝜑(𝑥2 ) + 2 𝜑(𝑥3 ) − ( 2) 𝜑(𝑥4 ) = 𝐸𝜑(𝑥3 )
ℎ ℎ ℎ
for 𝑖 = 4,
1 2 1
− ( 2) 𝜑(𝑥3 ) + 2 𝜑(𝑥4 ) − ( 2) 𝜑(𝑥5 ) = 𝐸𝜑(𝑥4 )
ℎ ℎ ℎ
for 𝑖 = 5,
1 2 1
− ( 2) 𝜑(𝑥4 ) + 2 𝜑(𝑥5 ) − ( 2) 𝜑(𝑥6 ) = 𝐸𝜑(𝑥5 )
ℎ ℎ ℎ
for 𝑖 = 6,
1 2 1
− ( 2) 𝜑(𝑥5 ) + 2 𝜑(𝑥6 ) − ( 2) 𝜑(𝑥7 ) = 𝐸𝜑(𝑥6 )
ℎ ℎ ℎ
for 𝑖 = 7,
1 2 1
− ( 2) 𝜑(𝑥6 ) + 2 𝜑(𝑥7 ) − ( 2) 𝜑(𝑥8 ) = 𝐸𝜑(𝑥7 )
ℎ ℎ ℎ
for 𝑖 = 8,
1 2 1
− ( 2) 𝜑(𝑥7 ) + 2 𝜑(𝑥8 ) − ( 2) 𝜑(𝑥9 ) = 𝐸𝜑(𝑥8 )
ℎ ℎ ℎ
for 𝑖 = 9,
1 2 1
− ( 2) 𝜑(𝑥8 ) + 2 𝜑(𝑥9 ) − ( 2) 𝜑(𝑥10 ) = 𝐸𝜑(𝑥9 )
ℎ ℎ ℎ
example (4.1).
Table (𝟒. 𝟏): The exact and the numerical solutions using finite
difference method algorithm where 𝑵=9.
𝑥𝑖 𝜑𝑒 = 𝜑𝑒𝑥𝑎𝑐𝑡 𝜑𝑖= 𝜑𝑛𝑢𝑚𝑒𝑟𝑖𝑐𝑎𝑙 Absolute error
|𝜑𝑒− 𝜑𝑖 |
0 0 0 0
0.1 0.43701602 0.46701602 0.03000000
0.2 0.83125388 0.90015676 0.06890288
0.3 1.14412281 1.18543371 0.04131090
0.4 1.34499702 1.25307610 0.09192092
0.5 1.36500261 1.28863421 0.07636840
0.6 1.34499702 1.55307610 0.20807908
0.7 1.14412281 1.18543371 0.04131090
0.8 0.831253878 0.90015676 0.06890288
0.9 0.43701602 0.46701602 0.03000000
1.0 0 0 0
59
0.8
𝜑(𝑥)
0.6
0.4
0.2
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
𝑥(𝑁 = 9)
Fig. 4.1 (𝒂): A comparison between the exact and approximate solution in example
4.1.
Error
𝑥(𝑁 = 9)
Fig. 4.1 (b): Absolute error between exact and numerical solution in example 4.1
60
Table (4.2) contains both the exact and the numerical results for the
values of energy for example (4.1).
Table (𝟒. 𝟐): The exact and the numerical solutions for the energy in
example (𝟒. 𝟏) where 𝑵=9.
𝑁 𝐸𝑒𝑥𝑎𝑐𝑡 𝐸𝑛𝑢𝑚𝑒𝑟𝑖𝑐𝑎𝑙 Absolute error
|𝐸𝑒𝑥𝑎𝑐𝑡 -𝐸𝑛𝑢𝑚 |
1 9.86960440 9.27431124 0.59529316
2 39.47841760 39.05884233 0.41957527
3 88.82643961 88.11904310 0.70739651
4 157.91367042 157.8754602 0.03821022
5 246.74011003 246.64312400 0.09698603
6 355.30575844 355.07313011 0.23262833
7 483.61061565 483.89924520 0.28862955
8 631.65468167 631.00001527 0.65466640
9 799.43795649 799.08054461 0.35741188
𝐸𝑛
𝑥
Fig 4.2 (a): A comparison between The exact and approximate results of 𝐄𝐧 .
61
Error
𝑥
Fig 4.2 (b): Absolute error between The exact and approximate results of 𝐄𝐧 .
Pseudo-Spectral Method
𝑥0 𝑥1 𝑥2 𝑥3 𝑥4 𝑥5 𝑥7 𝑥10
𝑥6 𝑥8 𝑥9
0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0
𝜑(0) = ∑ 𝑐𝑛 ∅𝑛 (0) = ∑ 𝑐𝑛 0𝑛 = 0
𝑛=0 𝑛=0
φ(1) = ∑ 𝑐𝑛 ∅𝑛 (1) = ∑ 𝑐𝑛 1𝑛 = 0
𝑛=0 𝑛=0
9. Find the matrix of the coefficient of the vector 𝑐𝑛, by using this
formula
(2𝑛 − 1)𝜋
𝜃𝑛 = , 𝑛 = 1, … … , 8
𝑁−1
10. Using inverse Fourier transform to find the wave function 𝜑(𝑥).
Applying algorithm (4.2) for example (4.1). Table (4.3) contains both the
exact and the numerical results using the pseudo-spectral method for
example (4.1).
63
Table (4.3): The exact and the numerical solutions using pseudo-
spectral method algorithm where 𝑵=9.
The exact and approximate results of 𝜑(𝑥) are shown in Fig. 4.3
(𝑎) and the resulted error is shown in Fig. 4.3 (𝑏).
Exact
Approx
𝜑(𝑥)
𝑥
Fig 4.3 (a): A comparison between exact and numerical solution in example 4.1.
64
Error
Fig 4.3 (b): Absolute error between exact and numerical solution in example 4.1.
Use second-order centered difference formula for 𝜑́́ (𝑥𝑖 ), 𝑖 = 1,2, … ,9 and
𝜕2
𝜓 = 𝛼2𝜓
𝜕𝑥 2
2𝑚
where 𝛼 2 = (𝑉0 − 𝐸),
ħ2
Use second-order centered difference formula for 𝜑́́ (𝑥𝑖 ), 𝑖 = 1,2, … ,9 and
drop the error term,
𝜑𝑖+1 − 2𝜑𝑖 + 𝜑𝑖−1
= 𝛼 2 𝜑𝑖 .
ℎ2
Example (𝟒. 𝟐):
Consider that for the finite square well 1 nm, the particle with mass
=0.5 g is found in the interval [0,1], such that 𝑉(𝑥) = 𝑉0 = 50 𝑒𝑉,
consider the free time independent Schrödinger equation:
−ħ2 𝜕2
( 2𝑚 ) 𝜕𝑥 2 𝜓(𝑥) + 𝑉(𝑥)𝜓(𝑥) = 𝐸 𝜓(𝑥) (4.4)
𝜑(𝑥) = 𝑐 𝑒 −𝛼𝑥
the following algorithm is applied to obtain the solution of the
for 𝑖 = 2,
1 2 1
−( ) 𝜑(𝑥1 ) + 𝜑(𝑥2 ) − ( ) 𝜑(𝑥3 ) = 𝐸𝜑(𝑥2 )
ℎ2 ℎ2 ℎ2
9- Use second-order centered difference formula for 𝜑́́ (𝑥𝑖 ), 𝑖 =
3,4 and drop the error term, we get
𝜑𝑖+1 − 2𝜑𝑖 + 𝜑𝑖−1
= 𝛼 2 𝜑𝑖 .
ℎ2
Each linear combination will have a form
1
( 2 ) (𝜑(𝑥𝑖+1 ) − 2𝜑(𝑥𝑖 ) + 𝜑(𝑥𝑖−1 )) = 𝛼 2 𝜑(𝑥𝑖 )
ℎ
for 𝑖 = 3,
1 2 1
( ) 𝜑(𝑥2 ) − 𝜑(𝑥3 ) + ( ) 𝜑(𝑥4 ) = 𝛼 2 𝜑(𝑥3 )
ℎ2 ℎ2 ℎ2
for 𝑖 = 4,
1 2 1
( ) 𝜑(𝑥3 ) − 𝜑(𝑥4 ) + ( ) 𝜑(𝑥5 ) = 𝛼 2 𝜑(𝑥4 )
ℎ2 ℎ2 ℎ2
Thus, for 𝑖 = 1,2 the matrix H will take form
2 1
2
−
( ℎ ℎ2 )
1 2
− 2
ℎ ℎ2
and for 𝑖 = 3,4 the matrix H will take form
2 1
− 2
( ℎ ℎ2 )
1 2
−
ℎ2 ℎ2
Applying algorithm (4.3) for example (4.2). Table (4.4) contains
both the exact and the numerical results using the finite difference method
for example (4.2).
68
Table (𝟒. 𝟒): The exact and the numerical solutions using finite
difference method algorithm where 𝑵=3.
4.4 (𝑎) and the resulted error is shown in Fig. 4.4 (𝑏).
Exact
Approx
𝜑(𝑥)
𝑥 (N=3)
Fig 4.4 (a): A comparison between the exact and approximate solution in example
4.2.
69
Error
Fig. 4.4 (b): Absolute error between exact and numerical solution in example 4.2.
Table (4.5) contains the exact and the numerical results for
the energy in example (4.2).
Table (𝟒. 𝟓): The exact and the numerical results for the energy in
example (𝟒. 𝟐).
Approx
Exact
𝐸𝑛
𝑥 (N=3)
Fig 4.5 (a):A comparison between The exact and approximate results of 𝑬𝒏 .
Error
Fig 4.5 (b): Absolute error between exact and numerical energy in example 4.2.
71
𝜑(𝑥) = 𝑐 𝑒 −𝛼𝑥
the following algorithm is applied to obtain the solution of the
equation (4.7) using the finite difference method.
for 𝑖 = 5,
1 2 1
( ) 𝜑(𝑥4 ) − 𝜑(𝑥5 ) + ( ) 𝜑(𝑥6 ) = 𝛼 2 𝜑(𝑥5 )
ℎ2 ℎ2 ℎ2
for 𝑖 = 6,
1 2 1
( ) 𝜑(𝑥5 ) − 𝜑(𝑥6 ) + ( ) 𝜑(𝑥7 ) = 𝛼 2 𝜑(𝑥6 )
ℎ2 ℎ2 ℎ2
Table (𝟒. 𝟔): The exact and the numerical solutions using finite
difference method algorithm where 𝑵=5.
Exact
Approx
𝜑(𝑥)
𝑥(𝑁 = 5)
Fig 4.6 (a): A comparison between the exact and approximate solution in example 4.3.
75
Error
Fig. 4.6 (b): Absolute error between exact and numerical solution in example 4.3.
Table (4.7) contains the exact and the numerical results for the energy in
example (4.3).
Table (𝟒. 𝟕): numerical The exact and the results for the energy in
example (𝟒. 𝟑).
The exact and approximate results of 𝐸𝑛 are shown in Fig. 4.7 (𝑎)
and the resulted error is shown in Fig. 4.7 (𝑏).
76
𝐸𝑛
Fig 4.7 (a):A comparison between The exact and approximate results of 𝑬𝒏 .
Fig 4.7 (b): Absolute error between exact and numerical energy in example 4.3.
77
Conclusion
method than with finite difference methods to achieve the same accuracy.
78
References
Sons, (1978).
[3] V. Baskakov and A. Popov, Implementation of Transparent
16-43, (𝟐𝟎𝟎𝟑).
[11] V. Fock, Fundamentals of Quantum Mechanics, Mir Publishers,
Moscow, (1978).
[12] C. Gear, Numerical Initial Problems in Ordinary Differential
Equations, Prentice Hall, (1971).
[13] E. Gildener, A. Patrascioui, Pseudo Spectral Contributions to the
[22] AJ. Makowski, ST. Dembinski, Exactly solvable models with time
dependent boundary conditions, Physics Letters A, 154(5-6), pp.
217-220, (1991).
[23] J. Mallow, “Simple graphical solution for the finite square well
with no change of variables,” Am. J. Phys., Vol. 64, No. 9, pp. 1072-
1073, (1996).
2455-2468, (2002).
[27] R. Mcowen, Partial Differential Equations, Methods and
Applications, Prentice-Hall, (2003).
Appendix
84
Appendix (A)
Matlab code for finite difference method for time-independent
Schrödinger equation (infinite square well).
Clear all
L= input('\n Please enter the value of L');
En=zeros(1,N);
for i=1:N+1
En(i)=(i*i*(22/7)*(22/7)*2*m)/(2*m*L*L)
end
En=[En1 En2 En3 En4 En5 En6 En7 En8 En9 En10 ];
k=((2*m*En)/(h*h))^(1/2)
̂)
(%enter the values of the matrix Hamiltonian 𝐻
h1=(2/h*h)
h2=-1/(h*h)
[V,D] = eig(H)
(% the values of the diagonal of the eigenvalue)
app=[0 D(1,1) D(2,2) D(3,3) D(4,4) D(5,5) D(6,6) D(7,7) D(8,8) D(9, 9)
0];
(% the exact value of the wavefunction)
ress=zeros(1,N);
for j=1:N
ress(j)=(2)^(.05) *(sin((22/7)*j/10))
end
real= [0 ress 0]
(% enter the values of 𝑥)
x=[0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1]
(%plot the exact solution and approximation of wavefunction)
plot(x,real)
hold on
plot(x,app)
(%the error between exact and approximation solutions)
diff=real-d1;
plot(x,diff);
(%the absolute error)
AbDiff= abs(diff);
plot(x,AbDiff);
86
Appendix (B)
Matlab code for finite difference method for time-independent
Schrödinger equation (finite square well).
if mod(N,2)==1
else N= input('\n Please renter the value of N, you entered even number')
end
h=(f2-f1)/(N+1);
; h1=(2/h*h)
;h2=-1/(h*h)
87
number_of_X= N+1;
H=zeros(number_of_X/2);
for(i=1:number_of_X/2)
for(j=1:number_of_X/2)
if (i==j)
H(i,j)=h2;
else if (abs(i-j)==1)
H(i,j)=h1;
else
H(i,j)=0;
end
end
end
end
H1=-H;
[V,D] = eig(H)
[V1,D1] = eig(H1)
En=zeros(1,N);
for i=1:N
88
for(i=1:number_of_X/2)
for(j=1:number_of_X/2)
c(i,j)=D(i,i)
end
for(i=1:number_of_X/2)
for(j=1:number_of_X/2)
alpha1(i,j)=D1(0,0);
end
alpha=[c, alpha1];
plot(c,V)
plot(alpha,En);
a1=alpha(1,5:8)
plot(a1,V1)
En1=En(1:4)
En2=En(5:8)
89
Appendix (c)
Matlab code for Pseudo-spectral method for time-independent
Schrödinger equation.
اعداد
هديل موفق حجة
اشراف
أ .د .ناجي قطناني
قدمت هذه األطروحة استكماال لمتطلبات الحصول على درجة الماجستير في الرياضيات المحوسبة
في كلية الدراسات العليا ،نابلس ،فلسطين.
2019
ب
الحلول العددية لمعادلة شرودينجر
اعداد
هديل موفق حجة
اشراف
أ .د .ناجي قطناني
الملخص
تعتبر معادلة شرودنغر ومتغيراتها من المعادالت المحورية مجال البحث في مجال المعادالت
التفاضلية الجزئية ولها تطبيقاتها المختلفة في هندسة الرياضيات ونظرية الضوء والطيف واالنظمة
المتكاملة .تهدف هذه الدراسة الى عرض المفاهيم االساسية لميكانيكا الكم ومنها معادلة شرودنغر
بشكليها :معادلة شرودنغر المرتبطة بالزمن وتلك غير المرتبطة بالزمن .اضافة الى ذلك ,ستركز
الباحثة وبشكل رئيسي على بعض الطرق التحليلية والعددية لحل معادلة شرودنغر ومتغيراتها .فبالنسبة
الى الحل التحليلي لمعادلة شرودنغر ،فان الباحثة ستعمل على مبدا فصل المتغيرات ومبدا
الخصائص .اما بالنسبة للمعالجة العددية للمعادلة،فان الباحثة ستستخدم مبدا الفروق المنتهية ومبدا
الطيف الزائف لحالتين من ميكانيكا الكم :الحالة المحدودة وغير المحدودة .ولكي يتم اختبار فاعلية
هذه الطرق ،تم االخذ بعين االعتبار بعض حاالت االختبار العددية .وقد اظهرت النتائج العددية
بوضوح ان مبدا الطيف الزائف هو الطريقة االقوى لحل معادلة شرودنغر غير المرتبطة بالزمن
بالمقارنة مع التفاضل المحدود.