Авторизация
Поиск по указателям
Hartmann A.K., Rieger H. — Optimization Algorithms in Physics
Обсудите книгу на научном форуме Нашли опечатку?
Название: Optimization Algorithms in PhysicsАвторы: Hartmann A.K., Rieger H. Аннотация: The past few years have witnessed a substantial growth in the number of applications for optimization algorithms in solving problems in the field of physics. Examples include determining the structure of molecules, estimating the parameters of interacting galaxies, the ground states of electronic quantum systems, the behavior of disordered magnetic materials, and phase transitions in combinatorial optimization problems.
Язык: Рубрика: Математика /Оптимизация и управление /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Год издания: 2002Количество страниц: 372Добавлена в каталог: 23.04.2005Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Pseudo node 242 PUBLIC 302 push-relabel algorithm 107 q 125 Quality of fit 342 Quantum dots 172 Quantum Monte Carlo algorithm 266 Quantum system, one-dimensional 172—175 Quenched disorder 3 87 92 186 324 QUEUE 41 321 Queue, implementation 44 Queue, priority 41 Random access machine 13 Random bond ferromagnet 87 Random elastic medium 96 Random fuse network 96 Random graph 275 Random number generator 324—331 Random resistor network 61 Random-bond ferromagnet 98 Random-bond system 190 Random-field Ising magnet 91 92—96 99 115 121—125 192 260 Random-walk algorithm 255 Raytracer 353 RCS 297 readme 300 Realization 92 Reciprocal lattice 139 Recognition problem 16 23 Recurrence equation 28—30 Recursion 27 30 Reduced costs 64 67 133 135 143 244 Reduced costs, optimality theorem 144 Reduced edge length 67 Reduced graph 117 118 Rejection method 328—330 Relative velocity 179 Remove operation 41 Renormalization-group theory 81 Replica 212 Reproduction 159 Residual costs 140 Residual graph 103 Residual network 103 105 108 134 Return statement 11 Reversed topological order 109 Revision Control System 297 RFIM 92—96 99 115 121—125 192 260 Right son 40 Right subtree 40 RKKY interaction 188 Root 39 Rough surface 136 Roughness 149 Running time 17 Running time, worst case 17 Rutile 92 s-t cut 96 SAT 19—22 23 25 273 Satisfiability problem 19—22 23 25 273 Satisfiable formula 19 SAW 262 Scaling function 85 Scaling plot 85 123 Scaling relation 81 85 SCC 38 116 Schroedinger equation 172 SCI 348 Science Citation Index 348 Scientific journals 348 Screening length 139 Script 293 317—319 Search in a tree 48—49 Search, engine 349 Search, tree 39 Second order transition 78 Secondary structure 270 segmentation fault 334 Self-averaging 88 Self-avoiding walk 262 Semiconductor 172 Sequential algorithm 27 Set 321 Sherrington — Kirkpatrick model 190 220 Shortest path 63 107 132 Shortest path, algorithm 61—68 Shortest path, properties of 64 Shubnikov phase 129 Simplex algorithm 236 Simulated annealing 78 194 257—259 296 Simulation, molecular dynamics 298 Simulation, Monte Carlo 76 94 191 207 209—211 252 270 Sine — Gordon model 137 Singly connected edges 59 Sink 42 96 102 Size of cluster 54 Size of input 16 SK model 190 Small tasks 295 Social system 186 Software, cycle 300 software, development 294 Software, engineering 293—300 Software, reuse 294 303 Solid-on-solid model 136—138 150—154 Son 39 Son, left 40 Son, right 40 Sorting 28 Sos 136—138 150—154 Source 42 96 102 Source-code debugger 297 332 Source-code management system 296 Spanning forest 58 Spanning tree 58 Sparse graph 46 301 Specific heat 75 85 187 288 Spin 73 80 87 91 179 Spin glass 3—4 25 26 185—192 296 324 338 343 Spin glass, algorithms 192—202 208—219 Spin glass, computational results 203—208 219—222 Spin glass, experimental results 187—190 Spin glass, four-dimensional 202 Spin glass, theoretical approaches 190—192 Spin glass, three-dimensional 199 202 219 Spin glass, two-dimensional 194 199 202 227 250—252 Spin, free 192 210 218 Spin, XY 76 Square lattice 312—314 STACK 41 295 321 Stack, frame 337 Stack, implementation 44 Staggered magnetization 95 Standard error bar 78 Statement, assignment 10 Statement, cases 10 Statement, comment 12 Statement, for 10 Statement, goto 11 Statement, miscellaneous 12 Statement, return 11 Statistical physics 73—90 Steepest descent algorithm 170 Step function 173 Stiffness energy 205 251 Stiffness exponent 207 Stock market 186 String 321 Strongly-connected component 38 116 struct 295 style 306—310 Subgraph 37 Subtree 39 Subtree, left 40 Subtree, right 40 Successive-shortest-path algorithm 135 139 Successive-shortest-path algorithm, time complexity 147 Super-rough surface 137 Superconductor 129 137 138 Superexcharige interaction 92 189 Surface, rough 136 Surface, super-rough 137 susceptibility 75 84 187 188 288 Susceptibility, dynamic 187 Swap configurations 260 Symmetric difference 231 Tail of edge 38 Tail of list 41 TARGET 314 Tasks 295 Technique, diagonalization 13—16 Temperature 74 79 Temperature, zero 75 Testing 297 testing, tools 331—338 TeX 349 Theorem, augmenting path 231 Theorem, central limit 330 Theorem, Edmonds 242 Theorem, matching polytope 244 Theorem, negative-cycle 141 Theoretical approaches for spin glasses 190—192 Thermal expectation value 74 Theta point 264 Three-dimensional spin glass 202 Three-dimensional spin glasses 199 219 Threshold accepting 256 TIFF 352 Time complexity 16—19 Time complexity, Dinic's algorithm 107 Time complexity, Ford — Fulkerson algorithm 105 Time complexity, Hungarian algorithm 239 Time complexity, maximum-cardinality matching 234 Time complexity, minimum-weight perfect matching 249 Time complexity, N-line algorithm 135 Time complexity, negative-cycle-canceling algorithm 143 Time complexity, non-bipartite matching 242 Time complexity, successive-shortest-path algorithm 147 Time complexity, vertex cover 288 Time complexity, wave algorithm 107 Time evolution of population 170 Top down approach 295 Topological order 108 Topological order, reversed 109 tqli() 321 Transfer matrix 194 Transformation, gauge 95 Transformation, network 96—102 Transition probability 76 Transition, continuous 78 Transition, discontinuous 78 Transition, first order 79 Transition, second order 78 Traveling salesman problem 2—3 12—13 25 26 42 51 195 Traveling salesman problem, heuristic 12—13 17—18 tred2() 321 TREE 39—41 48 321 Tree, alternating 231 Tree, balanced 49 Tree, binary 40 279 Tree, complete 41 Tree, depth-first spanning 59 Tree, height 39 Tree, implementation 45—46 Tree, minimum spanning 69 Tree, search 39 Tree, spanning 58 Tree, subtree 39 Triadic crossover 199 Truth table 20 TSP 2—3 12—13 25 26 42 51 195 TSP, heuristic 12—13 17—18 Turing machine 13 Two-dimensional spin glass 194 199 202 227 250—252 Typical-case complexity 273 Ultrametricity 191 Unbounded disorder 150 UNITS 179 Universality 80 87 123 124 Universality in disordered systems 89 Universality, class 87 UNIX 293 310 335 Upper bound 17 276 Valley 210 221 Valley, size 216—218 221 Vapor 78 Variable 306 Variable, Boolean 19 Variable, global 307 VC 273 Vector potential 139 154 Vertex 37 228 295 Vertex cover 51 273 274—291 Vertex cover, 276 289 Vertex cover, analytical result 276 Vertex cover, heuristic 277 Vertex cover, minimum 275 Vertex cover, results 287—291 Vertex cover, time complexity 288 Vertex, adjacent 37 Vertex, balanced 109 Vertex, blocked 110 Vertex, covered 228 Vertex, degree 295 Vertex, exposed 228 Vertex, father 39 Vertex, free 228 286 Vertex, isolated 37 Vertex, M-exposed 228 Vertex, matched 228 Vertex, neighbor 37 Vertex, overflowing 109 Vertex, sink 42 Vertex, son 39 Vertex, source 42 Vortex glass 138—139 154—155 Water 78 Wave algorithm 107—115 121 Wave algorithm, time complexity 107 Wave function 172 Weakly fluctuating region 150 Weighted matching 229 While loop 10 Worst case running time 17 X-ray data 163 XFIG 351—353 xmgr 340 XY model 138 XY spin 76 Yahoo 349 Yes-instance 22 23 Zero temperature 75
Реклама
RFIM 
|
|
О проекте