Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical benchmark”

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 487 records · Page 27

Iterated upwind schemes for gas dynamics

A class of high-resolution schemes established in integration of anelastic equations is extended to fully compressible flows, and documented for unsteady (and steady) problems through a span of Mach numbers from zero to supersonic. The schemes stem from iterated upwind technology of the multidimensional positive definite advection transport algorithm (MPDATA). The derived algorithms employ standard and modified forms of the equations of gas dynamics for conservation of mass, momentum and either total or internal energy as well as potential temperature. Numerical examples from elementary wave propagation, through computational aerodynamics benchmarks, to atmospheric small- and large-amplitude acoustics with intricate wave-flow interactions verify the approach for both structured and unstructured meshes, and demonstrate its flexibility and robustness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A stable partitioned FSI algorithm for rigid bodies and incompressible flow. Part I: Model problem analysis

A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forces on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this second part of a two-part series, the general formulation of the AMP scheme is presented including the form of the AMP interface conditions and added-damping tensors for general geometries. A fully second-order accurate implementation of the AMP scheme is developed in two dimensions based on a fractional-step method for the incompressible Navier-Stokes equations using finite difference methods and overlapping grids to handle the moving geometry. Here, the numerical scheme is verified on a number of difficult benchmark problems.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Monte Carlo Particle Transport Algorithms for Binary Stochastic Mixtures

Two Monte Carlo algorithms originally proposed by Zimmerman and Zimmerman and Adams for particle transport through a binary stochastic mixture are numerically compared using a standard set of planar geometry benchmark problems. In addition to previously-published comparisons of the ensemble-averaged probabilities of reflection and transmission, we include comparisons of detailed ensemble-averaged total and material scalar flux distributions. Because not all benchmark scalar flux distribution data used to produce plots in previous publications remains available, we have independently regenerated the benchmark solutions including scalar flux distributions. Both Monte Carlo transport algorithms robustly produce physically-realistic scalar flux distributions for the transport problems examined. The first algorithm reproduces the standard Levermore-Pomraning model results for the probabilities of reflection and transmission. The second algorithm generally produces significantly more accurate probabilities of reflection and transmission and also significantly more accurate total and material scalar flux distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new fuel modeling capability, CTFFuel, with a case study on the fuel thermal conductivity degradation

Here, a new fuel modeling capability, CTFFuel, is developed from the subchannel code, CTF. This code is a standalone interface to the CTF fuel rod models, allowing for fuel rod simulations to be run independently from the fluid. This paper provides an overview of the code with a case study on the thermal conductivity degradation of LWR fuels to demonstrate its capabilities. The modeling of fuel thermal conductivity degradation in the code is improved through the addition of new modeling options to account for the irradiation effects via globally defined parameters. After the initial implementation, a variety of order-of-accuracy tests and code comparisons are performed to test software quality. A controlled analysis is allowed by CTFFuel to verify the numerical scheme of CTF’s conduction solution and to benchmark its fuel temperature predictions against FRAPCON-4.0’s. Overall, the software quality and verification procedure ensures that the new model is coded correctly, that it properly interacts with the rest of the code.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Verification of the sensitivity and uncertainty-based criticality safety validation techniques: ORNL’s SCALE case study

The use of sensitivity and uncertainty-based techniques has been well-developed in the neutronic community for criticality safety applications. Sensitivity techniques calculate the first-order relative variations in keff due to relative cross-section variations by isotope, reaction type, and incident neutron energy. The result is a vector of sensitivity coefficients which is folded with prior cross-section uncertainties to calculate the so-called similarity indices. Similarity indices are integral quantities which serve as useful mathematical measures for assessing the relevance of existing or new experiments to given application conditions, representing design systems for which the models are to be validated. Despite their importance for a wide range of validation activities, the peer-reviewed literature is non-existent on the development of rigorous verification analysis for their calculated values. Thus, this manuscript proposes a simple non-intrusive method to calculate similarity indices, serving as an independent verification tool for their evaluation. The manuscript derives the theoretical basis for the proposed verification analysis. Next, the verification analysis is applied to the ORNL’s SCALE code suite which employs adjoint-based methods to calculate similarity indices. Numerical experiments using a number of well-known benchmark experiments are employed to verify the calculation of the similarity indices.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Interactions Between the Amazonian Rainforest and Cumuli Clouds: A Large‐Eddy Simulation, High‐Resolution ECMWF, and Observational Intercomparison Study

