Авторизация
Поиск по указателям
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
Предметный указатель
density 78 Density, distribution 179 Dependency 315 Depth-first search 57—59 Depth-first spanning tree 59 Derived graph 245 Descendant 39 destructor 305 Detailed balance 76 Diagonalization technique 13—16 DICTIONARY 321 Differential equation 319 Dijkstra's algorithm 63—67 70 Diluted antiferromagnet 192 Diluted antiferromagnet in a field 91 92—96 121—125 Diluted lattice 53 Dimensionless ratio 85 Dimer covering 229 Dinic's algorithm 107—115 Dinic's algorithm, time complexity 107 Dipolar interactions 189 Directed graph 37 47 96 102 Directed polymer 51 61—63 129 Discontinuous transition 78 Discrete optimization problem 2 Disjunction 19 Dislocation pair 151 Disorder 187 Disorder, columnar 137 Disorder, frozen 3 Disorder, quenched 3 324 Disorder, unbounded 150 Disordered system 87—90 Distance label 68 Distributing work 296 Distribution of overlaps 125 191 192 219 Distribution, bimodal 88 92 186 Distribution, binary 88 Distribution, density 179 Distribution, exponential 328 Distribution, Gaussian 92 186 222 330—331 Distribution, joint 89 Distribution, normal 330 Divergence 133 139 Divide-and-conquer algorithm 281—282 Divide-and-conquer principle 30 31 Documentation 299 Domain 124 Domain state 95 Domain wall 154 205 Domain wall, renormalization group analysis 154 Doppler shift 178 Double linked list 45 DPRM 62 Droplet picture 191 195 219 DS 95 Dual linear problem 236 Duality 236 DWRG 154 Dynamic programming 31 Dynamic susceptibility 187 EA model 186 EC problem 50 EDGE 37 228 Edge, cover 50 Edge, free 228 Edge, head 38 Edge, incoming 38 Edge, inner 96 Edge, matched 228 Edge, outgoing 38 Edge, phantom 101 Edge, singly connected 59 Edge, tail 38 Edmonds theorem 242 Edwards — Anderson model 186 Eigenvalue 320 Elastic medium 96 Electron 173 Element of list 41 Ellipsoid algorithm 236 Energy 75 Energy conservation 298 Energy, free 74 Energy, internal 74 Enrichment 264 Ensemble, Canonical 74 Ensemble, microcanonical 74 entropy 206 Entropy, Boltzmann 75 Entropy, ground-state 192 Enumeration problem 229 Ergodic 209 Error bar 78 299 342 Euler cycle 50 Even level 233 Excess 109 143 Excess node 145 Excitation 154—155 Excited state 221 Expand-update procedure 247 expectation value 74 Experimental results for spin glasses 187—190 Exponent, 85 Exponent, 54 80 81 84 123 Exponent, 84 Exponent, 81 84 Exponent, 123 252 Exponent, 81 Exponent, 81 Exponent, 207 251 Exponent, critical 54 Exponent, stiffness 207 Exponential distribution 328 External field 74 Factorial 27 Father 39 FC 95 Feasible flow 14 Feasible solution 2 Feasible vector 235 Ferromagnet 3 185 204 250 Ferromagnetic interactions 4 91 Ferromagnetic phase 84 FH 95 Fibonachi numbers 30—32 Field, cooling 95 Field, external 74 Field, heating 95 FIFO implementation 68 FIFO list 41 FIND operation 48 Finite graph 37 Finite-size scaling 81 83—84 203 289 343—346 First order transition 79 Fit parameters 85 Fitness 161 Fitness function 173 180 Fitting 340—343 Fitting, quality of 342 Flow 42 102 105 133 Flow, blocking 107 Flow, conservation 43 103 Flow, feasible 141 Flow, infeasible 143 Flow, maximum 43 106 192 Flow, minimum-cost 43 68 Flow, negative 43 Flow, pseudo 143 Flow-augmentation lemma 145 Fluctuations 75 Flux 155 Flux line 138 Flux line, array 147—150 Flux line, problem 147—150 For loop 10 Ford — Fulkerson algorithm 102—107 Ford — Fulkerson algorithm, time complexity 105 Forest-fire algorithm 54 57 Formula, Boolean 19 Formula, satisfiable 19 FORTRAN 293 300 Forward wave 110 Four-dimensional spin glass 202 Fourier transform 319 Fractal 54 95 Fractal dimension 81 Free energy 74 78 Free spin 192 210 218 Free vertex 228 286 Frozen disorder 3 Frustration 187 194 227 fsscale 345—346 Function, computable 15 Function, convex 136 Function, partial 13 GA 159 Galaxy 178 Gas 78 Gauge transformation 95 193 Gaussian distribution 92 186 330—331 gdb 332—334 GEATbx 164 Generalized Rosenbluth method 263 Genes 159 Genetic algorithm 159—183 195 199—202 Genetic algorithm, applications 163 Genetic algorithm, data structures 161 Genetic algorithm, example 164—171 Genetic algorithm, general scheme 163 Genetic algorithm, representation 160 161 164 173 179 Genetic and Evolutionary Algorithm Toolbox 164 Geological structures 163 Glass 87 Global variable 307 GNU project 297 gnuplot 204 338—340 gnuplot, finite-size scaling 344 gnuplot, script 338 Gold 187 GOTO statement 11 307 Graph 37—38 96 228 295 321 Graph algorithms 53—70 Graph algorithms in LEDA 321 Graph, bipartite 229 231—241 Graph, connected 37 Graph, cover 50 Graph, derived 245 Graph, directed 37 47 102 Graph, finite 37 Graph, implementation 46—48 Graph, labeled 42 48 Graph, network 42 Graph, planar 227 Graph, random 275 Graph, reduced 117 118 Graph, representation 44—48 Graph, residual 103 Graph, sparse 46 301 Gravitational force 180 Greedy cover algorithm 278 Green's function 139 Ground state 4 62 89 91 94 102 116 129 139 151 152 154 160 172 192 199 202 219 220 228 250—252 266 Ground state, degenerate 4 Ground state, energy 203 219 338 Ground state, landscape 192 207 219 Ground state, number of 124 Ground states all 115—121 Growth front 65 70 Halting problem 16 Hamilton cycle 50 Hamiltonian 62 74 80 87 92 94 98 129 133 136 138 139 186 193 196 255 Harmonic potential 175 HC problem 50 Head of edge 38 Head of list 41 header file 306 311 Heap 41 66 Heap Dijkstra algorithm 67 Heap, implementation 45 Heat bath 74 Height of tree 39 Heuristic 198 Heuristic, traveling salesman problem 12—13 17—18 Heuristic, vertex cover 277 Hierarchy of calls 27 29—31 histogram 303 Hoshen — Kopelman algorithm 54—57 Householder transformation 321 Hungarian algorithm 235 237—241 Hungarian algorithm, time complexity 239 Hyper scaling relation 82 implementation 297 Implementation, graphs 46—48 Implementation, heaps 45 Implementation, lists 44—45 Implementation, trees 45—46 Importance sampling 76 Incoming edge 38 Individual 199 Infeasible flow 143 Inner edge 96 Inner vertex 96 Input 294 Input, size of 16 INSERT operation 41 49 INSPEC 163 347 Integration 319 Interaction, antiferromagnetic 4 91 Interaction, ferromagnetic 4 91 Interaction, superexchange 92 INTERFACE 301 Internal energy 74 Interpolation 319 Invasion algorithm 54 70 Inversion method 327—328 Irreversibility 95 Ising model 73 79 84 87 92 93 185 204 Isolated node 37 Ispell 351 Joint distribution 89 JPEG 352 k-SAT 19—22 23 273 Kraskal's algorithm 69 70 Label-correcting algorithm 67—68 Label-setting algorithm 63 Labeled graph 42 48 Labeling 42 Lambert-W-function 276 Laser 163 Laser, pulses 175 Lattice 81 87 Lattice, diluted 53 Lattice, gauge theory 163 Lattice, square 312—314 Leaf 39 Leath algorithm 54 57 LEDA library 26 47 64 294 295 321—323 Left son 40 Left subtree 40
Реклама
|
|
О проекте