30.07.2013 Views

WAVES AND VIBRATIONS IN INHOMOGENEOUS STRUCTURES ...

WAVES AND VIBRATIONS IN INHOMOGENEOUS STRUCTURES ...

WAVES AND VIBRATIONS IN INHOMOGENEOUS STRUCTURES ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1610 J. S. JENSEN<br />

The following procedure used to obtain bi is limited to the case where the number of degrees<br />

of freedom Nd is higher than the chosen number of expansion terms N. As mentioned previously,<br />

this is a practical necessity when dealing with large finite element models and hence poses no<br />

real limitation on the method. With this assumption the equation system in Equation (24) is overdetermined<br />

and can be used to find a common set of bi coefficients for all degrees of freedom in<br />

the model. This approach differs from many previous implementations (e.g. [5]) where additional<br />

equations of the form in (24) are created by matching terms of order N+2 up to 2N .<br />

Equation (24) can be written as<br />

⎛ ⎞<br />

b1<br />

⎜ ⎟<br />

⎜ b2 ⎟<br />

⎜ ⎟<br />

[uN uN−1 ··· u1] ⎜ ⎟ =−uN+1<br />

(25)<br />

⎜ ⎟<br />

⎝ . ⎠<br />

and is solved by finding the least-squares solution with the use of the pseudoinverse matrix [17]:<br />

⎛ ⎞ ⎡<br />

b1 u<br />

⎜ ⎟ ⎢<br />

⎜ b2 ⎟ ⎢<br />

⎜ ⎟ ⎢<br />

⎜ ⎟ =−⎢<br />

⎜ ⎟ ⎢<br />

⎝ . ⎠ ⎢<br />

⎣<br />

+<br />

1<br />

u +<br />

⎤<br />

⎥<br />

2 ⎥ uN+1<br />

(26)<br />

. ⎥<br />

⎦<br />

bN<br />

u + N<br />

in which u + i denotes a row vector in the pseudoinverse matrix. The pseudoinverse matrix can in<br />

this case be explicitly computed as<br />

⎡<br />

u<br />

⎢<br />

⎣<br />

+<br />

1<br />

u +<br />

⎤ ⎡<br />

u<br />

⎥ ⎢<br />

2 ⎥ ⎢<br />

⎥ ⎢<br />

⎥ = Q ⎢<br />

. ⎥ ⎢<br />

⎦ ⎣<br />

∗ N<br />

u ∗ ⎤<br />

⎥<br />

N−1 ⎥<br />

(27)<br />

⎥<br />

. ⎦<br />

in which Q = P −1 and<br />

⎡<br />

⎢<br />

P = ⎢<br />

⎣<br />

u + N<br />

u ∗ N<br />

u ∗ N−1<br />

.<br />

u ∗ 1<br />

bN<br />

u ∗ 1<br />

⎤<br />

⎥ [uN<br />

⎥<br />

⎦<br />

uN−1 ... u1] (28)<br />

with u ∗ i denoting the conjugate transpose of the ui vector. The procedure is justified by numerical<br />

experiments showing that P is of full rank so that the matrix inversion is possible.<br />

However, P turns out to be ill-conditioned if N is large setting a limit to the order of approximation<br />

that can be constructed. As pointed out in [10], this problem can be circumvented by using the<br />

Copyright q 2007 John Wiley & Sons, Ltd. Int. J. Numer. Meth. Engng 2007; 72:1605–1630<br />

DOI: 10.1002/nme

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!