Abstract The explicit coupling at meter and second scales of vegetation's responses to the atmospheric‐boundary layer dynamics drives a dynamic heterogeneity that influences canopy‐top fluxes and cloud formation. Focusing on a representative day during the Amazonian dry season, we investigate the diurnal cycle of energy, moisture and carbon dioxide at the canopy top, and the transition from clear to cloudy conditions. To this end, we compare results from a large‐eddy simulation technique, a high‐resolution global weather model, and a complete observational data set collected during the GoAmazon14/15 campaign. The overall model‐observation comparisons of radiation and canopy‐top fluxes, turbulence, and cloud dynamics are very satisfactory, with all the modeled variables lying within the standard deviation of the monthly aggregated observations. Our analysis indicates that the timing of the change in the daylight carbon exchange, from a sink to a source, remains uncertain and is probably related to the stomata closure caused by the increase in vapor pressure deficit during the afternoon. We demonstrate quantitatively that heat and moisture transport from the subcloud layer into the cloud layer are misrepresented by the global model, yielding low values of specific humidity and thermal instability above the cloud base. Finally, the numerical simulations and observational data are adequate settings for benchmarking more comprehensive studies of plant responses, microphysics, and radiation.

Vilà‐Guerau de Arellano, J.↗

SOLPS-ITER validation with TCV L-mode discharges

This work presents a quantitative test of SOLPS-ITER simulations against tokamak a configuration variable (TCV) L-mode experiments. These simulations account for drifts, currents, kinetic neutrals, and carbon impurities providing the most complete edge transport simulations for TCV to date. The comparison is performed on nominally identical discharges carried out to assess the effectiveness of TCV’s divertor baffles in the framework of the European Plasma Exhaust program and employs numerous edge diagnostics providing a detailed code-experiment benchmark for TCV. The simulations show a qualitative consistency, but the quantitative differences remain, which are assessed herein. It is found that, for a given separatrix density, the simulations most notably yield a colder, and denser, divertor state with a higher divertor neutral pressure than measured.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Symmetry dilemmas in quantum computing for chemistry: A comprehensive analysis

Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits; gate-efficient universal operator pools generally break symmetries; and gate-efficient, fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analyses provide a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Real-Time Identifiability of Power Distribution Network Topologies With Limited Monitoring

Recovering the distribution grid topology in real time is essential to perform several distribution system operator (DSO) functions. DSOs often do not have any direct monitoring of switch statuses to track reconfiguration. At the same time, installing real-time meters at a large number of buses is challenging due to the cost of endowing every metered bus with a real-time communication channel. The goal of this letter is to develop a meter placement strategy allowing DSOs to deploy only few real-time meters. After casting the topology recovery task as an optimization problem, a meter placement strategy ensuring unique recovery of the true topology is devised. A graph-theoretical approach is pursued to partition the grid into connected portions called observable islands . The proposed strategy then simply requires installing a meter in the path between every pair of boundary nodes , i.e., ends of edges connecting two different islands. Under some ideal assumptions, this placement strategy ensures unique recovery of the topology. The approach is also validated through numerical simulations under realistic scenarios using a standard IEEE benchmark feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Bus Clustering for Distribution Grid Topology Identification

Recovering the distribution grid topology is essential to perform several distribution system operator functions. Many algorithms that address the topology recovery problem have already been proposed in the literature. Most are based on a priori information regarding which buses are fed by which substation; however, this information might not be available because frequent grid reconfigurations change the distribution grid portion connected to each substation. This paper addresses the problem of assigning every substation the set of buses that it is feeding, given field data. First, the aforementioned task is cast as a nonconvex optimization problem. Second, a relaxed version of the optimization problem is solved via the alternating direction method of multipliers. Finally, the performance of our approach is validated through numerical simulations of realistic scenarios using a standard IEEE benchmark feeder.

