RAPTOR-M3G 3D Radiation Transport Code Domain Decomposition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methodologies for solving the Linearized Boltzmann Equation (LBE) for neutron and gamma radiation transport require extensive computational resources, exceeding the capabilities of single-processor workstations, especially for large 3-D applications, necessitating a solution that can leverage multi-processor architectures.
Innovation Solution
A 3-D radiation transport computer code, RAPTOR-M3G, employs domain decomposition algorithms to allocate and process angular and spatial domains independently on a multi-processor architecture, reducing computational load and memory requirements, and utilizing parallel algorithms to solve the SN equations efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the discrete ordinates method (SN) is used to solve the Linearized Boltzmann Equation for 3-D neutron and gamma transport applications, then numerical solutions of radiation field distributions can be obtained, but the main memory requirement exceeds current computational capabilities of single-processor workstations
Solution Approach 1:
The patent applies domain decomposition algorithms that divide the computational domain (angular and spatial domains) into smaller sub-domains. Each sub-domain is allocated and processed independently on separate processors in a multi-processor architecture. This segmentation reduces the memory requirement on each individual processor while maintaining the ability to solve the complete 3-D transport problem, thereby resolving the contradiction between achieving accurate radiation field distributions and managing memory requirements.
2Measurement precision
If concurrent discretization of phase space (angular, spatial and energy domains) is performed to solve SN equations, then numerical solutions can be obtained, but extensive computational resources are required
Solution Approach 1:
The patent segments the phase space into angular and spatial domains that can be independently decomposed and processed. By applying domain decomposition to these specific domains while maintaining the necessary discretization for accurate dosimetry prediction, the patent reduces the computational resource requirement compared to full concurrent discretization, thus resolving the contradiction between accuracy and computational complexity.
Solution Approach 2:
The patent transitions from single-processor sequential processing to multi-processor parallel processing by adding a computational dimension. This allows the SN equations to be solved more efficiently by distributing the computational load across multiple processors, reducing the overall computational resource requirement while maintaining accurate dosimetry response predictions.
3Device complexity
If single-processor workstations are used to solve 3-D neutron transport problems, then simpler computational architecture is employed, but the problem cannot be solved due to insufficient memory capacity
Solution Approach 1:
The patent divides the computational task into segments that can be processed independently on multiple processors. This segmentation enables the use of multi-processor architectures to solve 3-D neutron transport problems that would be intractable on single-processor workstations, thereby improving the reliability of problem solving while distributing the complexity across multiple simpler processing units.
Solution Approach 2:
The patent combines multiple processors working in parallel to achieve the computational power necessary to solve 3-D neutron transport problems. By merging the capabilities of multiple processors through domain decomposition and independent processing of angular and spatial domains, the system achieves the reliability needed to solve previously unsolvable transport problems while using relatively simple individual processing units.
Data Source
AI summary
The invention relates generally to a method for the calculation of radiation field distributions employing a new parallel 3-D radiation transport code and, a multi-processor computer architecture. The code solves algorithms using a domain decomposition approach. For example, angular and spatial domains can be partitioned into subsets and, the subsets can be independently allocated and processed.