Search NASA⌕ Search

SEARCH · Search NASA

Results for “fixed grid”

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 37 records · Page 2

An implicit, sharp numerical treatment of viscous terms at arbitrarily shaped liquid-gas interfaces in evaporative flows

We report a novel methodology for accurate treatment of viscous terms in evaporation problems. The proposed scheme is an extension of the sharp viscous treatment of Kang et al. (2000) [7] to 3D phase change problems. To ensure accuracy and grid converging solutions, a new implicit approach to computing viscous fluxes across the phase interfaces is proposed, which was previously unavailable in fixed grid numerical schemes. Analytical relations were derived for the jump in velocity gradients across the 2D and 3D phase interfaces, an important constituent of the proposed scheme. The relations show a non-vanishing jump in the tangential gradients across the phase interface that are associated with evaporative flux and interfacial curvature. The proposed methodology demonstrated first order accuracy in canonical test cases. It is general and applicable to arbitrarily oriented interfaces, and can be readily implemented in existing evaporation flow solvers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-Fidelity CFD Verification Workshop 2024 Summary: Spalart-Allmaras QCR2000-R Turbulence Model

This paper summarizes solutions submitted for the Reynolds-averaged Navier-Stokes (RANS) test suite of the High-Fidelity CFD Verification Workshop. The goal of the workshop is to establish standards for verification of computational fluid dynamics (CFD) approaches to simulations of steady and unsteady turbulent flows. The RANS verification studies focus on a one-equation Spalart-Allmaras model with quadratic constitutive relation and rotation correction, SA-neg-QCR2000-R. The verification test cases are a two-dimensional subsonic flow around a Joukowski airfoil, a three-dimensional subsonic flow around an extruded NACA 0012 wing in a tunnel, and a subsonic flow around a wing-body configuration developed for verification of solvers participating in the 5 𝑡 ℎ High-Lift Prediction Workshop. The turbulencemodel formulation, geometry, flow conditions, grids, and reference solutions are described in detail. Solutions for the test cases are computed by seven established CFD solvers on adaptedand fixed-grid families using different discretization approaches. While some noticeable differences between solutions remain, the results achieved by contributing solvers show that different solutions computed for the same RANS model on different grid families can converge to a common limit with grid refinement. The apparent requirements for grid convergence are a well designed family of grids that provide sufficient resolution in important areas and a strong solver capable of deep iterative convergence on each grid. For each test case in the study, the variation between aerodynamic forces computed by different solvers on the finest grids of different families is less than 2%.

Boris Diskin↗

AnisWave2D

AnisWave2D is a 2D finite-difference code for simulating seismic wave propagation in fully anisotropic materials. The code is implemented to run in parallel over multiple processors and is fully portable. A mesh refinement algorithm has been utilized to allow the grid-spacing to be tailored to the velocity model, avoiding the over-sampling of high-velocity materials that usually occurs in fixed-grid schemes.

Toomey, Aoife↗

Performance of high-order Godunov-type methods in simulations of astrophysical low Mach number flows

High-order Godunov methods for gas dynamics have become a standard tool for simulating different classes of astrophysical flows. Their accuracy is mostly determined by the spatial interpolant used to reconstruct the pair of Riemann states at cell interfaces and by the Riemann solver that computes the interface fluxes. In most Godunov-type methods, these two steps can be treated independently, so that many different schemes can in principle be built from the same numerical framework. Because astrophysical simulations often test out the limits of what is feasible with the computational resources available, it is essential to find the scheme that produces the numerical solution with the desired accuracy at the lowest computational cost. However, establishing the best combination of numerical options in a Godunov-type method to be used for simulating a complex hydrodynamic problem is a nontrivial task. In fact, formally more accurate schemes do not always outperform simpler and more diffusive methods, especially if sharp gradients are present in the flow. For this work, we used our fully compressible Seven-League Hydro (SLH) code to test the accuracy of six reconstruction methods and three approximate Riemann solvers on two- and three-dimensional (2D and 3D) problems involving subsonic flows only. We considered Mach numbers in the range from 10 −3 to 10 −1 , which are characteristic of many stellar and geophysical flows. In particular, we considered a well-posed, 2D, Kelvin–Helmholtz instability problem and a 3D turbulent convection zone that excites internal gravity waves in an overlying stable layer. Although the different combinations of numerical methods converge to the same solution with increasing grid resolution for most of the quantities analyzed here, we find that (i) there is a spread of almost four orders of magnitude in computational cost per fixed accuracy between the methods tested in this study, with the most performant method being a combination of a low-dissipation Riemann solver and a sextic reconstruction scheme; (ii) the low-dissipation solver always outperforms conventional Riemann solvers on a fixed grid when the reconstruction scheme is kept the same; (iii) in simulations of turbulent flows, increasing the order of spatial reconstruction reduces the characteristic dissipation length scale achieved on a given grid even if the overall scheme is only second order accurate; (iv) reconstruction methods based on slope-limiting techniques tend to generate artificial, high-frequency acoustic waves during the evolution of the flow; and (v) unlimited reconstruction methods introduce oscillations in the thermal stratification near the convective boundary, where the entropy gradient is steep.

