Search NASA⌕ Search

Engineering topics

Marin, Oana

Publications and source records attributed to Marin, Oana.

17 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Continued performance improvement and integration of MOOSE's thermal-hydraulics capabilities (M3 Milestone Report)

This work introduces performance, robustness and workflow improvements to Multiphysics Object-Oriented Simulation Environment (MOOSE)-based thermal-hydraulics solvers. It presents work related to the acceleration of segregated fluid dynamics algorithms, which show approximately a factor of 10 speedup compared to the preceding implementation. Additionally, we discuss approaches to use advanced, Schurr complement-based, field split preconditioners for monolithic solution algorithms relying on the finite volume method. The presence of the Rhie-Chow interpolation makes the utilization of this preconditioner challenging, but the results indicate that for a moderately large problem a factor of 3.4 speedup can be achieved in conjunction with a factor of 3.5 reduction in memory usage. Furthermore, we introduce several pseudo-time stepping approaches to MOOSE for the robust convergence to steady-state solutions when steady-state solves don't converge due to the initial guesses being too far from the solution in Newton's method. Every MOOSE-based application has access this algorithm and can benefit from its use. Moreover, several new avenues have been presented for importing meshes from commercial software which make meshing easier. Lastly, the Component system within the Thermal-Hydraulics Module (THM) of MOOSE is abstracted by separating geometry- and physics-related properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

NEAMS Technical Area Support in MOOSE

The MOOSE framework is a foundational capability used by the NEAMS program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and other new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities outlined in this report include enabling selective polynomial basis refinement, implementing a custom convergence system, building a scalable preconditioner for saddle-point problems, and much more.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

3.0 - MOOSE: Enabling massively parallel multiphysics simulations

The development of MOOSE has kept accelerating since the last release, with over 2,100 pull requests merged over the last 30 months that involved nearly fifty contributors across close to a dozen institutions internationally. The growth in MOOSE's capabilities and downstream applications is reflected in the growth of the community. User support provided on the GitHub discussions forum has steadily increased to nearly 50 daily interactions. New simulation projects, notably to model advanced nuclear reactor and fusion devices, are driving a significant expansion of the capabilities. This paper reports on these developments, with several major released features, new physics modules, and key improvements to the user experience and simulation workflow.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Fourier-informed knot placement schemes for B-spline approximation

Fitting B-splines to scientific data is especially challenging when the given data contain noise, jumps, or corners. Here, we describe how periodic data sets with these features can be efficiently approximated with B-splines by analyzing the Fourier spectrum of the data. Our method uses a collection of spectral filters to compute high-order derivatives, smoothed versions of noisy data, and the locations of jump discontinuities. Further, these quantities are then combined to choose knots that capture the qualitative features of the data, leading to accurate B-spline approximations with few knots. The method we introduce is direct and does not require any intermediate B-spline fitting before choosing the final knot distribution. Aside from fast Fourier transforms to transfer to and from Fourier space, the method runs in linear time with very little communication. We assess performance on several test cases in one and two dimensions, including data sets with jump discontinuities and noise. These tests show the method fits discontinuous data without spurious oscillations and remains effective in the presence of noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fitting Matérn smoothness parameters using automatic differentiation

The Mat$\acute{e}$rn covariance function is ubiquitous in the application of Gaussian processes to spatial statistics and beyond. Perhaps the most important reason for this is that the smoothness parameter $\nu$ gives complete control over the mean-square differentiability of the process, which has significant implications for the behavior of estimated quantities such as interpolants and forecasts. Unfortunately, derivatives of the Mat$\acute{e}$rn covariance function with respect to $\nu$ require derivatives of the modified second-kind Bessel function $K$ $\nu$ with respect to $\nu$. While closed form expressions of these derivatives do exist, they are prohibitively difficult and expensive to compute. For this reason, many software packages require fixing $\nu$ as opposed to estimating it, and all existing software packages that attempt to offer the functionality of estimating $\nu$ use finite difference estimates for $\partial$ $\nu$ $K$ $\nu$ . In this work, we introduce a new implementation of $K$$\nu$ that has been designed to provide derivatives via automatic differentiation (AD), and whose resulting derivatives are significantly faster and more accurate than those computed using finite differences. Here, we provide comprehensive testing for both speed and accuracy and show that our AD solution can be used to build accurate Hessian matrices for second-order maximum likelihood estimation in settings where Hessians built with finite difference approximations completely fail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fourier Neural Networks as Function Approximators and Differential Equation Solvers

