Search NASA⌕ Search

Engineering topics

Mousseau, Vincent

Publications and source records attributed to Mousseau, Vincent.

Implementation of a Pressure Correction Term in the CTF Subchannel Code

CTF is a modernized and improved version of the legacy subchannel code COBRA-TF, being jointly developed and maintained by Oak Ridge National Laboratory (ORNL) and North Carolina State University. The code was adopted by ORNL for use in the Consortium for Advanced Simulation of Light Water Reactors (CASL) in 2012 to help address CASL challenge problems. Since that time, activities related to CTF have included implementing software quality assurance measures, implementing new features and models, performing validation and verification testing, establishing and supporting a CTF user group, and developing the code for use in coupled applications. CTF is applicable to single- and two-phase flows in light water reactor geometries at normal and accident operating conditions. The two-phase flow model consists of the six-equation two-phase flow model augmented by equations for the droplet field, and it also includes appropriate source terms. This work focuses on the numerical stability of the six-equation two-phase flow model and is part of a recent effort to improve CTF capabilities for simulating flows in boiling water reactors (BWRs). The six-equation two-phase flow model is not strongly hyperbolic, meaning that some of its eigenvalues are either not real or not distinct. In a Cauchy sense, and for an initial-value problem, strong hyperbolicity was found to be equivalent to well-posedness, which ensures the uniqueness of the solution in the space-time used. This concept is also of importance when designing high-order numerical methods and also when implementing boundary conditions that rely on real eigenvalues such as Riemann solvers. A tremendous amount of research is available in the literature on how to hyperbolize the six-equation two-phase flow model by adding ad hoc terms to the system of equations. Such terms are often referred to as virtual mass or interfacial pressure correction terms. From a mathematical perspective, this approach adds terms to the phasic momentum equation containing first-order partial derivatives of the unknowns to modify the Jacobian matrix, thus the imaginary part of the eigenvalues. For this work, an interfacial pressure correction (IPC) term on the same model as what was used for the CATHARE system code, is implemented in CTF. This allows for recovery of a two-pressure formulation. In the following, the six-equation two-phase flow model is recalled, along with the IPC term and its influence on the eigenvalues. Then, numerical results and convergence studies are presented for a water-faucet problem at a pressure of 10 bar. Finally, conclusions and future work are addressed.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking

A hybrid of the Front-Tracking (FT) and the Level-Set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected – instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based re-distancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; in contrast to traditional PDE-based re-initialization algorithms, which tend to slightly relocate the zero Level Set and can be shown to be non-convergent in curvature. The implicit pseudo-time discretization of the re-distancing equation is implemented within the Jacobian-Free Newton Krylov (JFNK) framework combined with ILU(k) preconditioning. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with iterations (CFL ), in contrast to the explicit re-distancing which requires 100s of iterations with CFL . The most cost-effective algorithm is found to be a hybrid of explicit and implicit discretizations, in which we apply first 10-15 iterations with explicit discretization (to bring the initial guess to the ball of convergence for the Newton’s method) and then finishing with 2-3 implicit steps, bringing the re-distancing equation to a complete steady-state. The eigenscopy of the JFNK-ILU(k) demonstrates the efficiency of the ILU(k) preconditioner, which effectively cluster eigenvalues of the otherwise extremely ill-conditioned Jacobian matrices, thereby enabling the Krylov (GMRES) method to converge with iterations, with only a few levels of ILU fill-ins. Importantly, due to the Level Set localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as , which implies efficiency and good scalability of the overall algorithm. The numerical examples include the well-established tests for interface kinematics under translational, rotational and tearing/stretching motion. We have shown that the mass conservation is not an issue anymore, as demonstrated using the Rider&Kothe’s time-reversed tests with extreme deformation. We are able to stretch interface structures to the under-resolved/subgrid (on the chosen Eulerian mesh) scales, and recover them back without any change in shape/loss of mass.

99 GENERAL AND MISCELLANEOUS↗