2023
DOI: 10.1080/00295639.2022.2143704
|View full text |Cite
|
Sign up to set email alerts
|

A Quasi–Monte Carlo Method With Krylov Linear Solvers for Multigroup Neutron Transport Simulations

Abstract: The Monte Carlo Computational Summit was held on the campus of the University of Notre Dame in South Bend, Indiana, USA on 25-26 October 2023. The goals of the summit were to discuss algorithmic and software alterations required for successfully porting respective code bases to exascale-class computing hardware, compare software engineering techniques used by various code teams, and consider the adoption of industry-standard benchmark problems to better facilitate code-to-code performance comparisons. A large … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 52 publications
0
0
0
Order By: Relevance
“…MC/DC-enabled explorations into dynamic neutron transport algorithms have been successful, including quasi-Monte Carlo techniques (Pasmann et al, 2023a), hybrid iterative techniques for k-eigenvalue simulations (Pasmann et al, 2023b), population control techniques (Variansyah & McClarren, 2022a;Variansyah & McClarren, 2022b), continuous geometry movement techniques that model transient elements ) (e.g., control rods or pulsed neutron experiments) more accurately than step functions typically used by other codes, initial condition sampling technique for typical reactor transients , hash-based random number generation (B. S. Cuneo & Variansyah, 2024), uncertainty and global sensitivity analysis (K. Clements et al, 2023;K. B. Clements et al, 2024), residual Monte Carlo methods, and machine learning techniques for dynamic node scheduling, among others.…”
Section: Statement Of Needmentioning
confidence: 99%
“…MC/DC-enabled explorations into dynamic neutron transport algorithms have been successful, including quasi-Monte Carlo techniques (Pasmann et al, 2023a), hybrid iterative techniques for k-eigenvalue simulations (Pasmann et al, 2023b), population control techniques (Variansyah & McClarren, 2022a;Variansyah & McClarren, 2022b), continuous geometry movement techniques that model transient elements ) (e.g., control rods or pulsed neutron experiments) more accurately than step functions typically used by other codes, initial condition sampling technique for typical reactor transients , hash-based random number generation (B. S. Cuneo & Variansyah, 2024), uncertainty and global sensitivity analysis (K. Clements et al, 2023;K. B. Clements et al, 2024), residual Monte Carlo methods, and machine learning techniques for dynamic node scheduling, among others.…”
Section: Statement Of Needmentioning
confidence: 99%