Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,459 records · Page 81

Accelerated Molecular Dynamics Methods [Slides]

The molecular dynamics method, although extremely powerful for materials simulations, is limited to times scales of roughly one microsecond or less. On longer time scales, dynamical evolution typically consists of infrequent events, which are usually activated processes. This course is focused on understanding infrequent-event dynamics, on methods for characterizing infrequent-event mechanisms and rate constants, and on methods for simulating long time scales in infrequent-event systems, emphasizing the recently developed accelerated molecular dynamics methods (hyperdynamics, parallel replica dynamics, and temperature accelerated dynamics). Some familiarity with basic statistical mechanics and molecular dynamics methods will be assumed.

74 ATOMIC AND MOLECULAR PHYSICS↗

Investigation of the fragmentation of an explosively driven cylinder

Explosively driven fragmentation is highly complex. To better understand the field detonation, different methodologies (Lagrangian (with a failure threshold in VisIt and element erosion), ALE and embedded grid) were simulated to provide a comparison to the experimental data through the utilization of fragment distributions and gross deformation metrics. Provided with the geometrical parameters and the results from the experimental data, the computer simulations were conducted after the successful writing of each input file. Mesh refinement – a scalar multiplier applied to the mesh to refine the results – was then studied. The objective was to find a value that parallels the experimental results as the mesh can be refine indefinitely, theoretically. Various mesh resolution scales were simulated and the results graphically compared, using the damage and failure variables from a statistical Johnson Cook failure model, the number of fragments over time as well as time required for each simulation to run and number of processors utilized. The desired result is a calculated method to quantify the comparison being performed.

36 MATERIALS SCIENCE↗

Multi-MA reflex triode research.

The Reflex Triode can efficiently produce and transmit medium energy (10-100 keV) x-rays. Perfect reflexing through thin converter can increase transmission of 10-100 keV x-rays. Gamble II experiment at 1 MV, 1 MA, 60 ns - maximum dose with 25 micron tantalum. Electron orbits depend on the foil thickness. Electron orbits from LSP used to calculate path length inside tantalum. A simple formula predicts the optimum foil thickness for reflexing converters. The I(V) characteristics of the diode can be understood using simple models. Critical current dominates high voltage triodes, bipolar current is more important at low voltage. Higher current (2.5 MA), lower voltage (250 kV) triodes are being tested on Saturn at Sandia. Small, precise, anode-cathode gaps enable low impedance operation. Sample Saturn results at 2.5 MA, 250 kV. Saturn dose rate could be about two times greater. Cylindrical triode may improve x-ray transmission. Cylindrical triode design will be tested at 1/2 scale on Gamble II. For higher current on Saturn, could use two cylindrical triodes in parallel. 3 triodes in parallel require positive polarity operation. 'Triodes in series' would improve matching low impedance triodes to generator. Conclusions of this presentation are: (1) Physics of reflex triodes from Gamble II experiments (1 MA, 1 MV) - (a) Converter thickness 1/20 of CSDA range optimizes x-ray dose; (b) Simple model based on electron orbits predicts optimum thickness from LSP/ITS calculations and experiment; (c) I(V) analysis: beam dynamics different between 1 MV and 250 kV; (2) Multi-MA triode experiments on Saturn (2.5 MA, 250 kV) - (a) Polarity inversion in vacuum, (b) No-convolute configuration, accurate gap settings, (c) About half of current produces useful x-rays, (d) Cylindrical triode one option to increase x-ray transmission; and (3) Potential to increase Saturn current toward 10 MA, maintaining voltage and outer diameter - (a) 2 (or 3) cylindrical triodes in parallel, (b) Triodes in series to improve matching, (c) These concepts will be tested first on Gamble II.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TOWARD LOW-COST FABRICATION OF MICROCHANNEL PROCESS TECHNOLOGIES - COST MODELING FOR MANUFACTURING DEVELOPMENT