79 ASTRONOMY AND ASTROPHYSICS↗

Toward Exascale Earthquake Ground Motion Simulations for Near-Fault Engineering Analysis

Modernizing SW4 for massively parallel time-domain simulations of earthquake ground motions in 3D earth models increases resolution and provides ground motion estimates for critical infrastructure risk evaluations. Simulations of ground motions from large (M ≥ 7.0) earthquakes require domains on the order of 100 to500 km and spatial granularity on the order of 1 to5 m resulting in hundreds of billions of grid points. Surface-focused structured mesh refinement (SMR) allows for more constant grid point per wavelength scaling in typical Earth models, where wavespeeds increase with depth. In fact, MR allows for simulations to double the frequency content relative to a fixed grid calculation on a given resource. The authors report improvements to the SW4 algorithm developed while porting the code to the Cori Phase 2 (Intel Xeon Phi) systems at the National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory. As a result, investigations of the performance of the innermost loop of the calculations found that reorganizing the order of operations can improve performance for massive problems.

58 GEOSCIENCES↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗

A Cell-Centered Multigrid Algorithm for All Grid Sizes

Multigrid methods are optimal; that is, their rate of convergence is independent of the number of grid points, because they use a nested sequence of coarse grids to represent different scales of the solution. This nesting does, however, usually lead to certain restrictions of the permissible size of the discretised problem. In cases where the modeler is free to specify the whole problem, such constraints are of little importance because they can be taken into consideration from the outset. We consider the situation in which there are other competing constraints on the resolution. These restrictions may stem from the physical problem (e.g., if the discretised operator contains experimental data measured on a fixed grid) or from the need to avoid limitations set by the hardware. In this paper we discuss a modification to the cell-centered multigrid algorithm, so that it can be used br problems with any resolution. We discuss in particular a coarsening strategy and choice of intergrid transfer operators that can handle grids with both an even or odd number of cells. The method is described and applied to linear equations obtained by discretization of two- and three-dimensional second-order elliptic PDEs.

Gjesdal, Thor↗

An empirical model of electron and ion fluxes derived from observations at geosynchronous orbit

Knowledge of the plasma fluxes at geosynchronous orbit is important to both scientific and operational investigations. We present a new empirical model of the ion flux and the electron flux at geosynchronous orbit (GEO) in the energy range ~1 eV to ~40 keV. The model is based on a total of 82 satellite-years of observations from the Magnetospheric Plasma Analyzer instruments on Los Alamos National Laboratory satellites at GEO. These data are assigned to a fixed grid of 24 local-times and 40 energies, at all possible values of Kp. Bi-linear interpolation is used between grid points to provide the ion flux and the electron flux values at any energy and local-time, and for given values of geomagnetic activity (proxied by the 3-hour Kp index), and also for given values of solar activity (proxied by the daily F10.7 index). Initial comparison of the electron flux from the model with data from a Compact Environmental Anomaly Sensor II (CEASE-II), also located at geosynchronous orbit, indicate a good match during both quiet and disturbed periods. The model is available for distribution as a FORTRAN code that can be modified to suit user-requirements.

