<< Chapter < Page Chapter >> Page >

Interpretation of results

In this section, we examine the eigenvalues of networks computed from our finite element discretization. While analysis of these values turns out to be difficult, we examine closed form solutions for a similar eigenvalue problem on networks from a paper by Joachim Von Below .

Numerical results

Unlike our original wave equation u x x = u t t , our networks of strings are allowed three-dimensional freedom of motion. We can apply our network wave equation to a single string

u x x = P u t t

where v is the unit vector specifying orientation of our string and P = k [ ( s - 1 ) I - v v T ] . Assume without loss of generality that v = k = [ 0 , 0 , 1 ] T and that k = 1 , s = 2 . Then P is simply a diagonal matrix and our equation u x x = P u t t becomes

u i u j u k t t = 1 0 0 0 1 0 0 0 2 u i u j u k x x

where u i , u j , u k are the the displacements of our string in the i , j , k directions. Since each of the equations is independent of the others, we can solve for the eigenvalues and eigenfunctions of each one-dimensional wave equation separately

λ i 2 u i = 2 u i x 2 λ j 2 u j = 2 u j x 2 2 λ k 2 u k = 2 u k x 2

Then, if λ is an eigenvalue of our one-dimensional wave equation, the eigenvalues λ i , λ j and λ k for the three dimensional wave equation are

λ i = λ λ j = λ λ k = 2 λ

We can see this captured in Figures and - the eigenvalues of our discretization are the interleaved eigenvalues of three one dimensional wave equations. For general orientations, the result is the same.

Computed eigenvalues of the three-dimensional wave equation.
Closed-form eigenvalues of the three-dimensional wave equation.

We can still trace out the linear progression of the eigenvalues here. However, the eigenvalues of a network of strings turn out to be far more interesting and unpredictable.

presents the first few eigenvalues of a Y-shaped network of strings, similar to our tritar mentioned previously. Even among simple webs such as the tritar, the pattern of the progression of eigenvalues is not easily deduced.

Eigenvalues of a tritar
Eigenvalues of a more complex network.

We can observe a few parts at which the eigenvalue behavior mimics the three dimensional single string. At values around 1 . 5 i and 3 i , there are double eigenvalues reminiscent of our double eigenvalues in , but the pattern of the rest of the eigenvalues is much less coherent.

Mode 5
Mode 10
Mode 11
Mode 12

Figures to are FEM calculations of several eigenmodes of a more complex network. Note that as the number of legs and connections increase, the number of degrees of freedom for the movement of each leg (and thus the number of possible eigenmodes of the network) should increase as well. The eigenvalues for the more complex network exhibit a similarly nonlinear pattern in the progression of the eigenvalues of the tritar.

Mode 5
Mode 9
Mode 10
Mode 12

Closed form solutions

To better understand the nonlinear progression of our eigenvalues, we seek out closed form solutions for the eigenvalues of networks. Joachim Von Below's provides one such solution in his examination of networks of strings in“A Characteristic Equation Associated to an Eigenvalue Problem on c 2 -Networks", Linear Algebra and its Applications , Volume 71 (1985), p309-325.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, The art of the pfug. OpenStax CNX. Jun 05, 2013 Download for free at http://cnx.org/content/col10523/1.34
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'The art of the pfug' conversation and receive update notifications?

Ask