Chemical and energy conversion systems based on microchannel process technology (MPT) demonstrate high performance in applications in which rates are controlled by diffusive heat and mass transfer flux. The performance of MPT-based heat exchangers, absorbers/desorbers and chemical reactors all benefit from process intensification and have been used in a variety of mobile energy conversion systems including fuel reformers/converters, heat pumps and waste heat scavenging technologies. The service environments typical of MPTs often require the devices to be fabricated from metals such as aluminum, titanium, stainless steel or high temperature super alloys. Flow channels and associated critical dimensions in these devices can be as small as 50 um, but generally range from 100 to 1000 um in width and height with characteristic flow channel lengths normally in the mm to cm range. High surface area architectures (e.g. wicks or textured surfaces) are often included in the flow channels as well for enhanced mass transfer and/or catalytic functionality. Fabrication of MPT devices has historically been performed using a stacked-shim approach in which individual metal sheets are first patterned with micro- and meso-scale flow channels and subsequently bonded in a stack to create an array of miniaturized, parallel flow paths. Typical proof-of-concept fabrication efforts have utilized photo chemical machining (PCM) for shim patterning and diffusion bonding or diffusion brazing for joining of shim stacks. While flexible and capable of supporting technology demonstration, however, these techniques can be expensive at prototyping volumes. The high fabrication cost associated with these prototyping processes has contributed to a perception that MPT technology is expensive and will be relegated to a small application space. Recent work at the Microproducts Breakthrough Institute (MBI) has focused on exploring the cost structure of high volume manufacturing of MPT devices in effort to identify new paths to lower cost fabrication. Through systematic exploration of fabrication process capabilities and associated cost structures, the MBI is developing volume-sensitive cost estimation models for predicting manufacturing costs of MPT devices fabricated using different processing technologies. The process-based cost models are used to develop an understanding of the economic trade-offs between candidate processes and are utilized in a design for manufacturing approach to MPT device fabrication. In this paper we present results and analysis of the cost modeling effort to date and apply the methodology in case study of a stainless steel MPT device designed, built and tested by Pacific Northwest National Laboratory. Extensions of the model to adjacent material sets and the interaction of device designs with fabrication processes will be discussed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel Algorithms for Graph Optimization using Tree Decompositions

Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of required dynamic programming tables and excessive running times of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree-decomposition based approach to solve maximum weighted independent set. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Weerapurage, Dinesh P↗

A PIC Bootstrapping Strategy for Exascale CFD-DEM Simulation

The exascale computing era comes with the release of MFIX-Exa, a new code for studying gas-particle fluidization using CFD-DEM and PIC models on massively parallel, heterogeneous high-performance computing architectures. However, as compute resources continue to grow in scale and complexity, so too does the impetus to use them efficiently. Here, we propose a novel bootstrapping method to minimize neglected simulation time and cast the approach more broadly among a growing field of multi-fidelity methods.

Porcu, Roberto↗

Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications. In this paper, we present task-based implementations of a recently developed data-parallel graph-based approach to the SP2 algorithm, G-SP2. We represent the density matrix P as an undirected graph and use graph partitioning techniques to divide the computation into smaller independent tasks. The partitions thus obtained are generally not of equal size and give rise to undesirable load imbalances in standard MPI-based implementations. This load-balancing challenge can be mitigated by dynamically scheduling parallel computations at runtime using task-based programming models. We develop task-based implementations of the data-parallel G-SP2 algorithm using both Intel's Concurrent Collections (CnC) as well as the Charm++ programming model and evaluate these implementations for future use. Scaling and performance results of our implementations are investigated for representative segments of QMD simulations for solvated protein systems containing more than 10,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Towards Low-Overhead Resilience for Data Parallel Deep Learning

