Search NASA⌕ Search

SEARCH · Search NASA

Results for “benchmark problem”

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 325 records · Page 18

A local crack-tracking strategy to model three-dimensional crack propagation with embedded methods

We develop a local, implicit crack tracking approach to propagate embedded failure surfaces in three-dimensions. We build on the global crack-tracking strategy of Oliver et al. (Int J. Numer. Anal. Meth. Geomech., 2004; 28:609–632) that tracks all potential failure surfaces in a problem at once by solving a Laplace equation with anisotropic conductivity. We discuss important modifications to this algorithm with a particular emphasis on the effect of the Dirichlet boundary conditions for the Laplace equation on the resultant crack path. Algorithmic and implementational details of the proposed method are provided. Finally, several three-dimensional benchmark problems are studied and results are compared with available literature. Lastly, the results indicate that the proposed method addresses pathological cases, exhibits better behavior in the presence of closely interacting fractures, and provides a viable strategy to robustly evolve embedded failure surfaces in 3D.

3D fracture↗

A general CFD framework for fault-resilient simulations based on multi-resolution information fusion

We develop a general CFD framework for multi-resolution simulations to target multiscale problems but also resilience in exascale simulations, where faulty processors may lead to gappy, in space-time, simulated fields. We combine approximation theory and domain decomposition together with statistical learning techniques, e.g. coKriging, to estimate boundary conditions and minimize communications by performing independent parallel runs. To demonstrate this new simulation approach, we consider two benchmark problems. First, we solve the heat equation (a) on a small number of spatial “patches” distributed across the domain, simulated by finite differences at fine resolution and (b) on the entire domain simulated at very low resolution, thus fusing multi-resolution models to obtain the final answer. Second, we simulate the flow in a lid-driven cavity in an analogous fashion, by fusing finite difference solutions obtained with fine and low resolution assuming gappy data sets. We investigate the influence of various parameters for this framework, including the correlation kernel, the size of a buffer employed in estimating boundary conditions, the coarseness of the resolution of auxiliary data, and the communication frequency across different patches in fusing the information at different resolution levels. In addition to its robustness and resilience, the new framework can be employed to generalize previous multiscale approaches involving heterogeneous discretizations or even fundamentally different flow descriptions, e.g. in continuum-atomistic simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations – so-called “textbook” multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field, which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Kelvin-Helmholtz instability of boundary-layer plasmas in the kinetic regime

The dynamics of the Kelvin-Helmholtz instability are investigated in the kinetic, high-frequency regime with a novel, two-dimensional, mesh-free tree code. In contrast to earlier studies which focused on specially prepared equilibrium configurations in order to compare with fluid theory, a more naturally occurring plasma-vacuum boundary layer is considered here with relevance to both space plasma and linear plasma devices. Quantitative comparisons of the linear phase are made between the fluid and kinetic models. After establishing the validity of this technique via comparison to linear theory and conventional particle-in-cell simulation for classical benchmark problems, a quantitative analysis of the more complex magnetized plasma-vacuum layer is presented and discussed. It is found that in this scenario, the finite Larmor orbits of the ions result in significant departures from the effective shear velocity and width underlying the instability growth, leading to generally slower development and stronger nonlinear coupling between fast growing short-wavelength modes and longer wavelengths.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Peridynamic thermal diffusion

This study presents the derivation of ordinary state-based peridynamic heat conduction equation based on the Lagrangian formalism. The peridynamic heat conduction parameters are related to those of the classical theory. An explicit time stepping scheme is adopted for numerical solution of various benchmark problems with known solutions. It paves the way for applying the peridynamic theory to other physical fields such as neutronic diffusion and electrical potential distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Subray Method of Characteristics

The MPACT code is being jointly developed by the University of Michigan and Oak Ridge National Laboratory. It uses the 2-D/1-D method to solve neutron transport problems for reactors. The 2-D/1-D method decomposes the problem into a stack of 2-D planes and uses a high-fidelity transport method to resolve all heterogeneity in each plane. These planes are then coupled axially, using a lower-order solver. With this scheme, three-dimensional (3-D) solutions to the transport equation can be obtained at a much lower cost. The 2-D/1-D method assumes that the materials are axially homogeneous for each 2-D plane. Violation of this assumption requires homogenization, which can significantly reduce the accuracy of the calculation. This work proposes the subray method of characteristics (subray MOC) as a solution to this problem. Subray MOC is a subgrid method that allows local heterogeneities to be directly resolved by method of characteristics while treating the rest of the 2-D plane as axially uniform. This improves the accuracy in the neighborhood of the heterogeneity while minimizing the increase in run time. The method was applied to variations of the C5G7 benchmark problems and compared with a previously developed subgrid method called the subplane collision probabilities (SCP) method. Comparisons were made among results obtained using subray MOC, the SCP method, and no subgrid method. Subray MOC consistently performed best, reducing maximum 3-D power distribution errors from as high as 30% to 2% or less. Moreover, it consistently outperformed the SCP method with run times that were shorter than the reference calculations.

