<< Chapter < Page Chapter >> Page >
Condition Number of Potential Networks
Average Condition Number of Networks
Network C ¯
1 17.2
2 31.9
3 29.5
4 26.5
5 27.4
6 28.1
7 3815.0
8 2538.4
9 30.0
10 25.8
11 28.0
12 29.7
13 25.8
14 31.3
15 2133.3
16 2219.0

It would seem that all networks that we had to modify are significantly worse than networks we did not have to modify. Looking more closely at the singular-value decomposition, we find that there is one very large singular value corresponding to the row we added because the entries in this row are much larger than all the other entries in B . There is no particular reason why we need a 1 and a - 1 (or any other pair of opposite numbers), so we scale this row down. We would like to improve the condition number as much as possible, so we look at the condition number of B as a function of the scaling factor of the last row. We find that, as the scaling factor increases, the condition number decreases.

[link] shows the relationship between the scaling factor on the additional row and the condition number of B for Network g, using the first 4 experiments of Data Set A.

Effect of Scaling Factor on Condition Number of B

We repeated the simulations, scaling the additional row by a factor of 1 / 200 . The scaled results are presented in [link] ; for reference, the unscaled results are also included. This method, then, greatly improves the condition number of the matrix.

Condition Number of Potential Networks
Average Condition Number of Networks - Scaled
Network C ¯ not scaled C ¯ scaled
1 17.2 17.2
2 31.9 31.9
3 29.5 29.5
4 26.5 26.5
5 37.5 27.4
6 28.1 28.1
7 3815.0 44.5
8 2538.4 26.1
9 30.0 30.0
10 25.8 25.8
11 28.0 28.0
12 29.7 29.7
13 25.8 25.8
14 31.3 31.3
15 2133.3 22.3
16 2219.0 22.4

Ultimately, we decided to work with Network g because it was the tautest, so it eliminated some experimental error. It was unfortunate that this network had the worst average condition number, but the benefit of accurate data was greater than the benefit of an accurate matrix. For future experimentation, however, building a new structure and using Network a might be the best.

We were also interested in how stacking impacts the condition number of a network. To study this, we add two experiments from Data Set A at a time and compute the condition number after each step. [link] shows the singular values of B as we add more experiments; the lighter the color, the more experiments have been added. [link] shows how the condition number of B changes as we add more experiments; the red line is the minimum. From this, we conclude that adding more experiments improves the condition number to a certain point, but it is close to constant from there.

Singular Values of B
Condition Number of B

When we stack all of the results from Data Set A together and scale them appropriately, we get 145.6% error.

Spring Constants with Best Condition Number
Spring Constants with Best Condition Number
Spring Constants with Best Condition Number
Spring Measured Calculated
1 190.3 213.5
2 285.0 295.6
3 153.0 105.6
4 166.8 184.2
5 230.9 258.3
6 187.9 142.1
7 200.0 125.5
8 915.0 988.5
9 240.3 171.1
10 208.9 323.7
11 196.1 173.9
12 233.3 295.6
13 197.5 276.7
14 223.1 75.8
15 181.2 224.5
16 249.0 450.7

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