Data parallel techniques have been widely adopted both in academia and industry as a tool to enable scalable training of deep learning models. At scale, DL training jobs can fail due to software or hardware bugs, may need to be preempted or terminated due to unexpected events, or may perform suboptimally because they were misconfigured. Under such circumstances, there is a need to recover and/or reconfigure data-parallel DL training jobs on-the-fly, while minimizing the impact on the accuracy of the DNN model and the runtime overhead. In this regard, state-of-art techniques adopted by the HPC community mostly rely on checkpoint-restart, which inevitably leads to loss of progress, thus increasing the runtime overhead. In this paper we explore alternative techniques that exploit the properties of modern deep learning frameworks (overlapping of gradient averaging and weight updates with local gradient computations through pipeline parallelism) to reduce the overhead of resilience/elasticity. To this end we introduce a failure simulation framework and two resilience strategies (immediate mini-batch rollback and lossy forward recovery), which we study compared with checkpoint-restart approaches in a variety of settings in order to understand the trade-offs between the accuracy loss of the DNN model and the runtime overhead.

data-parallel training↗

Accelerating Satellite Image Based Large-Scale Settlement Detection with GPU

Computer vision algorithms for image analysis are often computationally demanding. Application of such algorithms on large image databases\---- such as the high-resolution satellite imagery covering the entire land surface, can easily saturate the computational capabilities of conventional CPUs. There is a great demand for vision algorithms running on high performance computing (HPC) architecture capable of processing petascale image data. We exploit the parallel processing capability of GPUs to present a GPU-friendly algorithm for robust and efficient detection of settlements from large-scale high-resolution satellite imagery. Feature descriptor generation is an expensive, but a key step in automated scene analysis. To address this challenge, we present GPU implementations for three different feature descriptors\-- multiscale Historgram of Oriented Gradients (HOG), Gray Level Co-Occurrence Matrix (GLCM) Contrast and local pixel intensity statistics. We perform extensive experimental evaluations of our implementation using diverse and large image datasets. Our GPU implementation of the feature descriptor algorithms results in speedups of 220 times compared to the CPU version. We present an highly efficient settlement detection system running on a multiGPU architecture capable of extracting human settlement regions from a city-scale sub-meter spatial resolution aerial imagery spanning roughly 1200 sq. kilometers in just 56 seconds with detection accuracy close to 90\%. This remarkable speedup gained by our vision algorithm maintaining high detection accuracy clearly demonstrates that such computational advancements clearly hold the solution for petascale image analysis challenges.

Patlolla, Dilip Reddy↗

Scaling of the magnetic reconnection rate with symmetric shear flow

The scaling of the reconnection rate during (fast) Hall magnetic reconnection in the presence of an oppositely directed bulk shear flow parallel to the reconnecting magnetic field is studied using two-dimensional numerical simulations of Hall reconnection with two different codes. Previous studies noted that the reconnection rate falls with increasing flow speed and shuts off entirely for super-Alfvenic flow, but no quantitative expression for the reconnection rate in sub-Alfvenic shear flows is known. An expression for the scaling of the reconnection rate is presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Structure formation by a fifth force: N-body versus linear simulations

We lay out the frameworks to numerically study the structure formation in both linear and nonlinear regimes in general dark-matter-coupled scalar field models, and give an explicit example where the scalar field serves as a dynamical dark energy. Adopting parameters of the scalar field which yield a realistic cosmic microwave background (CMB) spectrum, we generate the initial conditions for our N-body simulations, which follow the spatial distributions of the dark matter and the scalar field by solving their equations of motion using the multilevel adaptive grid technique. We show that the spatial configuration of the scalar field tracks well the voids and clusters of dark matter. Indeed, the propagation of scalar degree of freedom effectively acts as a fifth force on dark matter particles, whose range and magnitude are determined by the two model parameters ({mu},{gamma}), local dark matter density as well as the background value for the scalar field. The model behaves like the {lambda}CDM paradigm on scales relevant to the CMB spectrum, which are well beyond the probe of the local fifth force and thus not significantly affected by the matter-scalar coupling. On scales comparable or shorter than the range of the local fifth force, the fifth force is perfectly parallel to gravity and their strengths have a fixed ratio 2{gamma}{sup 2} determined by the matter-scalar coupling, provided that the chameleon effect is weak; if on the other hand there is a strong chameleon effect (i.e., the scalar field almost resides at its effective potential minimum everywhere in the space), the fifth force indeed has suppressed effects in high density regions and shows no obvious correlation with gravity, which means that the dark-matter-scalar-field coupling is not simply equivalent to a rescaling of the gravitational constant or the mass of the dark matter particles. We show these spatial distributions and (lack of) correlations at typical redshifts (z=0,1,5.5) in our multigrid million-particle simulations. The viable parameters for the scalar field can be inferred on intermediate or small scales at late times from, e.g., weak lensing and phase space properties, while the predicted Hubble expansion and linearly simulated CMB spectrum are virtually indistinguishable from the standard {lambda}CDM predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cross-scale Efficient Tensor Contractions for Coupled Cluster Computations Through Multiple Programming Model Backends