2-D/1-D method↗

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗

Advances in ArborX to support exascale applications

ArborX is a performance portable geometric search library developed as part of the Exascale Computing Project (ECP). In this paper, we explore a collaboration between ArborX and a cosmological simulation code HACC. Large cosmological simulations on exascale platforms encounter a bottleneck due to the in-situ analysis requirements of halo finding, a problem of identifying dense clusters of dark matter (halos). This problem is solved by using a density-based DBSCAN clustering algorithm. With each MPI rank handling hundreds of millions of particles, it is imperative for the DBSCAN implementation to be efficient. In addition, the requirement to support exascale supercomputers from different vendors necessitates performance portability of the algorithm. We describe how this challenge problem guided ArborX development, and enhanced the performance and the scope of the library. We explore the improvements in the basic algorithms for the underlying search index to improve the performance, and describe several implementations of DBSCAN in ArborX. Further, we report the history of the changes in ArborX and their effect on the time to solve a representative benchmark problem, as well as demonstrate the real world impact on production end-to-end cosmology simulations.

97 MATHEMATICS AND COMPUTING↗

Fiscal Year 2023 Software Quality Assurance Activities for the ARC Software

The Argonne Reactor Code (ARC) software suite [1-17] has been developed by Argonne researchers for fast reactor design and analysis since the 1970s. With the ARC software suite, a user can quickly build a model of a proposed or existing fast spectrum reactor and carry out fuel cycle, nominal thermal analysis and flow requirements, and assess, as is appropriate, whether the core design and constraint system yield an acceptable mechanical behavior. For transient reactor analysis with SAS4A [18], the ARC software suite can be used to generate reactivity coefficients and kinetics parameters at any modeled fuel cycle time point which forms part of the input to SAS4A. The ARC suite was consistently being developed until the 1990s and followed a software QA program which was an appropriate standard for the time. In the 1990s, the DOE funding to fast reactor research and development was all but eliminated and the ARC software was put into maintenance mode. In the early 2000s, the software quality assurance (SQA) program for ARC was still in place to define an official version, but by 2005 it all but was abandoned as there were insufficient staff to fill the work roles. Since 2005, there has been a considerable increase in research and design work on fast spectrum reactors. The ARC software as a whole has since been exported to many universities and commercial companies and ANL support has been given to the various projects over the years [19-23]. Further, MC 2 -3, PERSENT, and DASSH were all developed after 2005 without any adherence to a software standard. In recent time, the DOE VTR project [22] paid for verification work to be done on the ARC software as part of the goal of making it NQA-1 complaint. The VTR project was not considered the appropriate pathway to fund and maintain a SQA program for the ARC software and while software developments (DASSH) were made and several manuals were updated and software verification work was carried out, the ARC software is not NQA-1 compliant. More recently the Advanced Reactor Development Program (ARDP [23]) has funded the creation of manuals for some ARC utility programs and funded additional software verification work on DIF3D [6, 7] and MC 2 -3 [2-5] for the purpose of commercial grade dedication. Because of the VTR and ARDP projects, software verification work was completed on MC 2 -3 and DIF3D, and detailed reports were created for each piece of software, which discuss the inputs and outputs from the codes that are covered by the verification work and link various analytic, code-to-code, and hand calculation based verification work presented in the report with verification test problems provided with the software. This is a key part of the commercial grade dedication work and constitutes the bulk of the cost to get the ARC software to commercial grade. The ARC software suite is a valuable asset as a fast reactor design and analysis tool set that has been reasonably well verified and validated with various fast reactor benchmark problems and experiments over decades. Some or all of the ARC software suite has been utilized for designing the IFR [20], PGSFR [21], VTR [22], and Natrium [23] reactors and we can expect it to continue to be used for advanced fast reactor design and/or confirmatory calculation purposes in the future. Due to increased interest by commercial companies and regulatory bodies, it is becoming more important to make the ARC software suite complete and ready-to-use in terms of its SQA pedigree and commercial grade dedication needs. This report discusses the achievements made towards building a new SQA program for the ARC software and dealing with outstanding identified QA gaps.

