Geometrically convergent learning algorithms for global solutions of transport problems

MaRDI QIDQ4934367zbMATH OpenFDO

Authors Jerome Spanier

Publication date 17 January 2000

zbMATH Keywords

geometric convergenceglobal solutionslearning algorithmsMonte Carlo methodneutron and photon transport problems

Mathematics Subject Classification ID

Integro-partial differential equations (45K05) Monte Carlo methods (65C05) Stochastic particle methods (65C35) Numerical methods for integral equations (65R20) Transport processes in time-dependent statistical mechanics (82C70)

Recommendations

• Comparison of Monte Carlo algorithms for obtaining geometric convergence for model transport problems
• Adaptive importance sampling algorithms for transport problems
• Adaptive Monte Carlo algorithms applied to heterogeneous transport problems
• Adaptive Monte Carlo algorithms for general transport problems
• A new proof of geometric convergence for general transport problems based on sequential correlated sampling methods

Cited in

(4)

• Residual Monte Carlo for the one-dimensional particle transport equation
• Adaptive Monte Carlo algorithms applied to heterogeneous transport problems
• Transport-constrained extensions of collision and track length estimators for solutions of radiative transport problems
• Comparison of Monte Carlo algorithms for obtaining geometric convergence for model transport problems

This page was built for publication: Geometrically convergent learning algorithms for global solutions of transport problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934367)