bus clustering↗

A critical comparison of two-equation turbulence models

Several two-equation models were proposed and tested against benchmark flows by various researchers. For each study, different numerical methods or codes were used to obtain the results which were reported to be an improvement over other models. However, these comparisons may be overshadowed by the different numerical schemes used to obtain the results. With this in mind, several existing two-equation turbulence models, including k-epsilon, k-tau, k-omega, and q-omega models, are implemented into a common flow solver code for near wall turbulent flows. The quality of each model is based on several criteria, including robustness and accuracy of predicting the turbulent quantities.

Lang, N. J.↗

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from the photosphere, given the proper boundary conditions. This paper presents the results of this work, describing the mathematical formalism that was developed, the numerical techniques employed, and comments on the stability criteria and accuracy developed for these numerical schemes. An analytical solution is used for a benchmark test; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent (less than 5 percent). This newly developed scheme was applied to analyze a solar vector magnetogram, and the results were compared with the results deduced from the classical potential field method. The comparison shows that additional physical features of the vector magnetogram were revealed in the nonlinear force-free case.

Wu, S. T.↗

CFD applications in pump flows

The objective of the proposed paper is to develop a computational procedure that solves incompressible Navier-Stokes equations for pump flows. The solution method is based on the pseudo-compressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. The equations are solved in steadily rotating reference frames and the centrifugal force and the Coriolis force are added to the equation of motion. As a benchmark problem, the flow through the Rocketdyne inducer is numerically simulated. A coarse grid solution is obtained with a single zone by using an algebraic turbulence model. In multi-zone fine grid computation, a one-equation Baldwin-Barth turbulence model is utilized. Numerical results are compared with experimental measurements and a good agreement is found between the two. The resulting computer code is then applied to the flow analysis inside a two-stage fuel pump impeller operating at 80 percent, 100 percent, and 120 percent of design flow.

Kiris, Cetin↗

Validation of a High-Order Compact Code for Nonlinear Flows About Complex Geometric

The slides review computational requirements for nozzle exhaust flow and noise calculations and the current numerical method, validation of prefactored compact scheme on CAA benchmark problems, a curvilinear grid performance test of gust response of a Joukowski airfoil, airfoil surface RMS pressure distribution and far field noise radiation results for Joukowski airfoil in a vortical gust, boundary distance study for Joukowski airfoil problem, and performance of ICOMP parallel Macintosh cluster.

Hixon, Ray↗

THE PHYSICS OF PROTOPLANETESIMAL DUST AGGLOMERATES. IV. TOWARD A DYNAMICAL COLLISION MODEL

Recent years have shown many advances in our knowledge of the collisional evolution of protoplanetary dust. Based on a variety of dust-collision experiments in the laboratory, our view of the growth of dust aggregates in protoplanetary disks is now supported by a deeper understanding of the physics involved in the interaction between dust agglomerates. However, the parameter space, which determines the collisional outcome, is huge and sometimes inaccessible to laboratory experiments. Very large or fluffy dust aggregates and extremely low collision velocities are beyond the boundary of today's laboratories. It is therefore desirable to augment our empirical knowledge of dust-collision physics with a numerical method to treat arbitrary aggregate sizes, porosities, and collision velocities. In this paper, we implement experimentally determined material parameters of highly porous dust aggregates into a smooth particle hydrodynamics (SPH) code, in particular an omnidirectional compressive-strength and a tensile-strength relation. We also give a prescription of calibrating the SPH code with compression and low-velocity impact experiments. In the process of calibration, we developed a dynamic compressive-strength relation and estimated a relation for the shear strength. Finally, we defined and performed a series of benchmark tests and found the agreement between experimental results and numerical simulations to be very satisfactory. SPH codes have been used in the past to study collisions at rather high velocities. At the end of this work, we show examples of future applications in the low-velocity regime of collisional evolution.

99 GENERAL AND MISCELLANEOUS↗

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