Coupled-cluster methods provide highly accurate models of molecular structure by explicit numerical calculation of tensors representing the correlation between electrons. These calculations are dominated by a sequence of tensor contractions, motivating the development of numerical libraries for such operations. While based on matrix-matrix multiplication, these libraries are specialized to exploit symmetries in the molecular structure and in electronic interactions, and thus reduce the size of the tensor representation and the complexity of contractions. The resulting algorithms are irregular and their parallelization has been previously achieved via the use of dynamic scheduling or specialized data decompositions. We introduce our efforts to extend the Libtensor framework to work in the distributed memory environment in a scalable and energy efficient manner. We achieve up to 240 speedup compared with the best optimized shared memory implementation. We attain scalability to hundreds of thousands of compute cores on three distributed-memory architectures, (Cray XC30&XC40, BlueGene/Q), and on a heterogeneous GPU-CPU system (Cray XK7). As the bottlenecks shift from being compute-bound DGEMM's to communication-bound collectives as the size of the molecular system scales, we adopt two radically different parallelization approaches for handling load-imbalance. Nevertheless, we preserve a uni ed interface to both programming models to maintain the productivity of computational quantum chemists.

74 ATOMIC AND MOLECULAR PHYSICS↗

Cross-scale efficient tensor contractions for coupled cluster computations through multiple programming model backends

Coupled-cluster methods provide highly accurate models of molecular structure through explicit numerical calculation of tensors representing the correlation between electrons. These calculations are dominated by a sequence of tensor contractions, motivating the development of numerical libraries for such operations. While based on matrix–matrix multiplication, these libraries are specialized to exploit symmetries in the molecular structure and in electronic interactions, and thus reduce the size of the tensor representation and the complexity of contractions. The resulting algorithms are irregular and their parallelization has been previously achieved via the use of dynamic scheduling or specialized data decompositions. We introduce our efforts to extend the Libtensor framework to work in the distributed memory environment in a scalable and energy-efficient manner. We achieve up to 240× speedup compared with the optimized shared memory implementation of Libtensor. We attain scalability to hundreds of thousands of compute cores on three distributed-memory architectures (Cray XC30 and XC40, and IBM Blue Gene/Q), and on a heterogeneous GPU-CPU system (Cray XK7). As the bottlenecks shift from being compute-bound DGEMM's to communication-bound collectives as the size of the molecular system scales, we adopt two radically different parallelization approaches for handling load-imbalance, tasking and bulk synchronous models. Nevertheless, we preserve a unified interface to both programming models to maintain the productivity of computational quantum chemists.

97 MATHEMATICS AND COMPUTING↗

Ponderomotive force driven density modifications parallel to B on the LAPD