97 MATHEMATICS AND COMPUTING↗

A new symmetrical quasi-classical model for electronically non-adiabatic processes: Application to the case of weak non-adiabatic coupling

Previous work has shown how a symmetrical quasi-classical (SQC) windowing procedure can be used to quantize the initial and final electronic degrees of freedom in the Meyer-Miller (MM) classical vibronic (i.e, nuclear + electronic) Hamiltonian, and that the approach provides a very good description of electronically non-adiabatic processes within a standard classical molecular dynamics framework for a number of benchmark problems. This study explores application of the SQC/MM approach to the case of very weak non-adiabatic coupling between the electronic states, showing (as anticipated) how the standard SQC/MM approach used to date fails in this limit, and then devises a new SQC windowing scheme to deal with it. Finally, application of this new SQC model to a variety of realistic benchmark systems shows that the new model not only treats the weak coupling case extremely well, but it is also seen to describe the “normal” regime (of electronic transition probabilities ≳ 0.1) even more accurately than the previous “standard” model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

STOMP Subsurface Transport Over Multiple Phases: STOMP-CO2 and STOMP-CO2e Guide: Version 1.0

This STOMP (Subsurface Transport Over Multiple Phases) guide document describes the theory, use, and application of the STOMP-CO2 and STOMP-CO2e operational modes. These operational modes of the STOMP simulator are configured to solve problems involving the sequestration of CO2 in geologic saline reservoirs. STOMP-CO2 is the isothermal version and STOMP-CO2e is the nonisothermal version. These core operational modes solve the governing conservation equations for component flow and transport through geologic media; where, the STOMP-CO2 components are water, CO2 and salt and the STOMP-CO2e operational mode also includes an energy conservation equation. Geochemistry can be included in the problem solution via the ECKEChem (Equilibrium-Conservation-Kinetic-Equation Chemistry) module, and geomechanics via the EPRMech (Elastic-Plastic-Rock Mechanics) module. This addendum is designed to provide the new user with a full guide for the core capabilities of the STOMP-CO2 and -CO2e simulators, and to provide the experienced user with a quick reference on implementing features. Several benchmark problems are provided in this addendum, which serve as starting points for developing inputs for more complex problems and as demonstrations of the simulator’s capabilities.

Carbon Dioxide↗

A status of the activities of the NASA. Marshall Space Flight Center Combustion Devices Technology Team

The Consortium for Computational Fluid Dynamics (CFD) Applications in Propulsion Technology was established to focus on computational fluid dynamics applications in propulsion. Specific areas of effort include developing the CFD technology required to address rocket propulsion issues, validating the technology, and applying the validated technology to design problems. The Combustion Devices Technology Team was formed to implement the above objectives in the broad area of combustion driven flows. In an effort to bring CFD to bear in the design environment, the team has focused its efforts on the Space Transportation Main Engine nozzle. The main emphasis has been on the film cooling scheme used to cool the nozzle wall. Benchmark problems have been chosen to validate CFD film cooling capabilities. CFD simulations of the subscale nozzle have been made. Also, CFD predictions of the base flow resulting from this type of nozzle have been made. The status of these calculations is presented along with future plans. Information is given in viewgraph form.

Tucker, Kevin↗

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Verification of the 2D Finite Element SP3 Solutions

Method(FEM) is the free geometry handling. However many of the geometries of the nuclear engineering problems are not unstructured but rather structured, such as a hexahedral, or triangular prism. Thus, the need for the use of FEM has less portion in nuclear engineering. However it is also certain that it is very hard to exclude the possibility for use of an unstructured geometry such as a PBMR core problem, fusion blanket analysis of the source problem, another design issue with an unstructured geometry. In addition, research regarding the acceleration scheme such as Coarse Mesh Finite Difference (CMFD) showed up in nuclear engineering in recent years. By considering these facts, the FEM cannot be totally exclusive. To utilize the FEM for nuclear engineering problems, several types of assistance are needed. The first is parallelization because of its slow calculation speed. The second is an acceleration scheme. With these two types of assistance the FEM can be utilized freely in the nuclear engineering field. In this research, before conducting parallelization and acceleration, the final verification for the implementation of the up-scattering treatment with an arbitrary geometry conducted through a comparison with the McCARD solution through the well-known C5G7 2D benchmark problem. Note that the earlier work for verification of the FEM for the multi-group problem without up-scattering and with a structured geometry including a mathematical formulation has already been done. The main points that will be tested here are as follows. The first is a check of the right implementation for the multi-group problem with an up-scattering cross section from the perspectives of the multiplication factor and power. The second is the transport effect for this problem by comparing the solutions from P{sub 1} and Simplified P{sub 3}(SP{sub 3}). The third is the effectiveness of the higher order basis function for the same number of unknowns. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Maximum-Entropy Meshfree Method for Compressible and Near-Incompressible Elasticity

