Авторизация
Поиск по указателям
Hartmann A.K., Rieger H. — Optimization Algorithms in Physics
Обсудите книгу на научном форуме
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: 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.
This book serves as an introduction to the field, while also presenting a complete overview of modern algorithms. The authors begin with the relevant foundations from computer science, graph theory and statistical physics, before moving on to thoroughly explain algorithms - backed by illustrative examples. They include pertinent mathematical transformations, which in turn are used to make the physical problems tractable with methods from combinatorial optimization. Throughout, a number of interesting results are shown for all physical examples. The final chapter provides numerous practical hints on software development, testing programs, and evaluating the results of computer experiments.
Язык:
Рубрика: Математика /Оптимизация и управление /
Статус предметного указателя: Готов указатель с номерами страниц
ed2k: ed2k stats
Год издания: 2002
Количество страниц: 372
Добавлена в каталог: 23.04.2005
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Length of path 37
Level, even 233
Level, network 107
Level, odd 233
Library 294 295 319—324 347
Library, create 323—324
Library, LEDA 26 47 64
LIFO list 41
Linear congruential generators 325
Linear equation 319
Linear fitness ranking 182
Linear program 235
Linux 293 297 310
Liquid 78
LIST 41—42 295 321
List, adjacency 46
List, double linked 45
List, element 41
List, FIFO 41
List, head 41
List, implementation 44—45
List, LIFO 41
List, operations 321
List, pointer implementation 44
List, tail 41
Literal 19
Literature databases 347
Local field 195
Local minimum 256
Local optimization 162 170
LOGFILE 300
Longitudinal excursion 149
Loop, FOR 10
Loop, WHILE 10
Lower bound 276
lp 235
M-exposed vertex 228
Machine, random access 13
Machine, Turing 13
Macro 296 310—314
magnetization 74 75 84 121 250 343
make 314—317
makefile 297 314—317
man page 314 323
Maple 319
Markov process 76
Mass 179
Mass of cluster 83
Mass-balance constraint 139
Master equation 76
Matching 228—230 231
Matching algorithm 194 231—250
Matching Polytope Theorem 244
Matching, maximum-cardinality 228 234
Matching, maximum-weight 229
Matching, non-bipartite time complexity 242
Matching, perfect 228
Matching, weighted 229
Mates 229
Mathematical description of an optimization problem 2
MATLAB 164
Matrix, adjacency 46
Matrix, diagonalization 319
Maximization problem 2
Maximum flow 43 103 106 192
Maximum-cardinality matching 228 234
Maximum-cardinality matching, time complexity 234
Maximum-Flow Algorithm 143
Maximum-flow problem 234
Maximum-weight matching 229
Mean-field model 191 219
Memory allocation 335
Memory leak 337
Mergesort 30
Meta rule 315
Meteorology 163
method see "Algorithm"
Methods for objects 300
Mf 191
microcanonical ensemble 74
Minimization problem 2
Minimum cut 99 101 115
Minimum cuts, all 115—121
Minimum edge cover 50
Minimum spanning tree 69
Minimum spanning tree, algorithm 68—70
Minimum vertex cover 275
Minimum-cost flow 43 68
Minimum-cost path 63
Minimum-cost-flow algorithm 139—147
Minimum-cost-flow problem 139 235
Minimum-weight perfect matching 235—250
Minimum-weight perfect matching, algorithm 242—250
Minimum-weight perfect matching, time complexity 249
Miscellaneous statement 12
Model, Edwards — Anderson 186
Model, Ising 73 79 84 87 92 93 204
Model, mean-field 191
Model, random-field 92—96 192
Model, Sherrington — Kirkpatrick 190 220
Module 297 306
Module, comment 308
Molecular dynamics simulation 298
Momentum conservation 298
Monomer 263 267
Monte Carlo algorithm 77 255—270
Monte Carlo optimization 78
Monte Carlo simulation 76 94 191 207 209—211 252 270
Multi-canonical ensemble 260
Mutation 159 161 201
Mutation, operation 166 173 182
N-line algorithm 135
N-line problem 129—135 138
N-queens problem 32—33
Negation 19
Negative costs 132
Negative cycle 68 132
Negative flow 43
Negative-cycle theorem 141
Negative-cycle-canceling algorithm 68 141—143
Negative-cycle-canceling algorithm, time complexity 143
Neighbor node 37
Neighbour configurations 210
Network 42 96—102 129 192
Network, level 107
Network, random fuse 96
Network, random resistor 61
Network, residual 103 105 108 134
Neural network 186 195
Neutron scattering 187
Node 31
Node potential 132 134 143
Node, adjacent 37
Node, father 39
Node, isolated 37
Node, neighbor 37
Node, sink 42
Node, son 39
Node, source 42
Nondeterministic algorithm 23
Nondeterministic polynomial 22
Nonlinear equation 319
Normal distribution 330
NOT operation 19
NP 22
NP-complete 19—26 50
NP-complete, graph problem 50—51
NP-hard 25 163 185 194 220 228 273 274
Nuclear reactions 163
Number of ground states 124
Number-partitioning problem 273
Numerical Recipes 294 319—321
Object 294 300—306
Object-Oriented Programming 300—306
Odd cut 243
Odd level 233
Offset 136
Offspring 161 199
One-dimensional quantum system 172—175
Operation 295
Operation, AND 19
Operation, basic 296
Operation, boolean 19
Operation, crossover 166 173 182
Operation, find 48
Operation, insert 41 49
Operation, mutation 166 173 182
Operation, NOT 19
Operation, OR 19
Operation, remove 41
Operator overloading 302
Optimization algorithms 5
Optimization algorithms, applications of 1—2
Optimization problem, combinatorial 2
Optimization problem, discrete 2
Optimization problem, mathematical description 2
Optimization, Monte Carlo 78
OR operation 19
Orbital parameters of galaxies 178—183
Order parameter 78 84 138
Orthogonality conditions 237
Outgoing edge 38
Overflowing vertex 109
Overlap 125 191
P 22 25 50 91
P(q) 125
Parallel tempering 260—262
Paramagnet 80 94
Paramagnetic phase 84
Parameters 294
Parent 161 199
Partial function 13
Partition function 74 229
Pascal 293 300
Path 37
Path, alternating 229 230
Path, augmenting 103 105 107 230 232—234 242
Path, closed 37
Path, length of 37
Path, minimum cost 63
Path, shortest 63 107 132
Path-optimality condition 69
PDF 348
Percolating cluster 82
Percolation 53—61 81—84 275
Perfect matching 228
Periodic boundary conditions 205
Perl 318
Perm 255
PERM procedure 265
Phantom edge 101
phase diagram 78 94 276
Phase transition 2 4 78—81 84 136 187 273
Phase transition, continuous 78
Phase transition, discontinuous 78
Phase transition, first order 79
Phase transition, second order 78
Phase, ferromagnetic 84
Phase, paramagnetic 84
Phys Net 349
phyton 318
Pidgin algol 9—12 13 17
Pidgin Algol, assignment 10
Pidgin Algol, cases 10
Pidgin Algol, comment 12
Pidgin Algol, conditions 10
Pidgin Algol, for loop 10
Pidgin Algol, goto 11
Pidgin Algol, miscellaneous statement 12
Pidgin Algol, procedures 11
Pidgin Algol, return 11
Pidgin Algol, while loop 10
Planar graph 227
plaquette 227
PM 94
Point defect 151
Pointer implementation, lists 44
Pointer implementation, trees 45
Polymer 262
Polymer, directed 51
Polynomial 22
Polynomial-time reducible 23
Polytope 236
Population 160 199
Population, time evolution 170
Post processing 209
PostScript 340 348 351—353
Potential lemma 144
Povray 353—355
Preflow 109
Preprint server 347
Pressure 79
Prim's algorithm 69 70
Primal linear problem 236
Primal-dual algorithm 239
Principle, backtracking 32
Principle, divide-and-conquer 30 31
Priority queue 41 66
PRIVATE 301
probability density 330
Problem enumeration 229
Problem, assignment 235
Problem, convex minimum-cost-flow 136—139
Problem, correctness 16
Problem, decidable 16
Problem, EC 50
Problem, flux-line 147—150
Problem, graph 50—51
Problem, halting 16
Problem, HC 50
Problem, maximum-flow 234
Problem, minimum-cost-flow 139 235
Problem, N queens 32—33
Problem, N-line 129—135 138
Problem, NP-complete 50—51
Problem, number-partitioning 273
Problem, provable 16
Problem, recognition 16 23
Problem, satisfiability 19—22 23 25 273
Problem, sorting 28
Problem, traveling salesman 2—3 12—13 25 26 42 51 195
Problem, vertex-cover 273 274—291
procedural programming 300
Procedure, bit-sequence 165
Procedure, change-y 247
Procedure, crossover 166
Procedure, expand-update 247
Procedure, extend-alternating-tree 233
Procedure, local optimization 170
Procedure, mutation 166
Procedure, PERM 265
Procedures 11
Programming, dynamic 31
Programming, style 306—310
Programming, techniques 26—34
Properties of shortest paths 64
Protein folding 266—270
Provable problem 16
Prune-enriched Rosenbluth method 262—270
Pseudo flow 143
Реклама