58 GEOSCIENCES↗

Effect of topology changes on the breakup of a periodic liquid jet

Here, the breakup of a periodic jet is examined computationally, using a front-tracking/finite-volume method, where the interface is represented by connected marker points moving with the fluid, while the governing equations are solved on a fixed grid. Tracking the interface allows control of whether topology changes take place or not. The Reynolds and Capillary numbers are kept relatively low ($Re = 150$ and $Ca = 2$) so most of the flow is well resolved. The effect of topology changes is examined by following the jet until it has mostly disintegrated, for different “coalescence criterion,” based on the thickness of thin films and threads. The evolution of both two-dimensional and fully three-dimensional flows is examined. It is found that although there is a significant difference between the evolution when no breakup takes place and when it does, once breakup takes place the evolution is relatively insensitive to exactly how it is triggered for a range of coalescence criterion, and any differences are mostly confined to the smallest scales.

97 MATHEMATICS AND COMPUTING↗

An Eulerian projection method for quasi-static elastoplasticity

A well-established numerical approach to solve the Navier-Stokes equations for incompressible fluids is Chorin's projection method, whereby the fluid velocity is explicitly updated, and then an elliptic problem for the pressure is solved, which is used to orthogonally project the velocity field to maintain the incompressibility constraint. In this paper, we develop a mathematical correspondence between Newtonian fluids in the incompressible limit and hypo-elastoplastic solids in the slow, quasi-static limit. Using this correspondence, we formulate a new fixed-grid, Eulerian numerical method for simulating quasi-static hypo-elastoplastic solids, whereby the stress is explicitly updated, and then an elliptic problem for the velocity is solved, which is used to orthogonally project the stress to maintain the quasi-staticity constraint. We develop a finite-difference implementation of the method and apply it to an elasto-viscoplastic model of a bulk metallic glass based on the shear transformation zone theory. We show that in a two-dimensional plane strain simple shear simulation, the method is in quantitative agreement with an explicit method. Like the fluid projection method, it is efficient and numerically robust, making it practical for a wide variety of applications. We also demonstrate that the method can be extended to simulate objects with evolving boundaries. Here, we highlight a number of correspondences between incompressible fluid mechanics and quasi-static elastoplasticity, creating possibilities for translating other numerical methods between the two classes of physical problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On spontaneous formation of current sheets: Untwisted magnetic fields

This is a study of the spontaneous formation of electric current sheets in an incompressible viscous fluid with perfect electrical conductivity, governed by the magnetohydrodynamic Navier-Stokes equations. Numerical solutions to two initial value problems are presented for a three-dimensional, periodic, untwisted magnetic field evolving, with no change in magnetic topology under the frozen-in condition and at characteristic fluid Reynolds numbers of the order of 500, from a nonequilibrium initial state with the fluid at rest. The evolution converts magnetic free energy into kinetic energy to be all dissipated away by viscosity so that the field settles into a minimum-energy, static equilibrium. The solutions demonstrate that, as a consequence of the frozen-in condition, current sheets must form during the evolution despite the geometric simplicity of the prescribed initial fields. In addition to the current sheets associated with magnetic neutral points and field reversal layers, other sheets not associated with such magnetic features are also in evidence. These current sheets form on magnetic flux surfaces. This property is used to achieve a high degree of the frozen-in condition in the simulations, by describing the magnetic field entirely in terms of the advection of its flux surfaces and integrating the resulting governing equations with a customized version of a general-purpose high-resolution (viz., nonoscillatory) hydrodynamical simulation code EULAG [J. M. Prusa et al., Comput. Fluids 37, 1193 (2008)]. Incompressibility imposes the additional global constraint that the flux surfaces must evolve with no change in the spatial volumes they enclose. In this approach, current sheet formation is demonstrated graphically by the progressive pressing together of suitably selected flux surfaces until their separation has diminished below the minimal resolved distance on a fixed grid. The frozen-in condition then fails in the simulation as the field reconnects through an effecting numerical resistivity. The principal results are related to the Parker theory of current-sheet formation and dissipation in the solar corona.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GLOBAL CALCULATIONS OF DENSITY WAVES AND GAP FORMATION IN PROTOPLANETARY DISKS USING A MOVING MESH

