Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases. In the discrete case, the standard central difference approximation of the second derivative is used on a uniform grid.
These formulas are used to derive the expressions for eigenfunctions of Laplacian in case of separation of variables, as well as to find eigenvalues and eigenvectors of multidimensional discrete Laplacian on a regular grid, which is presented as a Kronecker sum of discrete Laplacians in one-dimension.
The index j represents the jth eigenvalue or eigenvector and runs from 1 to
infty
x\in[0,L]
λj=-
j2\pi2 | |
L2 |
vj(x)=\sqrt{
2 | |
L |
λj=-
(j-1)2\pi2 | |
L2 |
vj(x)=
| ||||||
\left\{ \begin{array}{lr} L |
&j=1\\ \sqrt{
2 | |
L |
λj=\left\{ \begin{array}{lr} -
j2\pi2 | |
L2 |
&j\\ -
(j-1)2\pi2 | |
L2 |
&jisodd. \end{array} \right.
(That is:
0
j2\pi2 | |
L2 |
j=1,2,\ldots
vj(x)=
| ||||
\begin{cases} L |
&ifj=1.\\ \sqrt{
2 | |
L |
λj=-
(2j-1)2\pi2 | |
4L2 |
vj(x)=\sqrt{
2 | |
L |
λj=-
(2j-1)2\pi2 | |
4L2 |
vj(x)=\sqrt{
2 | |
L |
Notation: The index j represents the jth eigenvalue or eigenvector. The index i represents the ith component of an eigenvector. Both i and j go from 1 to n, where the matrix is size n x n. Eigenvectors are normalized. The eigenvalues are ordered in descending order.
λj=-
4 | |
h2 |
| ||||
\sin |
\right)
vi,j=\sqrt{
2 | |
n+1 |
λj=-
4 | |
h2 |
| ||||
\sin |
\right)
vi,j=
| ||||||
\begin{cases} n |
&j\\ \sqrt{
2 | |
n |
λj=\begin{cases} -
4 | |
h2 |
| ||||
\sin |
\right)&\\ -
4 | |
h2 |
| ||||
\sin |
\right)&ifjiseven. \end{cases}
(Note that eigenvalues are repeated except for 0 and the largest one if n is even.)
vi,j=
| ||||
\begin{cases} n |
&ifj=
| ||||
1.\\ n |
(-1)i&ifj=n\\ \sqrt{
2 | |
n |
λj=-
4 | |
h2 |
| |||||||||
\sin |
\right)
vi,j=\sqrt{
2 | |
n+0.5 |
λj=-
4 | |
h2 |
| |||||||||
\sin |
\right)
vi,j=\sqrt{
2 | |
n+0.5 |
In the 1D discrete case with Dirichlet boundary conditions, we are solving
vk+1-2vk+vk-1 | |
h2 |
=λvk, k=1,...,n, v0=vn+1=0.
Rearranging terms, we get
vk+1=(2+h2λ)vk-vk-1.
Now let
2\alpha=(2+h2λ)
v1 ≠ 0
v
v1=1
Then we find the recurrence
v0=0
v1=1.
vk+1=2\alphavk-vk-1
Considering
\alpha
vk+1=Uk(\alpha)
Uk
Since
vn+1=0
Un(\alpha)=0
It is clear that the eigenvalues of our problem will be the zeros of the nth Chebyshev polynomial of the second kind, with the relation
2\alpha=(2+h2λ)
These zeros are well known and are:
\alphak=\cos\left(
k\pi | |
n+1 |
\right).
Plugging these into the formula for
λ
2\cos\left(
k\pi | |
n+1 |
\right)=h2λk+2
λk=-
2 | |
h2 |
\left[1-\cos\left(
k\pi | |
n+1 |
\right)\right].
And using a trig formula to simplify, we find
λk=-
4 | |
h2 |
| ||||
\sin |
\right).
In the Neumann case, we are solving
vk+1-2vk+vk-1 | |
h2 |
=λvk, k=1,...,n, v'0.5=v'n+0.5=0.
In the standard discretization, we introduce
v0
vn+1
v'0.5:=
v1-v0 | |
h |
, v'n+0.5:=
vn+1-vn | |
h |
The boundary conditions are then equivalent to
v1-v0=0, vn+1-vn=0.
If we make a change of variables,
wk=vk+1-vk, k=0,...,n
we can derive the following:
\begin{alignat}{2} | vk+1-2vk+vk-1 |
h2 |
&=λvk\\ vk+1-2vk+vk-1&=h2λvk\\ (vk+1-vk)-(vk-vk-1)&=h2λvk\\ wk-wk-1&=h2λvk\\ &=h2λwk-1+h2λvk-1\\ &=h2λwk-1+wk-1-wk-2\\ wk&=(2+h2λ)wk-1-wk-2\\ wk+1&=(2+h2λ)wk-wk-1\\ &=2\alphawk-wk-1. \end{alignat}
with
wn=w0=0
This is precisely the Dirichlet formula with
n-1
h
w1 ≠ 0
λk=-
4 | |
h2 |
| ||||
\sin |
\right), k=1,...,n-1.
This gives us
n-1
n
w1 ≠ 0
vk=constant \forall k=0,...,n+1,
0
Relabeling the indices in the formula above and combining with the zero eigenvalue, we obtain,
λk=-
4 | |
h2 |
| ||||
\sin |
\right), k=1,...,n.
For the Dirichlet-Neumann case, we are solving
vk+1-2vk+vk-1 | |
h2 |
=λvk, k=1,...,n, v0=v'n+0.5=0.
where
v'n+0.5:=
vn+1-vn | |
h |
.
We need to introduce auxiliary variables
vj, j=0,...,n.
Consider the recurrence
vk+0.5=2\betavk-vk-0.5,forsome\beta
Also, we know
v0=0
v0.5 ≠ 0
v0.5
v0.5=1.
We can also write
vk=2\betavk-0.5-vk-1
vk+1=2\betavk+0.5-vk.
Taking the correct combination of these three equations, we can obtain
vk+1=(4\beta2-2)vk-vk-1.
And thus our new recurrence will solve our eigenvalue problem when
h2λ+2=(4\beta2-2).
Solving for
λ
λ=
4(\beta2-1) | |
h2 |
.
Our new recurrence gives
vn+1=U2n(\beta), vn=U2n(\beta),
where
Uk(\beta)
And combining with our Neumann boundary condition, we have
U2n(\beta)-U2n(\beta)=0.
A well-known formula relates the Chebyshev polynomials of the first kind,
Tk(\beta)
Uk(\beta)-Uk(\beta)=Tk(\beta).
Thus our eigenvalues solve
T2n(\beta)=0, λ=
4(\beta2-1) | |
h2 |
.
The zeros of this polynomial are also known to be
\betak=\cos\left(
\pi(k-0.5) | |
2n+1 |
\right), k=1,...,2n+1
And thus
\begin{alignat}{2} λk&=
4 | |
h2 |
| ||||
\left[\cos |
\right)-1\right]\\ &=-
4 | |
h2 |
| ||||
\sin |
\right). \end{alignat}
Note that there are 2n + 1 of these values, but only the first n + 1 are unique. The (n + 1)th value gives us the zero vector as an eigenvector with eigenvalue 0, which is trivial. This can be seen by returning to the original recurrence. So we consider only the first n of these values to be the n eigenvalues of the Dirichlet - Neumann problem.
λk=-
4 | |
h2 |
| ||||
\sin |
\right), k=1,...,n.