link to my thesis

More documents

Recommendations

Info

72 CHAPTER 5. ND-SYSTEMS APPROACH IN POLYNOMIAL OPTIMIZATION (a) (b) (c) Figure 5.11: Non-minimal stable patterns (green layers) allowing for shifts along one time axis: (a) t 1 time axis, (b) t 2 time axis, (c) t 3 time axis method has the effect that the calculated points are first directed towards the nearest axis and then to the origin. (v) A slightly more sophisticated fifth method has been designed on the basis of insights gained from the test experiments with the first four methods introduced above. It is discussed later in this section and will be called the ‘least-increments method’. For the two-dimensional (n = 2) and three-dimensional (n = 3) cases the paths to a few particular points have been computed using the first four described methods. The results are collected in the Tables 5.1 and 5.2. For each method the total number
5.3. EFFICIENCY OF THE ND-SYSTEMS APPROACH 73 of all stored points required for computing the requested point (i.e., the size of the path), the total number of floating point operations (flops) and the actual running time (in ms. obtained on a PC platform with an Intel Pentium PIV 2.8GHz processor and 512MB internal memory) are given for each requested point. Table 5.1: Two-dimensional case (2 × 2 initial state w 0,0 ) Requested point Linear Diagonal Equalizing Axis (0,10) Stored points 36 91 46 34 Flops 100 265 167 118 Cpu time (ms) 7 6 2 2 (0,50) Stored points 156 1431 546 154 Flops 460 4285 2181 718 Cpu time (ms) 32 23 25 8 (0,100) Stored points 306 5356 1921 304 Flops 910 16060 7697 1468 Cpu time (ms) 16 40 55 20 (10,10) Stored points 66 276 64 143 Flops 209 820 239 598 Cpu time (ms) 30 20 1 20 (50,50) Stored points 306 5356 304 1723 Flops 1009 16060 1199 7918 Cpu time (ms) 40 40 10 60 (100,100) Stored points 606 20706 604 5948 Flops 2009 62110 2399 27758 Cpu time (ms) 20 120 50 220 Table 5.2: Three-dimensional case (2 × 2 × 2 initial state w 0,0,0 ) Requested point Linear Diagonal Equalizing Axis (0,0,10) Stored points 120 560 159 88 Flops 344 2216 832 399 Cpu time (ms) 12 18 4 1 (0,0,50) Stored points 520 27720 4825 408 Flops 1544 110856 32328 2199 Cpu time (ms) 23 193 89 18 (0,0,100) Stored points 1020 192920 29808 808 Flops 3044 771656 214696 4449 Cpu time (ms) 32 1017 1875 33 (10,10,10) Stored points 320 7140 248 1868 Flops 1040 28536 1379 10565 Cpu time (ms) 20 40 1 20 (50,50,50) Stored points 1520 620620 1208 55348 Flops 5040 2482456 7079 351861 Cpu time (ms) 80 2774 60 2614 (100,100,100) Stored points 3020 4728720 2408 281948 Flops 10040 18914856 14204 1892839 Cpu time (ms) 50 265008 150 781646 From this experiment we may conclude the following: • The linear method indeed exhibits a linear complexity with respect to |t|. But in higher dimensions (e.g., n>10) the linear method may become inefficient because the simplex entirely covering the hypercube of initial values becomes very large. Although it constitutes a stable pattern associated with shifts in all
Page 3 and 4:
Stellingen behorende bij het proefs
Page 5 and 6:
ALGEBRAIC POLYNOMIAL SYSTEM SOLVING
Page 7 and 8:
ALGEBRAIC POLYNOMIAL SYSTEM SOLVING
Page 9:
For all those I love...
Page 12 and 13:
ii CONTENTS II Global Optimization
Page 14 and 15:
iv CONTENTS 12.2 Directions for fur
Page 17 and 18:
Chapter 1 Introduction 1.1 Motivati
Page 19 and 20:
1.3. RESEARCH QUESTIONS 5 The goal
Page 21 and 22:
1.4. THESIS OUTLINE 7 Jacobi-Davids
Page 23:
Part I General introduction and bac
Page 26 and 27:
12 CHAPTER 2. ALGEBRAIC BACKGROUND
Page 28 and 29:
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37: 22 CHAPTER 2. ALGEBRAIC BACKGROUND
Page 39 and 40: Chapter 3 Solving polynomial system
Page 41 and 42: 3.1. SOLVING POLYNOMIAL EQUATIONS I
Page 43 and 44: 3.2. METHODS FOR SOLVING POLYNOMIAL
Page 49 and 50: 3.3. THE STETTER-MÖLLER MATRIX MET
Page 51 and 52: 3.5. EXAMPLE 37 applying the Stette
Page 53: 3.5. EXAMPLE 39 be: I = 〈13x 2 2
Page 57 and 58: Chapter 4 Global optimization of mu
Page 59 and 60: 4.1. THE GLOBAL MINIMUM OF A DOMINA
Page 61 and 62: 4.3. AN EXAMPLE 47 Using the matric
Page 63 and 64: 4.3. AN EXAMPLE 49 the Stetter-Möl
Page 65 and 66: Chapter 5 An nD-systems approach in
Page 67 and 68: 5.1. THE ND-SYSTEM 53 cerned with t
Page 69 and 70: 5.1. THE ND-SYSTEM 55 Example 5.1.
Page 71 and 72: 5.1. THE ND-SYSTEM 57 Figure 5.2: T
Page 73 and 74: 5.3. EFFICIENCY OF THE ND-SYSTEMS A
Page 85: 5.3. EFFICIENCY OF THE ND-SYSTEMS A
Page 95 and 96: Chapter 6 Iterative eigenvalue solv
Page 97 and 98: 6.2. THE JACOBI-DAVIDSON METHOD 83
Page 99 and 100: 6.2. THE JACOBI-DAVIDSON METHOD 85
Page 101 and 102: 6.4. PROJECTION TO STETTER-STRUCTUR
Page 117 and 118: 6.5. A JACOBI-DAVIDSON METHOD FOR C
Page 119: 6.5. A JACOBI-DAVIDSON METHOD FOR C
Page 122 and 123: 108 CHAPTER 7. NUMERICAL EXPERIMENT
Page 136 and 137:
122 CHAPTER 7. NUMERICAL EXPERIMENT
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 145:
Part III H 2 Model-order Reduction
Page 148 and 149:
Page 150 and 151:
136 CHAPTER 8. H 2 MODEL-ORDER REDU
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 175 and 176:
Chapter 10 H 2 Model-order reductio
Page 177 and 178:
10.1. SOLVING THE SYSTEM OF QUADRAT
Page 179 and 180:
10.1. SOLVING THE SYSTEM OF QUADRAT
Page 181 and 182:
10.2. LINEARIZING A POLYNOMIAL EIGE
Page 183 and 184:
10.3. THE KRONECKER CANONICAL FORM
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
10.4. COMPUTING THE APPROXIMATION G
Page 195 and 196:
10.6. EXAMPLES 181 5. Compute the n
Page 197 and 198:
10.6. EXAMPLES 183 Figure 10.1: Spa
Page 199 and 200:
10.6. EXAMPLES 185 Figure 10.3: The
Page 201 and 202:
10.6. EXAMPLES 187 Figure 10.5: Imp
Page 203 and 204:
10.6. EXAMPLES 189 Figure 10.7: Str
Page 205 and 206:
10.6. EXAMPLES 191 Figure 10.8: Pol
Page 207 and 208:
10.6. EXAMPLES 193 Table 10.1: Redu
Page 209 and 210:
Chapter 11 H 2 Model-order reductio
Page 211 and 212:
11.2. LINEARIZING THE TWO-PARAMETER
Page 213 and 214:
11.3. KRONECKER CANONICAL FORM OF A
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
11.4. COMPUTING THE APPROXIMATION G
Page 237 and 238:
11.5. EXAMPLE 223 AãN−2 (ρ 1 ,
Page 239 and 240:
11.5. EXAMPLE 225 of both matrices
Page 241 and 242:
11.5. EXAMPLE 227 of solutions (ρ
Page 243 and 244:
Chapter 12 Conclusions & directions
Page 245 and 246:
12.1. CONCLUSIONS 231 used first. T
Page 247 and 248:
12.1. CONCLUSIONS 233 solver as des
Page 249 and 250:
12.2. DIRECTIONS FOR FURTHER RESEAR
Page 251 and 252:
Bibliography [1] W. Adams and P. Lo
Page 253 and 254:
BIBLIOGRAPHY 239 [26] A. Cayley. On
Page 255 and 256:
BIBLIOGRAPHY 241 [58] M.E. Hochsten
Page 257:
BIBLIOGRAPHY 243 [90] S. Prajna, A.
Page 261 and 262:
Appendix A A linearization techniqu
Page 263 and 264:
A.2. LINEARIZATION WITH RESPECT TO
Page 265 and 266:
A.3. EXAMPLE 251 The first step of
Page 267:
A.3. EXAMPLE 253 where the eigenvec
Page 270 and 271:
256 APPENDIX B. POLYNOMIAL TEST SET
Page 272 and 273:
258 SUMMARY vector. This routine is
Page 274 and 275:
260 SUMMARY globally optimal approx
Page 276 and 277:
262 SAMENVATTING De matrix-vrije im
Page 278 and 279:
264 SAMENVATTING eigenwaarde proble
Page 281 and 282:
List of Publications [1] I.W.M. Ble
Page 283 and 284:
List of Symbols and Abbreviations A
Page 285 and 286:
LIST OF FIGURES 271 7.7 Residual no
Page 287 and 288:
Index H 2 model-order reduction pro
show all

link to my thesis

Create successful ePaper yourself

Delete template?

Save as template?