User Tools

Site Tools


math121b:02-19

2020-02-19, Separation of Variables

The idea (equation only, without boundary condition)

Suppose you have a differential operator P(x,y)=P1(x)+P2(y)P(x,y) = P_1(x) + P_2(y), and you have a differential equation about F(x,y)F(x,y) P(x,y)F(x,y)=0 P(x,y) F(x,y) = 0 Then one can try to find a basis {Fn(x,y)}\{ F_n(x,y)\} for the solution space, where each FnF_n can be written as (omitting the subscript nn) F(x,y)=A(x)B(y) F(x,y) = A(x) B(y) Then the equation become B(y)P1(x)A(x)+A(x)P2(y)B(y)=0 B(y) P_1(x) A(x) + A(x) P_2(y) B(y) = 0 Divide both sides by A(x)B(y)A(x) B(y), we get 1A(x)P1(x)A(x)+1B(y)P2(y)B(y)=0. \frac{1}{A(x)} P_1(x) A(x) + \frac{1}{B(y)} P_2(y) B(y) = 0. The first term is something about xx, the second term is something about yy, the only possibility that they cancel is that both terms are constants, hence we try to solve for 1A(x)P1(x)A(x)=λ,1B(y)P2(y)B(y)=λ \frac{1}{A(x)} P_1(x) A(x) = \lambda, \quad \frac{1}{B(y)} P_2(y) B(y) = -\lambda for some λR\lambda \in \R.

Naive Approach If for some λ\lambda, we can solve to get Aλ,i(x)A_{\lambda,i}(x) for i=1,,n(λ)i=1,\cdots, n(\lambda), and Bλ,j(y)B_{\lambda, j}(y) for $j =1, \cdots, m(\lambda)$, then we get a collection of functions Fλ,i,j(x,y)=Aλ,i(x)Bλ,j(y)F_{\lambda, i, j} (x, y) = A_{\lambda,i}(x) B_{\lambda, j}(y) and we may hope to express any solution as F(x,y)=λijCλ,i,jAλ,i(x)Bλ,j(y) F(x,y) = \sum_{\lambda} \sum_{i} \sum_{j} C_{\lambda, i, j } A_{\lambda,i}(x) B_{\lambda, j}(y)

Problem with the above approach How do I know that these functions {Fλ,i,j(x,y)} \{ F_{\lambda, i, j} (x, y) \} forms a basis of the solution space?

Example

Consider the equation (x2+y2)F(x,y)=0 (\d_x^2 + \d_y^2) F(x,y) = 0 Or the equation (x4+y4)F(x,y)=0 (\d_x^4 + \d_y^4) F(x,y) = 0

Boundary Condition

Consider the example of steady state heat equation in a rectangle. (x2+y2)T(x,y)=0,0<x<1,0<y<1(1) \tag{1} (\d_x^2 + \d_y^2)T(x,y) = 0, \quad 0< x < 1, 0 < y < 1 with boundary condition that T(0,y)=0,T(1,y)=0,T(x,0)=0,(2) \tag{2} T(0, y) = 0, \quad T(1,y) = 0, \quad T(x, 0) = 0, and in addition we impose T(x,1)=f(x)(3) \tag{3} T(x, 1) = f(x) for some smooth function f(x)f(x) on [0,1][0,1], such that f(0)=f(1)=0f(0)= f(1)=0.

How to solve this problem? We hope to write the solution in the following form T(x,y)=nCnXn(x)Yn(y) T(x,y) = \sum_{n} C_n X_n(x) Y_n(y) where Xn(x)Yn(y)X_n(x) Y_n(y) forms a basis of the above problem with constraint (1) and (2). Then (3) can be used to fix the coefficients CnC_n.

The separation of variable gives x2X(x)=λX(x),X(0)=X(1)=0 \d_x^2 X(x) = \lambda X(x), \quad X(0) = X(1) = 0 y2Y(y)=λY(y),Y(0)=0 \d_y^2 Y(y) = -\lambda Y(y), \quad Y(0) = 0 What λ\lambda should we choose? The equation about X(x)X(x) indicate λ\lambda should be negative, we should have λ=(nπ)2,Xλ(x)=sin(nπx)\lambda = -(n \pi)^2, \quad X_{\lambda}(x) = \sin(n \pi x) And the equation for YY can be solved as Y(y)=sinh(nπy) Y(y) = \sinh( n \pi y)

The general solution for (1) and (2) is F(x,y)=n=1Cnsin(nπx)sinh(nπy) F(x,y) = \sum_{n=1}^\infty C_n \sin(n \pi x) \sinh(n \pi y)

Finally, we use the boundary condition f(x)=F(x,1)f(x) = F(x, 1) to get CnC_n f(x)=n=1Cnsin(nπx)sinh(nπ) f(x) = \sum_{n=1}^\infty C_n \sin(n \pi x) \sinh(n \pi) Multiply both sides by sin(nπx)\sin(n \pi x) and integrate over xx, we get 01f(x)sin(nπx)dx=Cn12sinh(nπ) \int_0^1 f(x) \sin(n \pi x) dx = C_n \frac{1}{2} \sinh(n \pi) hence Cn=2sinh(nπ)01f(x)sin(nπx)dx. C_n = \frac{2}{\sinh(n \pi)} \int_0^1 f(x) \sin(n \pi x) dx.

General Boundary Value? : suppose the four sides of the square has non-zero values? Just break the problem to 4 smaller problems, where each one has only one side non-zero, then do this problem 4 times.

Eigenvalue problem

The equation x2X(x)=λX(x),X(0)=1,X(1)=0 \d_x^2 X(x) = \lambda X(x), \quad X(0) = 1, \quad X(1)=0 is an eigenvalue problem. For a randomly chosen λ\lambda, say 0.7210.721, the solution is only 00. Hence to have a non-zero solution, λ\lambda can only be some special value.

This is analogous to the problem of solving for eigenvalue and eigenvector for an n×nn \times n matrix AA: Av=λv A v = \lambda v here, recall we solve for the roots of the P(λ)=det(AλI)=0P(\lambda) = \det(A - \lambda I) = 0, then for each λ\lambda, we solve for vv. (There might be several linearly independent vv corresponding to the same λ\lambda).

Here we have the same problem, but, instead of having a matrix AA acting on a vector space Rn\R^n, we have an operator x2\d_x^2 acting on (an infinite dimensional vector space) the function space on [0,1][0,1].

math121b/02-19.txt · Last modified: 2020/02/19 01:21 by pzhou