We calculate the global quasi-steady state of a thin disk perturbed by a low-mass protoplanet orbiting at a fixed radius using extremely high resolution numerical integrations of Euler's equations in two dimensions. The calculations are carried out using a moving computational domain, which greatly reduces advection errors and allows for much longer time steps than a fixed grid. We calculate the angular momentum flux and the torque density as a function of radius and compare them with analytical predictions. We discuss the quasi-steady state after 100 orbits and the prospects for gap formation by low-mass planets.

79 ASTRONOMY AND ASTROPHYSICS↗

TURBULENCE IN THE INTERGALACTIC MEDIUM: SOLENOIDAL AND DILATATIONAL MOTIONS AND THE IMPACT OF NUMERICAL VISCOSITY

We use a suite of cosmological hydrodynamical simulations, run by two fixed grid codes, to investigate the properties of solenoidal and dilatational motions of the intergalactic medium (IGM) and the impact of numerical viscosity on turbulence in an ΛCDM universe. The codes differ only in the spatial difference discretization. We find that (1) The vortical motion grows rapidly since z = 2 and reaches ∼10 km s{sup –1}-90 km s{sup –1} at z = 0. Meanwhile, the small-scale compressive ratio r{sub CS} drops from 0.84 to 0.47, indicating comparable vortical and compressive motions at z = 0. (2) Power spectra of the solenoidal velocity possess two regimes, ∝k {sup –0.89} and ∝k {sup –2.02}, while the total and dilatational velocity follow the scaling k {sup –1.88} and k {sup –2.20}, respectively, in the turbulent range. The IGM turbulence may contain two distinct phases, the supersonic and post-supersonic phases. (3) The non-thermal pressure support, measured by the vortical kinetic energy, is comparable with the thermal pressure for ρ{sub b} ≅ 10-100, or T < 10{sup 5.5} K at z = 0.0. The deviation of the baryon fraction from the cosmic mean shows a preliminary positive correlation with the turbulence pressure support. (4) A relatively higher numerical viscosity would dissipate both the compressive and vortical motions of the IGM into thermal energy more effectively, resulting in less developed vorticity, remarkably shortened inertial range, and leading to a non-negligible uncertainty in the thermal history of gas accretion. Shocks in regions outside of clusters are significantly suppressed by numerical viscosity since z = 2, which may directly cause the different levels of turbulence between the two codes.

79 ASTRONOMY AND ASTROPHYSICS↗

Binary black hole accretion from a circumbinary disk: Gas dynamics inside the central cavity

We present the results of two-dimensional (2D) hydrodynamical simulations of circumbinary disk accretion using the finite-volume code DISCO. This code solves the 2D viscous Navier-Stokes equations on a high-resolution moving mesh which shears with the fluid flow, greatly reducing advection errors in comparison with a fixed grid. We perform a series of simulations for binary mass ratios in the range 0.026 ≤ q ≤ 1.0, each lasting longer than a viscous time so that we reach a quasi-steady accretion state. In each case, we find that gas is efficiently stripped from the inner edge of the circumbinary disk and enters the cavity along accretion streams, which feed persistent 'mini disks' surrounding each black hole. We find that for q ≳ 0.1, the binary excites eccentricity in the inner region of the circumbinary disk, creating an overdense lump which gives rise to enhanced periodicity in the accretion rate. The dependence of the periodicity on mass ratio may provide a method for observationally inferring mass ratios from measurements of the accretion rate. We also find that for all mass ratios studied, the magnitude of the accretion onto the secondary is sufficient to drive the binary toward larger mass ratio. This suggests a mechanism for biasing mass-ratio distributions toward equal mass.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian

We provide an explicit recursive divide-and-conquer approach for simulating quantum dynamics and derive a discrete first-quantized nonrelativistic QED Hamiltonian based on the many-particle Pauli-Fierz Hamiltonian. We apply this recursive divide-and-conquer algorithm to this Hamiltonian and compare it to a concrete simulation algorithm that uses qubitization. Our divide-and-conquer algorithm, using lowest-order Trotterization, scales for fixed grid spacing as O ~ ( Λ N 2 η 2 t 2 / ϵ ) for grid size N , η particles, simulation time t , field cutoff Λ , and error ϵ . Our qubitization algorithm scales as O ~ ( N ( η + N ) ( η + Λ 2 ) t log ( 1 / ϵ ) ) . This shows that even a naive partitioning and low-order splitting formula can yield, through our divide-and-conquer formalism, superior scaling to qubitization for large Λ . We compare the relative costs of these two algorithms on systems that are relevant for applications such as the spontaneous emission of photons and the photoionization of electrons. We observe that for different parameter regimes, one method can be favored over the other. Finally, we give new algorithmic and circuit-level techniques for gate optimization, including a new way of implementing a group of multicontrolled- X gates that can be used for better analysis of circuit cost. Published by the American Physical Society 2024

Mukhopadhyay, Priyanka (ORCID:0000000164639100)↗

ObstacleSense: Low-Power Neuromorphic Vision for Corridor Obstacle Awareness in Low-Level ADAS

The automotive industry’s pursuit of Level 5 autonomy is constrained by substantial perception-compute power requirements, often reaching 1, 000 + watts in full autonomy stacks. Reducing this energy burden requires rethinking perception not only at the high-end autonomy level, but also at the foundational Advanced Driver Assistance Systems (ADAS) level where low-power, safety-critical sensing can have broad impact. Neuromorphic vision provides a promising starting point: HD Dynamic Vision Sensors (DVS) can operate below 100 mW at the sensor level by reporting only asynchronous brightness changes. However, low-power sensing alone is insufficient if downstream perception reintroduces dense, energy-intensive computation. In particular, many event-driven object-detection pipelines still rely on CNN backbones, while purely spiking alternatives often trade away accuracy or ignore deployment constraints. We introduce ObstacleSense, a highly compact, CNN-free hybrid ANN–SNN framework for Level 0–1 forward-corridor obstacle awareness. Instead of performing full-scene object detection with a convolutional feature backbone, ObstacleSense targets the safety-critical question of whether the ego corridor is occupied and how far the nearest obstacle is. The architecture combines polarity-conditioned event encoding, lightweight temporal spiking dynamics, axial spatial mixing, and coarse-to-fine range estimation within a regular fixed-grid compute pattern. This design avoids the dense CNN backbone commonly used in event-based detection while maintaining a small state footprint suitable for eventual small-FPGA deployment. Before hardware mapping, we evaluate the software implementation using a model-side power proxy derived from MACs, weight and activation traffic, and spiking state updates under shared FP16 assumptions. On simulated CARLA event corpora, the deployment-oriented model achieves 0.9464 objectness F1, 0.9978 grid-level mAP, and 0.8987 m distance Mean Absolute Error at an estimated 1.92 mW proxy cost, while maintaining performance on unseen generalization test sequences.

Johnson-Scott, Zac [ORNL]↗

SDE_quark

This program provides a fixed-grid quadrature algorithm to compute integrals in the self-energy of the quark propagator within the Maris-Tandy model. The quark propagator both on t he spacelike real axis and at complex-valued momenta is determined from its Schwinger-Dyson equation (SDE). We first apply an iterative solver to find the quark propagator on the spacelike real axis. The propagator at complex-valued momenta is then computed from its self-energy based on this solution, where demanding integrals are encountered. In order to compute of these integrals, we apply customized variable transformations for the radial integral after subtracting the asymptotics. We subsequently apply an optional compound of quadrature rules for the angular integral.

Jia, Shaoyang↗

New Capabilities for Sampling Tools

This report will discuss new capabilities that have been added to the sample.py and uniform_sampler.py codes. The codes have been updated to allow for both log-uniform sampling and categorical variables. The categorical variables do not have to be numeric. The different values for a categorical variable are specified in a limits file by having spaces between them. The difference between sample.py and uniform_sampler.py is that sample.py is for generating random samples and uniform_sampler.py is for generating samples or points on a fixed grid. After sourcing a file to set the environment, execute the codes with the commands: sample.py and uniform sampler.py .

97 MATHEMATICS AND COMPUTING↗