The ponderomotive force has previously been identified as a possible driver of observed density modifications close to radio frequency actuators during operation. This nonlinear force redistributes density in regions of gradients in the magnitude of an oscillating electric field and describes the influence of the fast time scale RF wave dynamics on slow time scale plasma transport. Depletion of the saturation current (a proxy for the density) measured at the Large Plasma Device (LAPD) was 30–35% during ion cyclotron range of frequencies operation. A coupled 1D plasma transport and cold plasma frequency domain wave solver was developed to self-consistently describe ponderomotive effects and was used to compare with results obtained from the LAPD experiment. The scaled current density driver for the wave model yielded an RF B field in close agreement with two components of the experimental data. However, the 1D parallel model did not accurately reproduce the amplitude or spatial distribution observed in experimental measurements of By. Within the limitations of the 1D model, initial simulation results showed that the ponderomotive force depleted up to 8% for high power (1 MW) and around 1% for the experimental power of 120 kW. This could suggest that the ponderomotive force is not the main driver of density modification for the LAPD experiments presented in this paper. Higher fidelity tools of at least 2D will be required to give a more realistic description of the RF E fields and the effect of the ponderomotive force on the LAPD.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Accelerating Bilevel Optimization With Hierarchical Many-Threaded Parallel Differential Evolution

Bilevel optimization is encountered in many relevant real-world applications. The main feature of this type of problem is that an upper-level optimization problem is constrained by a nested lower-level optimization problem. Because of this nested structure, bilevel problems (BLPs) are usually computationally expensive to solve. Differential evolution (DE) has demonstrated promising results in solving BLPs of relatively small scales. As the problem scale increases, the decision space becomes intrinsically larger, requiring a growing number of function evaluations for the method to work properly. In this context, heavy parallelization and high-performance computing techniques are indispensable to enable the resolution of more complex and challenging optimization problems. Hence, we propose a hierarchical many-threaded parallel DE approach for BLPs, where both levels are parallelized. The computational experiments demonstrate that the parallel implementation achieved runtime speeds ranging from 44 to 2559 times faster than the sequential version on a well-known scalable SMD benchmark test problem when executed on an NVIDIA A100 GPU. The findings indicate that the algorithm’s convergence is strongly influenced by the number of both upper- and lower-level generations. Moreover, the success of experiments with large-scale problems is closely linked to the choice of small population sizes.

Dufek, Amanda S↗

Simulation of Watts Bar Unit 1 Initial Startup Tests with Continuous Energy Monte Carlo Methods

The Consortium for Advanced Simulation of Light Water Reactors* is developing a collection of methods and software products known as VERA, the Virtual Environment for Reactor Applications. One component of the testing and validation plan for VERA is comparison of neutronics results to a set of continuous energy Monte Carlo solutions for a range of pressurized water reactor geometries using the SCALE component KENO-VI developed by Oak Ridge National Laboratory. Recent improvements in data, methods, and parallelism have enabled KENO, previously utilized predominately as a criticality safety code, to demonstrate excellent capability and performance for reactor physics applications. The highly detailed and rigorous KENO solutions provide a reliable nu-meric reference for VERAneutronics and also demonstrate the most accurate predictions achievable by modeling and simulations tools for comparison to operating plant data. This paper demonstrates the performance of KENO-VI for the Watts Bar Unit 1 Cycle 1 zero power physics tests, including reactor criticality, control rod worths, and isothermal temperature coefficients.

CASL↗

Toward General Software Level Silent Data Corruption Detection for Parallel Applications

Silent data corruption (SDC) poses a great challenge for high-performance computing (HPC) applications as we move to extreme-scale systems. Mechanisms have been proposed that are able to detect SDC in HPC applications by using the peculiarities of the data (more specifically, its “smoothness” in time and space) to make predictions. However, these data-analytic solutions are still far from fully protecting applications to a level comparable with more expensive solutions such as full replication. In this work, we propose partial replication to overcome this limitation. More specifically, we have observed that not all processes of an MPI application experience the same level of data variability at exactly the same time. Thus, we can smartly choose and replicate only those processes for which the lightweight data-analytic detectors would perform poorly. In addition, we propose a new evaluation method based on the probability that a corruption will pass unnoticed by a particular detector (instead of just reporting overall single-bit precision and recall). Here in our experiments, we use four applications dealing with different explosions. Finally, our results indicate that our new approach can protect the MPI applications analyzed with 7–70% less overhead (depending on the application) than that of full duplication with similar detection recall.

