scholarly journals Adaptive step size for the hybrid Monte Carlo algorithm

1997 ◽  
Vol 55 (3) ◽  
pp. 3658-3663 ◽  
Author(s):  
Philippe de Forcrand ◽  
Tetsuya Takaishi
2019 ◽  
Vol 14 (1) ◽  
Author(s):  
Reto Kueng ◽  
Daniel Frei ◽  
Werner Volken ◽  
Fabian Stuermlin ◽  
Marco F. M. Stampanoni ◽  
...  

Abstract Purpose To provide fast and accurate dose calculation in voxelized geometries for proton radiation therapy by implementing an adaptive step size algorithm in the proton macro Monte Carlo (pMMC) method. Methods The in-house developed local-to-global MMC method for proton dose calculation is extended with an adaptive step size algorithm for efficient proton transport through a voxelized geometry by sampling transport parameters from a pre-simulated database. Adaptive choice of an adequate slab size in dependence of material interfaces in the proton’s longitudinal and lateral vicinity is investigated. The dose calculation algorithm is validated against the non-adaptive pMMC and full MC simulation for pencil and broad beams with various energies impinging on academic phantoms as well as a head and neck patient CT. Results For material interfaces perpendicular to a proton’s direction, choice of nearest neighbor slab thickness shows best trade-off between dosimetric accuracy and calculation efficiency. Adaptive reduction of chosen slab size is shown to be required for material interfaces closer than 0.5 mm in lateral direction. For the academic phantoms, dose differences of within 1% or 1 mm compared to full Geant4 MC simulation are found, while achieving an efficiency gain of up to a factor of 5.6 compared to the non-adaptive algorithm and 284 compared to Geant4. For the head and neck patient CT, dose differences are within 1% or 1 mm with an efficiency gain factor of up to 3.4 compared to the non-adaptive algorithm and 145 compared to Geant4. Conclusion An adaptive step size algorithm for proton macro Monte Carlo was implemented and evaluated. The dose calculation provides the accuracy of full MC simulations, while achieving an efficiency gain factor of three compared to the non-adaptive algorithm and two orders of magnitude compared to full MC for a complex patient CT.


2018 ◽  
Vol 127 ◽  
pp. S472-S473
Author(s):  
R. Kueng ◽  
F. Stürmlin ◽  
D. Frei ◽  
M.F.M. Stampanoni ◽  
P. Manser ◽  
...  

2012 ◽  
Vol 16 (S3) ◽  
pp. 355-375 ◽  
Author(s):  
Olena Kostyshyna

An adaptive step-size algorithm [Kushner and Yin,Stochastic Approximation and Recursive Algorithms and Applications, 2nd ed., New York: Springer-Verlag (2003)] is used to model time-varying learning, and its performance is illustrated in the environment of Marcet and Nicolini [American Economic Review93 (2003), 1476–1498]. The resulting model gives qualitatively similar results to those of Marcet and Nicolini, and performs quantitatively somewhat better, based on the criterion of mean squared error. The model generates increasing gain during hyperinflations and decreasing gain after hyperinflations end, which matches findings in the data. An agent using this model behaves cautiously when faced with sudden changes in policy, and is able to recognize a regime change after acquiring sufficient information.


2002 ◽  
Vol 528 (3-4) ◽  
pp. 301-305 ◽  
Author(s):  
Simon Catterall ◽  
Sergey Karamov

Sign in / Sign up

Export Citation Format

Share Document