Wednesday, September 15, 2021

Numerically Solving the Schrödinger Equation

Often the bound potentials that we encounter are complex, and the time-independent Schrödinger equation will need to be evaluated numerically. There are two common numerical methods for solving for the eigenvalues and eigenfunctions of a potential. Both methods require truncating and discretizing a region of space that is normally spanned by an infinite dimensional Hilbert space. The Numerov method is a finite difference method that calculates the shape of the wavefunction by integrating step-by-step across along a grid. The DVR method makes use of a transformation between a finite discrete basis and the finite grid that spans the region of interest.

Figure 9 .png
Figure 1.5.1
: Selection and discretization of a space bounding the region for which the TISE will be solved numerically. A space of length L is discretized into N points separated by a spacing δx
over which the potential varies slowly.

The Numerov Method

A one-dimensional Schrödinger equation for a particle in a potential can be numerically solved on a grid that discretizes the position variable using a finite difference method. The TISE is

[T+V(x)]ψ(x)=Eψ(x)(1.5.1)

with

T=22m2x2,(1.5.2)

which we can write as

ψ(x)=k2(x)ψ(x)(1.5.3)

where

k2(x)=2m2[EV(x)].(1.5.4)

If we discretize the variable x

, choosing a grid spacing δx over which V

varies slowly, we can use a three point finite difference to approximate the second derivative:

fi1δx2(f(xi+1)2f(xi)+f(xi1))(1.5.5)

The discretized Schrödinger equation can then be written in the form

ψ(xi+1)2ψ(xi)+ψ(xi1)=k2(xi)ψ(xi)(1.5.6)

Using the equation for ψ(xi+1)

, one can iteratively solve for the eigenfunction. In practice, you discretize over a range of space such that the highest and lowest values lie in a region where the potential is very high or forbidden. Splitting the space into N points, chose the first two values ψ(x1)=0 and ψ(x2)x to be a small positive or negative number, guess E, and propagate iteratively to ψ(xN). A comparison of the wavefunctions obtained by propagating from x1 to xN with that obtained propagating from xN to x1 tells you how good your guess of E

was.

The Numerov Method improves on Equation 1.5.6

by taking account for the fourth derivative of the wavefunction Ψ(4), leading to errors on the order O(δx6). Equation 1.5.5

becomes

fi1δx2(f(xi+1)2f(xi)+f(xi1))δx212f(4)i(1.5.7)

By differentiating Equation 1.5.3

we know

ψ(4)(x)=(k2(x)ψ(x))(1.5.8)

and the discretized Schrödinger equation becomes

ψ(xi)=1δx2(ψ(xi+1)2ψ(xi)+ψ(xi1))+112(k2(xi+1)ψ(xi+1)2k2(xi+1)ψ(xi)+k2(xi+1)ψ(xi1))

This equation leads to the iterative solution for the wavefunction

ψ(xi+1)=ψ(xi)(2+10δx212k2(xi))ψ(xi1)(1δx212k2(xi1))1δx212k2(xi+1)(1.5.9)

Discrete Variable Representation (DVR)

Numerical solutions to the wavefunctions of a bound potential in the position representation require truncating and discretizing a region of space that is normally spanned by an infinite dimensional Hilbert space. The DVR approach uses a real space basis set whose eigenstates φi(x)

we know and that span the space of interest—for instance harmonic oscillator wavefunctions—to express the eigenstates of a Hamiltonian in a grid basis (θj) that is meant to approximate the real space continuous basis δ(x). The two basis sets, which we term the eigenbasis (φ) and grid basis (θ

), will be connected through a unitary transformation

Φφ(x)=θ(x)

Φθ(x)=φ(x)

For N

discrete points in the grid basis, there will be N

eigenvectors in the eigenbasis, allowing the properties of projection and completeness will hold in both bases. Wavefunctions can be obtained by constructing the Hamiltonian in the eigenbasis,

H=T(p^)+V(x^),

transforming to the DVR basis, HDVR=ΦHΦ,

and then diagonalizing.

Here we will discuss a version of DVR in which the grid basis is set up to mirror the continuous |X

eigenbasis. We begin by choosing the range of x that contain the bound states of interest and discretizing these into N points (xi) equally spaced by δx. We assume that the DVR basis functions θj(xi)

resemble the infinite dimensional position basis

θj(xi)=Δxδij(1.5.10)

Our truncation is enabled using a projection operator in the reduced space

PN=i=1N|θiθi|1(1.5.11)

which is valid for appropriately high N

. The complete Hamiltonian can be expressed in the DVR basis DVR

HDVR=TDVR+VDVR.(1.5.12)

For the potential energy, since {θi}

is localized with θi|θj=δij, we make the DVR approximation, which casts VDVR

into a diagonal form that is equal to the potential energy evaluated at the grid point:

VDVRij=θi|V(x^)|θjV(xi)δij(1.5.13)

This comes from approximating the transformation as ΦV(x^)ΦV(Φx^Φ).

For the kinetic energy matrix elements θi|T(p^)|θj

, we need to evaluate second derivatives between different grid points. Fortunately, Colbert and Miller have simplified this process by finding an analytical form for the TDVR matrix for a uniformly gridded box with a grid spacing of Δx

.

TDVRij=2(1)ij2mΔx2{π2/32/(ij)2i=jij}(1.5.14)

This comes from a Fourier expansion in a uniformly gridded box. Naturally this looks oscillatory in x

at period of δx. Expression becomes exact in the limit of N or Δx0. The numerical routine becomes simple and efficient. We construct a Hamiltonian filling with matrix elements whose potential and kinetic energy contributions are given by Equations 1.5.13 and 1.5.14. Then we diagonalize HDVR, from which we obtain N eigenvalues and the N corresponding eigenfunctions.

 

 

https://chem.libretexts.org/Bookshelves/Physical_and_Theoretical_Chemistry_Textbook_Maps/Time_Dependent_Quantum_Mechanics_and_Spectroscopy_(Tokmakoff)/01%3A_Overview_of_Time-Independent_Quantum_Mechanics/1.05%3A_Numerically_Solving_the_Schrodinger_Equation 

No comments:

Post a Comment