97 MATHEMATICS AND COMPUTING↗

Single-Bubble Flow Boiling Phenomena - Interface Tracking Simulation

Boiling, as one of the most efficient heat transfer mechanisms, is widely used in various engineering systems. Better understanding and modeling of this process remains a major challenge in multiphase flow research. The distribution of vapor in boiling system affects the heat transfer rate and may cause unfavorable conditions, such as heater burn-out. A number of flow regimes have been observed experimentally. In general, there are three regimes under boiling conditions: nucleate boiling, transition boiling, and film boiling. The nucleate boiling regime is categorized into partial boiling regime and fully developed nucleate boiling, according to behavior of bubble dynamics and heat transfer characteristics. In the first region, as the wall temperature increases, the fraction of the wall surface subject to nucleate boiling increases until bubble formation occupies the entire heated surface. Heat transfer in this region is a complex mixture of single-phase forced convection and nucleate boiling. As bubble density increases, bubbles turn to coalesce and form insulating vapor patches, which impedes liquid flow back to the surface. The heat transfer rate under this condition reduces dramatically. This point is called Critical Heat Flux (CHF), which leads to boiling crisis. The behavior of boiling crisis is dependent on local fluid conditions due to bubble growth and departure. Experiments are the ultimate tool for boiling model development and verification, but they still lack some capabilities needed for better understanding of the local mechanism of this phenomena. It's difficult to capture many important details at the pressure/temperature conditions of interest using experimental techniques, such as full three dimensional measurements of velocity and temperature distribution and estimates of heat flux partitioning during the boiling process. The interface tracking simulation (ITS) is one of the promising approaches to describe heat transfer of boiling phenomena and their underlying mechanisms. The advances of high performance computing (HPC) in recent years made it possible to apply DNS to a wide variety of adiabatic flows. Some work has been done to implement evaporation / condensation models as well. Lee and Nydahl performed a numerical simulation of bubble growth and departure assuming that the bubble has the shape of a truncated sphere and a micro-layer exists during bubble growth. A 2-D cylindrical bubbles simulation has been done by Son with a simplified model to predict the heat flux in a thin liquid micro-layer. A direct simulation of 2D film boiling is conducted by Juric and Tryggvason. The film boiling, below critical pressure with a modified Level Set Method, is studied by Son and Dhir. Ose and Kunugi have developed a boiling and condensation model on subcooled boiling phenomena. Fuchs performed numerical simulations of bubble growth and departure considering wall conduction effects. Fully transient heat and fluid flow is modeled with a free surface of a rising bubble and a periodic calculation of the whole cycling of a growing, detaching, and rising bubble. Mukherjee and Kandikar have done a numerical simulation of an evaporating meniscus on a moving heated surface with level set method. The heat transfer associated with the advancing and receding contact angle has been studied. To develop the capability of physics-based boiling process, in the presented work the energy and momentum equations are coupled to simulate single-bubble growth scenarios. For a single bubble simulation in infinite liquid, the analytical solution exists and can be compared with the numerical results for verification purposes. The presented capabilities will be utilized in the large scale DNS of boiling flows in the future. The finite-element based code, PHASTA is used for the simulation. It is a parallel, hierarchic, higher-order accurate, adaptive, stabilized, transient analysis flow solver, which has been shown to be an effective tool for a wide range of single and two-phase flow problems. It has been shown to be highly scalable on top supercomputers ({approx}85% scaling on up to 3 million mesh partitions using a 92 billion element mesh . PHASTA has been shown to reliably predict the details of adiabatic bubbly flows as well as single-phase flows with heat transfer. To develop the capability of physics-based boiling process, in the presented work the energy and momentum equations are coupled to simulate a single-bubble growth scenario. For a single bubble growth in superheated water, the analytical solution exists and can be compared with the numerical results for verification purposes. The second-order accurate spatial and time discretization is used for the flow solver in the presented work. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