Khabibullin's conjecture on integral inequalities

From formulasearchengine
Jump to navigation Jump to search

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 continuous case

The index j represents the jth eigenvalue or eigenvector and runs from 1 to . Assuming the equation is defined on the domain x[0,L], the following are the eigenvalues and normalized eigenvectors. The eigenvalues are ordered in descending order.

Pure Dirichlet boundary conditions

λj=j2π2L2
vj(x)=2Lsin(jπxL)

Pure Neumann boundary conditions

λj=(j1)2π2L2
vj(x)={L12j=12Lcos((j1)πxL)otherwise

Periodic boundary conditions

λj={j2π2L2j is even.(j+1)2π2L2j is odd.

(That is: 0 is a simple eigenvalue and all further eigenvalues are given by j2π2L2, j=1,2,, each with multiplicity 2).

vj(x)={L12if j=1.2Lsin(jπxL) if j is even.2Lcos((j+1)πxL) otherwise if j is odd.

Mixed Dirichlet-Neumann boundary conditions

λj=(2j1)2π24L2
vj(x)=2Lsin((2j1)πx2L)

Mixed Neumann-Dirichlet boundary conditions

λj=(2j1)2π24L2
vj(x)=2Lcos((2j1)πx2L)

The discrete case

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.

Pure Dirichlet boundary conditions

λj=4h2sin(πj2(n+1))2
vi,j=2n+1sin(ijπn+1)

Pure Neumann boundary conditions

λj=4h2sin(π(j1)2n)2
vi,j={n12j=12ncos(π(j1)(i12)n)otherwise

Periodic boundary conditions

λj={4h2sin(π(j1))2n)2 if j is odd.4h2sin(πj2n)2 if j is even.

(Note that eigenvalues are repeated except for 0 and the largest one if n is even.)

vi,j={n12if j=1.n12(1)iif j=n and n is even.2nsin(π(i0.5)jn) otherwise if j is even.2ncos(π(i0.5)(j1)n) otherwise if j is odd.

Mixed Dirichlet-Neumann boundary conditions

λj=4h2sin(π(j12)2n+1)2
vi,j=2n+0.5sin(πi(2j1)2n+1)

Mixed Neumann-Dirichlet boundary conditions

λj=4h2sin(π(j12)2n+1)2
vi,j=2n+0.5cos(π(i0.5)(2j1)2n+1)

Derivation of Eigenvalues and Eigenvectors in the Discrete Case

Dirichlet case

In the 1D discrete case with Dirichlet boundary conditions, we are solving

vk+12vk+vk1h2=λvk,k=1,...,n,v0=vn+1=0.

Rearranging terms, we get

vk+1=(2+h2λ)vkvk1.

Now let 2α=(2+h2λ). Also, assuming v10, we can scale eigenvectors by any nonzero scalar, so scale v so that v1=1.

Then we find the recurrence

v0=0
v1=1.
vk+1=2αvkvk1

Considering α as an indeterminate,

vk+1=Uk(α)

where Uk is the kth Chebyshev polynomial of the 2nd kind.

Since vn+1=0, we get that

Uk(α)=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α=(2+h2λ).

These zeros are well known and are:

αk=cos(kπn+1).

Plugging these into the formula for λ,

2cos(kπn+1)=h2λk+2
λk=2h2(1cos(kπn+1)).

And using a trig formula to simplify, we find

λk=4h2(sin2(kπ2(n+1))).

Neumann case

In the Neumann case, we are solving

vk+12vk+vk1h2=λvk,k=1,...,n,v'0.5=v'n+0.5=0.

In the standard discretization, we introduce v0 and vn+1 and define

v'0.5:=v1v0h,v'n+0.5:=vn+1vnh

The boundary conditions are then equivalent to

v1v0=0,vn+1vn=0.

If we make a change of variables,

wk=vk+1vk,k=0,...,n

we can derive the following:

vk+12vk+vk1h2=λvkvk+12vk+vk1=h2λvk(vk+1vk)(vkvk1)=h2λvkwkwk1=h2λvk=h2λwk1+h2λvk1=h2λwk1+wk1wk2wk=(2+h2λ)wk1wk2wk+1=(2+h2λ)wkwk1=2αwkwk1.

with wn=w0=0 being the boundary conditions.

This is precisely the Dirichlet formula with n1 interior grid points and grid spacing h. Similar to what we saw in the above, assuming w10, we get

λk=4h2(sin2(kπn)),k=1,...,n1.

This gives us n1 eigenvalues and there are n. If we drop the assumption that w10, we find there is also a solution with vk=constantk=0,...,n+1, and this corresponds to eigenvalue 0.

Relabeling the indices in the formula above and combining with the zero eigenvalue, we obtain,

λk=4h2(sin2((k1)πn)),k=1,...,n.

Dirichlet-Neumann Case

For the Dirichlet-Neumann case, we are solving

vk+12vk+vk1h2=λvk,k=1,...,n,v0=v'n+0.5=0.,

where v'n+0.5:=vn+1vnh.

We need to introduce auxiliary variables vj+0.5,j=0,...,n.

Consider the recurrence

vk+0.5=2βvkvk0.5, for some β.

Also, we know v0=0 and assuming v0.50, we can scale v0.5 so that v0.5=1.

We can also write

vk=2βvk0.5vk1
vk+1=2βvk+0.5vk.

Taking the correct combination of these three equations, we can obtain

vk+1=(4β22)vkvk1.

And thus our new recurrence will solve our eigenvalue problem when

h2λ+2=(4β22).

Solving for λ we get

λ=4(β21)h2.

Our new recurrence gives

vn+1=U2n+1(β),vn=U2n1(β),

where Uk(β) again is the kth Chebyshev polynomial of the 2nd kind.

And combining with our Neumann boundary condition, we have

U2n+1(β)U2n1(β)=0.

A well-known formula relates the Chebyshev polynomials of the first kind, Tk(β), to those of the second kind by

Uk(β)Uk2(β)=Tk(β).

Thus our eigenvalues solve

T2n+1(β)=0,λ=4(β21)h2.

The zeros of this polynomial are also known to be

βk=cos(π(k0.5)2n+1),k=1,...,2n+1

And thus

λk=4h2(cos(π(k0.5)2n+1)21)=4h2sin(π(k0.5)2n+1)2.

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=4h2sin(π(k0.5)2n+1)2,k=1,...,n.