Variance reduction by means of deterministic computation: Collision estimate (Q1973293)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Variance reduction by means of deterministic computation: Collision estimate |
scientific article; zbMATH DE number 1436937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variance reduction by means of deterministic computation: Collision estimate |
scientific article; zbMATH DE number 1436937 |
Statements
Variance reduction by means of deterministic computation: Collision estimate (English)
0 references
29 November 2001
0 references
The paper studies the collision estimate of Monte Carlo methods for the solution of integral equations. A new variant of a variance reduction technique is proposed and analyzed. The paper modifies the classical Monte Carlo algorithm, the absorption scheme, developed in a recent paper of the author [Monte Carlo Methods Appl. 1, No. 4, 251-277 (1995; Zbl 0843.65096)] and uses instead the collision scheme technique. After presenting the new technique for the collision scheme it is shown that the variance is dominated by the square of the proximity of the respective kernels and right-hand sides in some functions space norms. The results of the author [loc. cit.] can then be carried over to the collision scheme, such as the Galerkin method to construct a neighbouring equation and the estimation of proximity of kernels as well as right-hand sides from certain parameters of that method.
0 references
Monte Carlo method
0 references
variance reduction
0 references
collision estimate
0 references
integral equations
0 references
absorption scheme
0 references
Galerkin method
0 references
proximity of kernels
0 references
0 references