We present a Fourier neural network (FNN) that can be mapped directly to the Fourier decomposition. The choice of activation and loss function yields results that replicate a Fourier series expansion closely while preserving a straightforward architecture with a single hidden layer. The simplicity of this network architecture facilitates the integration with any other higher-complexity networks, at a data pre- or postprocessing stage. We validate this FNN on naturally periodic smooth functions and on piecewise continuous periodic functions. We showcase the use of this FNN for modeling or solving partial differential equations with periodic boundary conditions. The main advantages of the current approach are the validity of the solution outside the training region, interpretability of the trained model, and simplicity of use.

Fourier decomposition↗
DOE OSTI2021

The PetscSF Scalable Communication Layer

PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. Here, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Lossy Data Compression Effects on Wall-bounded Turbulence: Bounds on Data Reduction

Postprocessing and storage of large data sets represent one of the main computational bottlenecks in computational fluid dynamics. We assume that the accuracy necessary for computation is higher than needed for postprocessing. Therefore, in the current work we assess thresholds for data reduction as required by the most common data analysis tools used in the study of fluid flow phenomena, specifically wall-bounded turbulence. These thresholds are imposed a priori by the user in L 2 -norm, and we assess a set of parameters to identify the minimum accuracy requirements. The method considered in the present work is the discrete Legendre transform (DLT), which we evaluate in the computation of turbulence statistics, spectral analysis and resilience for cases highly-sensitive to the initial conditions. Maximum acceptable compression ratios of the original data have been found to be around 97%, depending on the application purpose. Furthermore, the new method outperforms downsampling, as well as the previously explored data truncation method based on discrete Chebyshev transform (DCT).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

The three-dimensional structure of swirl-switching in bent pipe flow

Swirl-switching is a low-frequency oscillatory phenomenon which affects the Dean vortices in bent pipes and may cause fatigue in piping systems. Despite thirty years worth of research, the mechanism that causes these oscillations and the frequencies that characterise them remain unclear. In this paper, we show that a three-dimensional wave-like structure is responsible for the low-frequency switching of the dominant Dean vortex. The present study, performed via direct numerical simulation, focuses on the turbulent flow through a $90^{\circ }$ pipe bend preceded and followed by straight pipe segments. A pipe with curvature 0.3 (defined as ratio between pipe radius and bend radius) is studied for a bulk Reynolds number $Re=11\,700$ , corresponding to a friction Reynolds number $Re_{\unicode[STIX]{x1D70F}}\approx 360$ . Synthetic turbulence is generated at the inflow section and used instead of the classical recycling method in order to avoid the interference between recycling and swirl-switching frequencies. The flow field is analysed by three-dimensional proper orthogonal decomposition (POD) which for the first time allows the identification of the source of swirl-switching: a wave-like structure that originates in the pipe bend. Contrary to some previous studies, the flow in the upstream pipe does not show any direct influence on the swirl-switching modes. Finally, our analysis further shows that a three-dimensional characterisation of the modes is crucial to understand the mechanism, and that reconstructions based on two-dimensional POD modes are incomplete.

42 ENGINEERING↗
DOE OSTI2017

Turbulence statistics in a spectral element code: a toolbox for High-Fidelity Simulations

In the present document we describe a toolbox for the spectral-element code Nek5000, aimed at computing turbulence statistics. The toolbox is presented for a small test case, namely a square duct with L x = 2h, L y = 2h and L z = 4h, where x, y and z are the horizontal, vertical and streamwise directions, respectively. The number of elements in the xy-plane is 16 X 16 = 256, and the number of elements in z is 4, leading to a total of 1,204 spectral elements. A polynomial order of N = 5 is chosen, and the mesh is generated using the Nek5000 tool genbox. The toolbox presented here allows to compute mean-velocity components, the Reynolds-stress tensor as well as turbulent kinetic energy (TKE) and Reynolds-stress budgets. Note that the present toolbox allows to compute turbulence statistics in turbulent flows with one homogeneous direction (where the statistics are based on time-averaging as well as averaging in the homogeneous direction), as well as in fully three-dimensional flows (with no periodic directions, where only time-averaging is considered).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Toward Linear Stability Analysis of Upper Plenum Flows