Numerical integration errors and volumetric locking in the near-incompressible limit are two outstanding issues in Galerkin-based meshfree computations. In this paper, we present a modified Gaussian integration scheme on background cells for meshfree methods that alleviates errors in numerical integration and ensures patch test satisfaction to machine precision. Secondly, a locking-free small-strain elasticity formulation for meshfree methods is proposed, which draws on developments in assumed strain methods and nodal integration techniques. In this study, maximum-entropy basis functions are used; however, the generality of our approach permits the use of any meshfree approximation. Various benchmark problems in two-dimensional compressible and near-incompressible small strain elasticity are presented to demonstrate the accuracy and optimal convergence in the energy norm of the maximum-entropy meshfree formulation.

42 ENGINEERING↗

Quasi-static solution algorithms for kinematically/materially nonlinear thermomechanical problems

This paper develops an algorithmic solution strategy which allows the handling of positive/indefinite stiffness characteristics associated with the pre- and post-buckling of structures subject to complex thermomechanical loading fields. The flexibility of the procedure is such that it can be applied to both finite difference and element-type simulations. Due to the generality of the algorithmic approach developed, both kinematic and thermal/mechanical type material nonlinearity including inelastic effects can be treated. This includes the possibility of handling completely general thermomechanical boundary conditions. To demonstrate the scheme, the results of several benchmark problems is presented.

Padovan, J.↗

Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: Comparison with linear subspace techniques

Natural convection in porous media is a highly nonlinear multiphysical problem relevant to many engineering applications (e.g., the process of CO 2 sequestration). Here, we extend and present a non-intrusive reduced order model of natural convection in porous media employing deep convolutional autoencoders for the compression and reconstruction and either radial basis function (RBF) interpolation or artificial neural networks (ANNs) for mapping parameters of partial differential equations (PDEs) on the corresponding nonlinear manifolds. To benchmark our approach, we also describe linear compression and reconstruction processes relying on proper orthogonal decomposition (POD) and ANNs. Further, we present comprehensive comparisons among different models through three benchmark problems. The reduced order models, linear and nonlinear approaches, are much faster than the finite element model, obtaining a maximum speed-up of 7 × 10 6 because our framework is not bound by the Courant–Friedrichs–Lewy condition; hence, it could deliver quantities of interest at any given time contrary to the finite element model. Our model’s accuracy still lies within a relative error of 7% in the worst-case scenario. We illustrate that, in specific settings, the nonlinear approach outperforms its linear counterpart and vice versa. We hypothesize that a visual comparison between principal component analysis (PCA) and t-Distributed Stochastic Neighbor Embedding (t-SNE) could indicate which method will perform better prior to employing any specific compression strategy.

97 MATHEMATICS AND COMPUTING↗

DDxNet: a deep learning model for automatic interpretation of electronic health records, electrocardiograms and electroencephalograms

Effective patient care mandates rapid, yet accurate, diagnosis. With the abundance of non-invasive diagnostic measurements and electronic health records (EHR), manual interpretation for differential diagnosis has become time-consuming and challenging. This has led to wide-spread adoption of AI-powered tools, in pursuit of improving accuracy and efficiency of this process. While the unique challenges presented by each modality and clinical task demand customized tools, the cumbersome process of making problem-specific choices has triggered the critical need for a generic solution to enable rapid development of models in practice. In this spirit, we develop DDxNet, a deep architecture for time-varying clinical data, which we demonstrate to be well-suited for diagnostic tasks involving different modalities (ECG/EEG/EHR), required level of characterization (abnormality detection/phenotyping) and data fidelity (single-lead ECG/22-channel EEG). Using multiple benchmark problems, we show that DDxNet produces high-fidelity predictive models, and sometimes even provides significant performance gains over problem-specific solutions.

60 APPLIED LIFE SCIENCES↗