9 resultados para Classification, Markov chain Monte Carlo, k-nearest neighbours
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
MSC Subject Classification: 65C05, 65U05.
Resumo:
2002 Mathematics Subject Classification: 65C05.
Resumo:
* This study was supported in part by the Natural Sciences and Engineering Research Council of Canada, and by the Gastrointestinal Motility Laboratory (University of Alberta Hospitals) in Edmonton, Alberta, Canada.
Resumo:
We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.
Resumo:
Mathematics Subject Classification: 65C05, 60G50, 39A10, 92C37
Resumo:
2000 Mathematics Subject Classification: 91B28, 65C05.
Resumo:
, , , - Direct Simulation Monte Carlo . . , . : , , , DSMC
Resumo:
2000 Mathematics Subject Classification: Primary 62F35; Secondary 62P99
Resumo:
2000 Mathematics Subject Classification: 65C05
