Geant4-11
G4WeightWindowAlgorithm.hh
Go to the documentation of this file.
1//
2// ********************************************************************
3// * License and Disclaimer *
4// * *
5// * The Geant4 software is copyright of the Copyright Holders of *
6// * the Geant4 Collaboration. It is provided under the terms and *
7// * conditions of the Geant4 Software License, included in the file *
8// * LICENSE and available at http://cern.ch/geant4/license . These *
9// * include a list of copyright holders. *
10// * *
11// * Neither the authors of this software system, nor their employing *
12// * institutes,nor the agencies providing financial support for this *
13// * work make any representation or warranty, express or implied, *
14// * regarding this software system or assume any liability for its *
15// * use. Please see the license in the file LICENSE and URL above *
16// * for the full disclaimer and the limitation of liability. *
17// * *
18// * This code implementation is the result of the scientific and *
19// * technical work of the GEANT4 collaboration. *
20// * By using, copying, modifying or distributing the software (or *
21// * any work based on the software) you agree to acknowledge its *
22// * use in resulting scientific publications, and indicate your *
23// * acceptance of all terms of the Geant4 Software license. *
24// ********************************************************************
25//
26// G4WeightWindowAlgorithm
27//
28// Class description:
29//
30// Implementation of a weight window algorithm.
31// The arguments in the constructor configure the algorithm:
32// - upperLimitFactor: the factor defining the upper weight limit
33// W_u = upperLimitFactor * W_l (W_l lower weight bound)
34// - survivalFactor: used in calculating the survival weight
35// W_s = survivalFactor * W_l
36// - maxNumberOfSplits: the maximal number of splits allowed
37// to be created in one go, and the reciprocal of the minimal
38// survival probability in case of Russian roulette
39//
40// In case of upperLimitFactor=survivalFactor=1 the algorithm becomes
41// the expected weight algorithm of the importance sampling technique.
42//
43// See also G4VWeightWindowAlgorithm.
44
45// Author: Michael Dressel (CERN), 2003
46// ----------------------------------------------------------------------
47#ifndef G4WEIGHTWINDOWALGORITHM_HH
48#define G4WEIGHTWINDOWALGORITHM_HH 1
49
50#include "G4Nsplit_Weight.hh"
52
54{
55 public: // with description
56
57 G4WeightWindowAlgorithm(G4double upperLimitFactor = 5,
58 G4double survivalFactor = 3,
59 G4int maxNumberOfSplits = 5);
60
62
63 virtual G4Nsplit_Weight Calculate(G4double init_w,
64 G4double lowerWeightBound) const;
65 // calculate number of tracks and their weight according
66 // to the initial track weight and the lower energy bound
67
68 private:
69
73};
74
75#endif
double G4double
Definition: G4Types.hh:83
int G4int
Definition: G4Types.hh:85
virtual G4Nsplit_Weight Calculate(G4double init_w, G4double lowerWeightBound) const
G4WeightWindowAlgorithm(G4double upperLimitFactor=5, G4double survivalFactor=3, G4int maxNumberOfSplits=5)