Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Fishman G.S. — Monte Carlo: concepts, algorithms, and applications
Fishman G.S. — Monte Carlo: concepts, algorithms, and applications



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Monte Carlo: concepts, algorithms, and applications

Автор: Fishman G.S.

Аннотация:

This volume presents a comprehensive first course in the Monte Carlo method which will be suitable for graduate and undergraduate students in the mathematical sciences and engineering, principally in operations research, statistics, mathematics, and computer science. The reader is assumed to have a sound understanding of calculus, introductory matrix analysis, probability, and intermediate statistics, but otherwise the book is self-contained. As well as a thorough exploration of the important concepts of the Monte Carlo method, the volume includes over 90 algorithms which allow the reader to move rapidly from the concepts to putting them into practice. The book also contains numerous exercises, many of them hands-on implementations of selected algorithms to demonstrate the application of these ideas in realistic settings. Software, freely available via ftp and portable across computing platforms, provides programs for pseudorandom number generation and statistical sample path data analysis. The software is suitable for use with the exercises as well as for more general applications. For professional mathematical scientists and engineers this book provides a ready reference to the Monte Carlo method, especially to implementatable algorithms for performing sampling experiments on a computer and for analyzing their results.


Язык: en

Рубрика: Математика/Вероятность/Статистика и приложения/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1996

Количество страниц: 698

