1-D Wave equation with mixed boundary conditions

KEØM
Messages
65
Reaction score
0

Homework Statement


Solve, u_{t} = u_{xx}c^{2}

given the following boundary and initial conditions

u_{x}(0,t) = 0, u(L,t) = 0

u(x,0) = f(x) , u_{t}(x,0) = g(x)

Homework Equations



u(x,t) = F(x)G(t)

The Attempt at a Solution


I solved it, I am just not sure if it is right.

u(x,t) = \sum_{n=1}^\infty(a_{n}cos(\lambda_{n}t) + b_{n}sin(\lambda_{n}t))cos((n-\frac{1}{2})\frac{\pi}{L}x)<br /> <br /> , \lambda_{n} = (n-\frac{1}{2})\frac{\pi}{L}c

a_{n} = \frac{2}{L}\int_0^L f(x)cos((n-\frac{1}{2})\frac{\pi}{L}x)dx,<br /> <br /> b_{n} = \frac{4}{(2n-1)c\pi}\int_0^L g(x)cos((n-\frac{1}{2})\frac{\pi}{L}x)dx<br />

Can someone please verify this for me?

Thanks in advance,
KEØM
 
Last edited:
Physics news on Phys.org
Why does your formula for bn[/b] involve cosine rather than sine?
 
Thanks for replying HallsofIvy.

Well to get b_{n} I applied the initial condition

u_{t}(x,0) = g(x).

So I first find u_{t} which comes to

u_{t} = \sum_{n=1}^\infty(-a_{n}\lambda_{n}sin(\lambda_{n}t) + b_{n}\lambda_{n}cos(\lambda_{n}t))cos((n-\frac{1}{2})\frac{\pi}{L}x)

now evaluating u_{t} at t = 0 and setting it equal to g(x) we get,

u_{t}(x,0) = \sum_{n=1}^\infty b_{n}\lambda_{n}cos((n-\frac{1}{2})\frac{\pi}{L}x) = g(x)

But that is just the Fourier cosine series of g(x) just with the extra \lambda_{n} and with the zero term equal to zero

so b_{n} = \frac{2}{\lambda_{n}}\int_0^L g(x)cos((n-\frac{1}{2})\frac{\pi}{L}x)dx

where \lambda_{n} = (n-\frac{1}{2})\frac{\pi}{L}c <br />

\Rightarrow b_{n} = \frac{4}{(2n-1)c\pi}\int_0^L g(x)cos((n-\frac{1}{2})\frac{\pi}{L}x)dx

Please let me know if I did something wrong.

Thanks again,
KEØM
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top