Авторизация
Поиск по указателям
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
Предметный указатель
"Go with the winners" strategy 266 #define 310 #ifdef 311 #ifndef 311 187 54 81 92—93 190 187 188 92—93 189 89 17 54 81—84 54 190 92 78 80 84 136 95 189 85 54 80 81 84 123 81 81 84 123 84 54 81 84 349—351 23 54 82 123 252 81 81 155 262 207 251 54 82 84 -D option 311 -help option 299 -Wall option 298 1-SAT algorithm 21 2-CNF 20 3-CNF 20 3-SAT 22 23 Adjacency list 46 Adjacency matrix 46 Adjacent node 37 Aging 187 190 Algorithm 9 Algorithm for spin glasses 192—202 208—219 Algorithm, 1-SAT 21 Algorithm, approximation for 2d spin glasses 250 Algorithm, bit-sequence 165 Algorithm, branch-and-bound 194 282—287 Algorithm, branch-and-cut 194 Algorithm, breadth-first search 59—61 104 108 115 231—234 Algorithm, build-cluster 196 Algorithm, burning 54 57 Algorithm, certificate checking 22 Algorithm, cluster 77 Algorithm, conjugate gradient 170 Algorithm, cycle canceling 142 Algorithm, decision 20 Algorithm, depth-first search 57—59 Algorithm, Dijkstra's 63—67 70 Algorithm, Dinic's 107—115 Algorithm, divide-and-conquer 281—282 Algorithm, ellipsoid 236 Algorithm, extend-alternating-tree 233 Algorithm, factorial 27 Algorithm, fibonachi 32 Algorithm, find 48 Algorithm, Ford — Fulkerson 102—107 Algorithm, forest-fire 54 57 Algorithm, generalized Rosenbluth 263 Algorithm, genetic 159—183 195 199—202 Algorithm, graph 48—49 53—70 Algorithm, greedy cover 278 Algorithm, Hoshen — Kopelman 54—57 Algorithm, Hungarian 235 237—241 Algorithm, invasion 54 70 Algorithm, Kruskal's 69 70 Algorithm, label-setting 63 Algorithm, Leath 54 57 Algorithm, local optimization 170 Algorithm, matching 194 231—250 Algorithm, maximum-flow 143 Algorithm, mergesort 30 Algorithm, minimize-function 167 Algorithm, minimum spanning tree 68—70 Algorithm, minimum-cost-flow 139—147 Algorithm, minimum-weight perfect matching 242—250 Algorithm, Monte Carlo 77 255—270 Algorithm, N queens 33 Algorithm, N-line 135 Algorithm, negative-cycle-canceling 68 141—143 Algorithm, nondeterministic 23 Algorithm, optimization 5 Algorithm, parallel tempering 260—262 Algorithm, Prim's 69 70 Algorithm, primal-dual 239 Algorithm, prune-enriched Rosenbluth 262—270 Algorithm, push-relabel 107 Algorithm, quantum Monte Carlo 266 Algorithm, random-walk 255 Algorithm, sequential 27 Algorithm, shortest path 61—68 Algorithm, simplex 236 Algorithm, simulated annealing 194 257—259 Algorithm, sorting 29 Algorithm, steepest descent 170 Algorithm, successive-shortest-path 135 139 Algorithm, threshold accepting 256 Algorithm, wave 107—115 121 All ground states 115—121 All minimum cuts 115—121 Alta Vista 349 Alternating path 229 230 Alternating tree 231 American Physical Society 349 Amino acid 266 Amorphous conductor 53 Ancestor 39 AND operation 19 Antiferromagnet 185 250 Antiferromagnetic interactions 4 91 Antiperiodic boundary conditions 205 Applications of optimization methods 1—2 Approximation algorithm for 2d spin glasses 250 APS 349 Arbitrary precision 321 ARC 37 Array 295 321 334 Array implementation of heaps 45 ASSIGNMENT 10 19 20 Assignment problem 235 Astronomy 179 Asymptotic behavior 17 Augmenting path 103 105 107 230 232—234 242 Augmenting path theorem 231 Autocorrelation function 78 awk 346 Backbone 275 290 Backtracking 32 242 Backward wave 110 Balance constraint 151 Balanced tree 49 Balanced vertex 109 Ballistic search 208—219 Base 242 Basic graph algorithms 48—49 Basic operations 296 Behavior, asymptotic 17 BFS 59 104 115 231—234 Biconnected component 59 Bimodal distribution 88 92 186 binary distribution 88 Binary representation 161 164 Binary tree 40 279 Binder cumulant 85 Biot — Savat law 138 Bipartite graph 229 231—241 Bit-sequence procedure 165 Bitmap 352 Blocked vertex 110 Blocking flow 107 Blossom 242 Blossom shrinking 242 245 Boltzmann constant 74 Boltzmann distribution 74 Boltzmann entropy 75 BOND 37 61 186 Boolean assignment 19 20 Boolean formula 19 Boolean operation 19 Boolean variable 19 Bottom up approach 295 Bound 282 Bound, lower 276 Bound, upper 17 276 boundary conditions 251 Boundary conditions, antiperiodic 205 Boundary conditions, periodic 205 Branch-and-bound algorithm 194 282—287 Branch-and-cut algorithm 194 Breadth-first search 59—61 104 108 115 231—234 BS 212 Bucket 67 70 Burgers charge 151 Burning algorithm 54 57 C programming language 293 300 canonical ensemble 74 Capacity 96 102 Capacity of cut 97 Capacity, constraint 43 129 140 Capsuling 301 Cases statement 10 CC 22 CEA 195—197 207 209 219 Center of mass 179 Central limit theorem 330 Certificate checking algorithm 22 Change-y procedure 247 Chaos 252 Checkerboard fashion 94 96 Checkergcc 334—338 Church's thesis 13 Citation database 348 class 295 297 300 Class, histo 303 Class, NP 22 Class, P 22 Clause 19 clean 316 Closed path 37 Cluster 55 81 195 Cluster, algorithm 77 Cluster, mass 83 Cluster, percolating 82 Cluster, size 54 Cluster-exact approximation 192—202 207 209 219 CNF 19 Columnar defect 147 Columnar disorder 137 Combinatorial optimization problem 2 comment 12 299 308—310 318 Complete tree 41 Component, biconnected 59 Component, connected 37 57 Component, strongly connected 116 Component, strongly-connected 38 Computable function 15 Condition 10 Conductor 53 Configuration file 294 Conjugate gradient algorithm 170 Conjunction 19 Conjunctive normal form 19 Connected component 37 57 Connected graph 37 Connectivity percolation 53—61 Conservation of energy 298 Conservation of flow 43 103 Conservation of momentum 298 const 298 Constraint 2 Constraint, capacity 43 constructor 305 Contact matrix 270 Continuous transition 78 Convex function 136 140 Convex minimum-cost-flow problem 136—139 Cooling 257 Cooling protocol 259 Correctness problem 16 Correlation 1-function 84 Correlation function 252 correlation length 54 82 84 252 Correlation time 78 costs 53 63 Costs, negative 132 Costs, reduced 64 133 135 143 244 Costs, residual 140 Cover 50 Cover, edge 50 Cover, minimum edge 50 Cover, vertex 51 Critical behavior 80 Critical, exponent 54 80 81 Critical, point 78 Crossover 161 Crossover, operation 166 173 182 Crossover, triadic 199 Crystal 257 Curve fitting 340—343 Cut, capacity of 97 Cut, minimum 99 101 115 Cut, odd 243 Cut, optimality condition 69 Cut, s-t 96 Cutoff 175 Cycle, canceling algorithm 142 Cycle, Euler 50 Cycle, Hamilton 50 Cycle, negative 53 68 132 DAFF 91 92—96 121—125 192 Data analysis 338—346 Data capsuling 301 Data collapse 85 123 Data Display Debugger (ddd) 334 Data structures 295 301 Debugging 297 332 debugging tools 331—338 Decidable problem 16 Decision algorithm 20 Deficit 143 Deficit node 145 Degeneracy 4 91 116 122 208 228 269 Degree 37 Degree of freedom 342 Delta-peak 221
Реклама
notation 
|
|
О проекте