Linear stability analysis is a tool used to help identify the sensitivity of a particular domain to perturbations and evaluate the system dynamics as a transition, if any, occurs. The development of a time invariant base flow for future use in a linear stability analysis is the focus of this investigation. A test case, with a Reynolds number of 100, was brought to a steady state using the spectral element code Nek5000 and the method of selective frequency damping. The convergence criteria for this method is the volume averaged value of the forcing function which, after approximately 80,000 time-steps, decreased to 3.6x10{sup -4}. Analysis shows that the case has yet to have reached the tolerance desired, 1x10{sup -6}. With the simulation in the process of converging a preliminary perturbation analysis was conducted. Due to the low Reynolds number of this case, 100, it was hypothesized that the flow would be linearly stable. This preliminary stability analysis only focused on the largest fundamental mode and the energy growth of that perturbation over time. Upon evaluation of the perturbation energy, which was shown to be monotonically decreasing in time, it was concluded that, despite not yet being converged, the system is in fact linearly stable. Future work includes evaluating the domain at higher Reynolds numbers, solving the eigenvalue problem created when the linearized Navier-Stokes are written in operator form and calculating the energy evolution of the optimal perturbation. (authors)

42 ENGINEERING↗
DOE OSTI2016

Asynchronous Two-Level Checkpointing Scheme for Large-Scale Adjoints in the Spectral-Element Solver Nek5000

Adjoints are an important computational tool for large-scale sensitivity evaluation, uncertainty quantification, and derivative-based optimization. An essential component of their performance is the storage/recomputation balance in which efficient checkpointing methods play a key role. We introduce a novel asynchronous two-level adjoint checkpointing scheme for multistep numerical time discretizations targeted at large-scale numerical simulations. The checkpointing scheme combines bandwidth-limited disk checkpointing and binomial memory checkpointing. Based on assumptions about the target petascale systems, which we later demonstrate to be realistic on the IBM Blue Gene/Q system Mira, we create a model of the expected performance of our checkpointing approach and validate it using the highly scalable Navier-Stokes spectralelement solver Nek5000 on small to moderate subsystems of the Mira supercomputer. In turn, this allows us to predict optimal algorithmic choices when using all of Mira. We also demonstrate that two-level checkpointing is significantly superior to single-level checkpointing when adjoining a large number of time integration steps. To our knowledge, this is the first time two-level checkpointing had been designed, implemented, tuned, and demonstrated on fluid dynamics codes at large scale of 50k+ cores.

Adjoints↗
DOE OSTI2016

On the Strong Scaling of the Spectral Element Solver Nek5000 on Petascale Systems. In: EASC '16 Proceedings of the Exascale Applications and Software Conference 2016, Article No. 5

The present work is targeted at performing a strong scaling study of the high-order spectral element fluid dynamics solver Nek5000. Prior studies such as [5] indicated a recommendable metric for strong scalability from a theoretical viewpoint, which we test here extensively on three parallel machines with different performance characteristics and interconnect networks, namely Mira (IBM Blue Gene/Q), Beskow (Cray XC40) and Titan (Cray XK7). The test cases considered for the simulations correspond to a turbulent flow in a straight pipe at four different friction Reynolds numbers Reτ = 180, 360, 550 and 1000. Considering the linear model for parallel communication we quantify the machine characteristics in order to better assess the scaling behaviors of the code. Subsequently sampling and profiling tools are used to measure the computation and communication times over a large range of compute cores. We also study the effect of the two coarse grid solvers XXT and AMG on the computational time. Super-linear scaling due to a reduction in cache misses is observed on each computer. The strong scaling limit is attained for roughly 5000-10,000 degrees of freedom per core on Mira, 30,000 - 50,0000 on Beskow, with only a small impact of the problem size for both machines, and ranges between 10,000 and 220,000 depending on the problem size on Titan. This work aims at being a reference for Nek5000 users and also serves as a basis for potential issues to address as the community heads towards exascale supercomputers.

Offermans, Nicolas↗