Добавлена в каталог: 29.05.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Exponential distribution      151 162 193
Failing edges      83
Fast Fourier Transform      541
Fault tree      367
Feasible solution      79 90
Feedback shift register      650
Feedback shift register generators      649—670 677
FFT      541
Field      646
File Transfer Protocol (FTP)      10 565 582 603 667
Finding primitive roots      593
Finite difference equation      2
First passage time      368—371
FNB rule      546—572 582
Fourier analysis, multivariable      613
Fourier transform      536
Fredholm equations of the second kind      352 358—363 476
Frequency domain      535
FSR sequence      649 650 662 664 670
Full period      593 676
Fundamental matrix      579
Galois field      646 649 671
Gamma distribution      181 193—201 246 250 325 410
Gamma function      55
General position      233
General state space models      403
Generalized Dirichlet problem      2
Generalized feedback shift register generators      588 590 658 678
Geometric distribution      153 221—222 249
GFSR generator      659 661—662 670
GFSR sequence      664 667—668
GFSR sequence initializing      661—667 678
Gibbs distribution      398—401
Gibbs sampler      407
Gibbs sampling      402—403 409 477 487
Gibbs sampling approach      411
Global balance      6 408 584
Global behavior      336
Global conductance      426 433
Global equilibrium      513
GPSS/H      356
Ground set      78—80 82 84
Guarantee      443
Half-duplex      517
Half-normal distribution      172 182
Hammersley — Clifford theorem      399
Hands-on experimentation      9
Hardy and Krause      66
Harris recurrence      342—343
Hypercubical lattice      15
Hyperellipsoid      234—235 249
Hypergeometric distribution      153 200 218—221 249
Hyperrectangular bounds      40
Hypersphere      5
I.I.D. sequences      533
IBM 3090      565
IBM computers      600 602 603
IBM PS/2 Model      70 386 565
IBM Scientific Subroutine Library      619
IBM-compatible personal computers      11
Idempotent      402
implementation      602—607 676
Importance function      257
Importance sampling      5 257—277 325 328 366
Importance sampling, converting unboundedness to boundedness      259—261
Importance sampling, exceedance probability      325
Importance sampling, exponential change of measure      265—269
Importance sampling, Gamma distribution      325
Importance sampling, importance function      257
Importance sampling, M/M/1 exceedance probability      274—277
Importance sampling, Poisson distribution      326
Importance sampling, random stopping times      269—273
Importance sampling, random summations      269—273
Importance sampling, sequential probability ratio test      275—277 325
Importance sampling, type II error      325
Importance sampling, union counting problem      261—265
Increasing number of batches      545—546 581
Independence      147
Independent experiments      130
Indeterminate      646
Initial condition      340 494 507
Initial state      494 513—515 580
Initial-value problem      336
Initializing distribution      520
Initializing nonequilibrium distribution $\pi_0$      493
interaction energy      401
Interim review      547
Interior sites      412
Intersection      79 80 85
Interval estimates      513
Interval estimator      14
INTLZ subroutine      667—669
Invariant p.m.f.      339
Inverse distribution function      149—160 162
Inverse-transform method      149—160 162 201 242
Investment decision      135
Irreducible      339
Irregularity      589
Isoperimetric inequality      443
j-step linear recurrence      645—649
k-dimensional discrepancy      671
k-distributed      647 662 670
King's moves      434—435
Kolmogorov — Smirnov distribution      105 107 629
Kurtosis, excess      563
K—S distribution      629—630
l'Hospital's rule      542
L-bit proper decimation      652
L-bit quantity      651
LABATCH      10 495 565 569 571—572 582
LABATCH.O      566—568
Laplacian      427 432
Lattice      400
Law of the iterated logarithm      622
LBATCH rule      554—565 582—583
Least common multiple (1cm)      639
Lebesgue integrable function      64
Lebesgue integral      64 69
Lebesgue — Stieljes integral      69
Lesbegue dominated convergence theorem      524
Limiting distribution      340
Linear programming      90 91 93
Linear programming, sensitivity analysis      95
Linear recurrence generator      588—592 675
Local behavior      336
Local equilibrium      513
Local stabilization      512
Logical variables      79
Logistic distribution      151
Lognormal distribution      192
Los Alamos National Laboratory      344
LPB(v)      93 95
LPW(v)      89
m-bit pseudorandom number      590 m-cubes
m-dimensional hypersphere      51
m-dimensional mesh      15
m-mesh      18 65
m-sequence      649
M/M/1 queueing model      549 551 563—564 566
Majorization      634 677
Markov chain      6 7 337 459 364 377—378 393 415—416 429 431 440 467 472 494 497 506 525 530 532 535 573—575 577
Markov chain sampling      337 440 442—443 451
Markov chain, nonreversible      417—418
Markov process      69 337—343 351 356—357 368 369 372 411 475 520 572
Markov property      338 572
Markov random field      396—402 409
Markov random field, Gibbs distribution      398—401
Markov random field, Ising model      400—402
Markov sampling      337 493
Markov sampling, procedure      434
Markov time      347 460 464 466
Markov transition matrix      577
Markov's inequality      460
Matchings      452
Maximal distance      612
Maximal period      599 672 674
Maximal separation      420 469
Maximal variation      420
Mean recurrence time      573
Mean regeneration time      577
Merging      634
Mersenne numbers      593 595
Message generations      515
Metropolis acceptance function      580
Metropolis method      384 394 400—401 403 495
Metropolis method, continuous case      388
Metropolis sampling      342 578 582
Minimal s—t cutset      57 59 60 80
Minimal variance ratio      45
Mixed congruential generators      601—602 676
Mixed error criteria      121
Mixing sequences      534
Modal value      518
Monic polynomial      646
Monotonicity      152
Moving target      539
MSE      514—515
multinomial      6
Multinomial, distribution      224—225 346 519
Multinormal      6
Multiple replications      499 572
Multiplicative congruential generator      590 598—599 602 659
Multiplicative inverse      590 594 663
Multiplier      591
Multivariable Fourier analysis      613
Multivariate Brownian motion      346
Multivariate integration      64 70
Multivariate normal distribution      223—224
Multivariate Wiener process      346
N-step recursion      649
Natural conjugate distributions      406
Nearest-neighbor random walk      345
Negative binomial distribution      153 161 219 222—223 249 457
Neighborhood      413 514 538
Neighborhood condition      397 402
Neighborhood function      404
Neighboring hyperplanes      677
Network      515
Network connectedness      363
Network, flow algorithm      60
Network, reliability      55 80
Network, undirected      55 83 95
Neutron transport      347—352
Newton — Raphson methods      150 171
NLPB      93
NLPW      99
Node failure      517
Node set      55 80
Nominating matrix      385 404
Nominating transition matrix R      580
Noncentral Cauchy distribution      151 192
Nonlinear congruential generator      671
Nonlinear congruential pseudorandom generator      590
Nonlinear generators      588 670—675
Nonlinear generators, inversive generators      672—675
Nonlinear generators, quadratic generators      672
Nonnegative definite function      521
Nonuniform convergence to normality      69
Normal case      31
Normal distribution      151 189—191 246
Normal random variable      501
Normal sampling p.d.f.      375
Nuclear reactor safety      366
Object code      566
Object set      79
Omnibus test      632
One-step multiplicative congruential generator      588
Optimal basic matrix      93
Optimal basic solution      93
Optimal solution      79
Optimality conditions      91
Optimization problem      526
Order statistics      5 226—230 249
Origin node      515
Orthonormal      416
Overdispersed distribution      514
p-value      570 633
Parallel hyperplanes      609 617—620 647 677
Parent mode      568
Pareto distribution      151
Partial differential equations      2
Partition function      399
Pascal distribution      222
PB      95
Perfect matching      452
Perfect matching, in a bipartite graph      3
Period      592
Periodic boundary conditions      413
Periodic continuation      627
Permanent      3 438 452—459 479
PN-sequence      649
Poincare constant      432
Poincare inequality      426
Point estimate      14
Poisson distributed random variables      518
Poisson distribution      153 155 210—214 248 251—252 518—519
Polynomial f      670
Polynomial ring      646
Polynomial time algorithm      57
Polytopes      233
Portability      587 602 613 676
Positive recurrent      339
Positivity condition      397 402
Posterior joint distribution      406
Posterior marginal distributions      406
Prebatching      571—572
Present values      135
Prime modulus      593 622
Prime modulus, generators      592
Primitive polynomial      655 657 647 661
Primitive root      592—595 675
Primitive trinomial      653—654 663—664 666
Probability transition kernel      341
Product estimator      437—442 478
Product form      399
Product-form representation      148
Production line      353
Pseudorandom number generators      9 587—682
Pseudorandom numbers      7 130 146
PW      91
Quadrature formulas      65
RAN # GEN directory      667
rand      582
RAND # GEN directory      603
RAND subroutine      130 328 479 582 603 605
Random batching sequence      554
Random perfect matching from a bipartite graph      6
Random points from a target distribution      376—378
Random spanning tree      378
Random stopping time      371—375 476
Random walk      337 343—344 422 461 471 474 476 478 481
Random walk on a hypercube      424 430—431 470—472
Random walk on a lattice      345
Random walk on the integers      468—470
Random walk, normal increments      346
Random walk, unrestricted      344
Randomly selected coordinates      477
RANDU      619 620 630—632 634
Rapidly mixing      424
RAPIDS      515
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте