Are hyperbolic sines and cosines orthogonal in solving higher order PDE's?

  • Context: Graduate 
  • Thread starter Thread starter Bleakfacade
  • Start date Start date
  • Tags Tags
    Higher order
Bleakfacade
Messages
9
Reaction score
1
Hello there!
So here's my problem, while you solve the Euler Bernoulli beam Equation by separation of variables, how do I have to prove the separated function of space are orthogonal? If so, are hyperbolic sines and cosines orthogonal when you have a product or a linear combination of them?

The pde is- [; u_{tt}+\alpha^{2} u_{xxxx} = o ;] where [; \alpha ;] is a constant that is material dependent. The separated function of space is [; F(x) = \sum_{n=1}^{\infty} [cosh(\beta_{n}x)-cos(\beta_{n}x)]-[sinh(\beta_{n}x)-sin(\beta_{n}x)] ;] where [; \beta_{n} ;] is some constant.
 
on Phys.org
You are looking for solutions of [itex]X_\lambda^{(4)} = \lambda X_\lambda[/itex] for [itex]\lambda \in \mathbb{R}[/itex]. Now for fixed [itex]\lambda[/itex] there is a four-dimensional subspace of solutions, and given an arbitrary inner product on that space there will exist a basis which is orthogonal with respect to that inner product. (The constraint you haven't mentioned is that [itex]X_\lambda[/itex] needs to satisfy the boundary conditions at each end of the beam. That constraint may cause you to reject some of these solutions.) So the difficulty is to find an inner product with respect to which [itex]X_\lambda[/itex] and [itex]X_\mu[/itex] are necessarily orthogonal when [itex]\lambda \neq \mu[/itex].

A sufficient condition for this is that the operator [itex]f \mapsto f^{(4)}[/itex] should be self-adjoint with respect to the inner product, ie. [tex] (f^{(4)},g) = (f,g^{(4)})[/tex] for every [itex]f[/itex] and [itex]g[/itex]. Now if you take (somewhat arbitrarily) the inner product [tex] (f,g) = \int_{-L}^L f(x)(g(x))^{*}\,dx[/tex] where [itex]{}^{*}[/itex] denotes the complex conjugate, then repeatedly integrating [itex](f^{(4)},g)[/itex] by parts yields [tex] (f^{(4)},g) = (f,g^{(4)}) + \left[ f'''g^{*} - f''(g^*)' + f'(g^*)'' - f(g^*)''' \right]_{-L}^{L}.[/tex]
 
  • Like
Likes   Reactions: Bleakfacade
pasmith said:
You are looking for solutions of [itex]X_\lambda^{(4)} = \lambda X_\lambda[/itex] for [itex]\lambda \in \mathbb{R}[/itex]. Now for fixed [itex]\lambda[/itex] there is a four-dimensional subspace of solutions, and given an arbitrary inner product on that space there will exist a basis which is orthogonal with respect to that inner product. (The constraint you haven't mentioned is that [itex]X_\lambda[/itex] needs to satisfy the boundary conditions at each end of the beam. That constraint may cause you to reject some of these solutions.) So the difficulty is to find an inner product with respect to which [itex]X_\lambda[/itex] and [itex]X_\mu[/itex] are necessarily orthogonal when [itex]\lambda \neq \mu[/itex].

A sufficient condition for this is that the operator [itex]f \mapsto f^{(4)}[/itex] should be self-adjoint with respect to the inner product, ie. [tex] (f^{(4)},g) = (f,g^{(4)})[/tex] for every [itex]f[/itex] and [itex]g[/itex]. Now if you take (somewhat arbitrarily) the inner product [tex] (f,g) = \int_{-L}^L f(x)(g(x))^{*}\,dx[/tex] where [itex]{}^{*}[/itex] denotes the complex conjugate, then repeatedly integrating [itex](f^{(4)},g)[/itex] by parts yields [tex] (f^{(4)},g) = (f,g^{(4)}) + \left[ f'''g^{*} - f''(g^*)' + f'(g^*)'' - f(g^*)''' \right]_{-L}^{L}.[/tex]

Well, that was my approach, which was not obvious to me to begin with. But the boundary conditions were to replicate a cantilever beam that is suspended at one end. I have a rather monstrous equation which has many hyperbolic sines and cosines in it. I am not quite sure if the hyperbolic terms are orthogonal. I looked at their graphs for some insight but to no avail.
Also, the inner product I have is
[; (f,g) = \int_{0}^{L} f(x)(g(x))*dx ;]
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 36 ·
2
Replies
36
Views
7K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 139 ·
5
Replies
139
Views
13K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 7 ·
Replies
7
Views
4K