Search NASA⌕ Search

SEARCH · Search NASA

Results for “IMPLICIT PHYSICS ALGORITHMS”

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 55 records · Page 3

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗

Solving Two-Equation Turbulence Models With a Perspective on Solving Transport Equations

There are three principal objectives of this report. The first objective is to investigate frequently used two-equation models when solving the RANS equations. In this study, we consider the 2006Wilcox and the 2003 Menter Shear Stress Transport (SST) models. Also, a simple change of the Wilcox model is introduced to improve computational predictions for transonic flows. Computations for flows over two different airfoils are examined to compare these turbulence models. Effects on modeling the physics of each flow due to variations in the models, such as using either strainrate or vorticity in the turbulence production term, are considered and discussed. The second objective of this report is to not only explore but also evaluate the performance of the solution algorithm for the mean flow and the transport equations. The RANS and turbulence modeling equations aresolved in a weakly coupled manner with a diagonal implicit Runge-Kutta (DIRK) solution algorithm. Throughout this report, emphasis is given to reducing the residuals to machine zero in all flow calculations, so as to eliminate the error due to numerical integration of the discrete governing equations. The final objective is to provide a perspective on solving transport equations for turbulence modeling. Aspects of solving such stiff systems of equations, as well as various numerical difficulties and possible techniques to overcome them, are considered. Discussion is also provided concerning what is called ’numerical compatibility’, which is an essential requirement when designing a solution algorithm for solving transport equations.

turbulence modeling↗

A robust fourth-order finite-difference discretization for the strongly anisotropic transport equation in magnetized plasmas

We propose a second-order temporally implicit, fourth-order-accurate spatial discretization scheme for the strongly anisotropic heat transport equation characteristic of hot, fusion-grade plasmas. Following Du Toit et al. (2018), the scheme transforms mixed-derivative diffusion fluxes (which are responsible for the lack of a discrete maximum principle) into nonlinear advective fluxes, amenable to nonlinear-solver-friendly monotonicity-preserving limiters. The scheme enables accurate multi-dimensional heat transport simulations with up to seven orders of magnitude of heat-transport-coefficient anisotropies with low cross-field numerical error pollution and excellent algorithmic performance, with the number of linear iterations scaling very weakly with grid resolution and grid anisotropy, and scaling with the square-root of the implicit timestep. We propose a multigrid preconditioning strategy based on a lower-order approximation that renders the scheme efficient and scalable under grid refinement. Several numerical tests are presented that display the expected spatial convergence rates and strong algorithmic performance, including fully nonlinear magnetohydrodynamics simulations of kink instabilities in a Bennett pinch in 2D helical geometry and of ITER in 3D toroidal geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational techniques for high-speed flows with viscous and chemical effects

Algorithms for solving the Euler and the Navier-Stokes equations in conjunction with chemical kinetic equations are presented. The convective flux is estimated from a quasi one dimensional interpolation procedure. Shock, contact, and expansion waves and thermochemical nonequilibrium phenomena are captured by the Lax-Friedrichs technique. Relaxation techniques were developed to enhance their effectiveness in dealing with spatial and temporal stiffness associated with the physical problems. Both explicit and implicit smoothers were implemented into the standard multigrid time stepping method. Unsteady and steady scalar problems are discussed. A perfect gas and equilibrium air shock tube problem is investigated. Numerical schemes and techniques are compared for the problems of shock and boundary layer interaction and three dimensional viscous, nonequilibrium flow encompassing an aerobrake. The results are comparable in accuracy against other high order non-oscillatory techniques. The multigrid methods are assessed using a Mach 8 flow over a complete planar body, a sphere, and a blunt delta wing at 20 deg incidence. Applying an implicit multigrid method on a nested grid of 128 by 64 nodes the reduction factor is 0.25. The central processing unit reduction factor is 2.2 after both the single and multigrid Runge-Kutta solutions converged to machine zero on a grid of 37 by 41 by 73 nodes.

Li, C. P.↗

A multigrid and upwind viscous flow solver on 3-D embedded and overlapped grids

A numerically efficient method is presented for solving the three-dimensional governing equations of the viscous compressible flow about complex configurations with topologically different components. The physical domain is decomposed into regions for which the grid generation is relatively simple and virtually with no significant restrictions. The Navier-Stokes equations are solved by an implicit, approximately factored, upwind, finite-volume scheme. The block inversions and the diagonalized scalar inversions of the coefficient matrices are modified to allow the holes created in the computational domain by the embedded and overlapped grids. The convergence is accelerated by a multigrid algorithm despite the existence of such holes. The solution for s supersonic flow past a blunt-nose-cylinder at high angle-of-attack is obtained using a C-O grid embedded in a global Cartesian grid.

Baysal, Oktay↗

A Comparison of Three Programming Models for Adaptive Applications

We study the performance and programming effort for two major classes of adaptive applications under three leading parallel programming models. We find that all three models can achieve scalable performance on the state-of-the-art multiprocessor machines. The basic parallel algorithms needed for different programming models to deliver their best performance are similar, but the implementations differ greatly, far beyond the fact of using explicit messages versus implicit loads/stores. Compared with MPI and SHMEM, CC-SAS (cache-coherent shared address space) provides substantial ease of programming at the conceptual and program orchestration level, which often leads to the performance gain. However it may also suffer from the poor spatial locality of physically distributed shared data on large number of processors. Our CC-SAS implementation of the PARMETIS partitioner itself runs faster than in the other two programming models, and generates more balanced result for our application.

Shan, Hong-Zhang↗

Unsteady transonic Navier-Stokes computations for an oscillating wing using single and multiple zones

Modern jet transports and maneuvering tactical fighters operating in the transonic regime often give rise to time-dependent fluid physics that interact with flexible structural components, e.g., vortical flow, shocks, and separation. Efficient computational fluid dynamic (CFD) methods are required to study such computationally intensive problems. In this work a numerical method is presented to address this problem. Time-dependent, compressible, Navier-Stokes equations are used to simulate unsteady transonic flow about a three-dimensional rigid wing undergoing a forced periodic motion in angle of attack. An efficient, implicit, diagonal algorithm is utilized because of its low operation count per time step compared to other methods that solve systems of block matrix equations. The formal time accuracy is addressed theoretically and demonstrated numerically by comparison of computational results with experimental data. A zonal grid approach, capable of treating complex geometries, is presented and its time accuracy is demonstrated by comparing a zonal computation with a single grid computation and experimental data.

Chaderjian, Neal M.↗

A comparative modeling of supernova 1993J

The light curve of Supernova 1993J is calculated using two computational radiation transport approaches. The two approaches are represented by the computer codes STELLA and EDDINGTON. The emphasis is on the shock breakout and the photometry in the U, B and V bands during the first 120 days of the supernova. The STELLA model includes implicit hydrodynamics and is able to model early supernova evolution before the expansion is homologous. The STELLA model employs multi-group photonics and is able to follow the radiation as it decouples from the matter. The EDDINGTON code uses an algorithm for integrating the transport equation which assumes homologous expansion and uses a finer frequency resolution. The agreement between the two codes is considered to be satisfactory only in the case where compatible physical assumptions are made concerning the opacity. The assumptions are justified. The continuum spectrum for SN 1993J is predicted near the shock breakout to be superior to that predicted by standard single energy group hydrocodes. The uncertainties involved in current time dependent models of supernova light curves are discussed.

Blinnikov, Sergei↗

Numerical simulation of a subsonic jet in a crossflow

The aerodynamic/propulsive interaction between a subsonic jet exhausting perpendicularly through a flat plate into a crossflow is investigated numerically using an approximately factored, partially flux-split, implicit solver for the three-dimensional, thin-layer Navier-Stokes equations. This algorithm is applied to flows with a range of jet-to-crossflow velocity ratios between 4 and 8. The computations model the jet trajectory, the contrarotating vortex pair and the wake region near the plate downstream of the jet orifice. Both qualitative and quantitative agreement with the existing experimental database are demonstrated. Flow visualization is instructive for understanding the physics of this flowfield.

Roth, Karlin R.↗

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗

Implicit Formulation of Muscle Dynamics in OpenSim

Astronauts lose bone and muscle mass during spaceflight. Exercise countermeasure is the primary method for counteracting bone and muscle mass loss in space. New spacecraft exercise device concepts are currently being developed for the NASAs new crew exploration vehicle. The NASA Digital Astronaut Project (DAP) uses computational modeling to help determine if the new exercise devices will be effective as countermeasures. The NASA Digital Astronaut Project is developing the ability to utilize predictive simulation to provide insight into the change in kinematics and kinetics with a change in device and gravitational environment (1-g versus 0-g). For example, in space exercise the subject's body weight is applied in addition to the loads prescribed for musculoskeletal maintenance. How and where these loads are applied obviously directly impacts bone and tissue loads. Additionally, due to space vehicle structural requirements, exercise devices are often placed on vibration isolation systems. This changes the apparent impedance or stiffness of the device as seen by the user. Data collection under these conditions is often impractical and limited. Predictive modeling provides a means to have a virtual subject to test hypotheses. Predictive simulation provides a virtual subject for which we are able to perform studies such as sensitivity to device loading and vibration isolation without the need for laboratory kinematic or kinetic test data.Direct Collocation optimization provides an efficient means to perform task based optimization and predictive modeling. It is relatively straight forward to structure a physical exercise task in a Direct Collocation mathematical formulation: perform a motion such that you start at an initial pose, achieve a given amount of deflection i.e a squat, return to the initial pose, and minimize muscle activation cost. Direct Collocation is advantageous in that it does not require numerical integration to evaluate the objective function. Instead, the system dynamics are transformed to discrete time and the optimizer is constrained such that the solution is not considered to be a valid unless the dynamic equations are satisfied at all time points. The simulation and optimization are effectively done simultaneously. Due to the implicit integration, time steps can be more coarse than in a differential equation solver. In a gait scenario this means that that the model constraints and cost function are evaluated at 100 nodes in the gait cycle versus 10,000 integration steps in a variable-step forward dynamic simulation. Furthermore, no time is wasted on accurate simulations of movements that are far from the optimum. Constrained optimization algorithms require a Jacobian matrix that contains the partial derivatives of each of the dynamic constraints with respect to of each of the state and control variables at all time points. This is a large but sparse matrix. An implicit dynamics formulation requires computation of the dynamic residuals f as a function of the states x and their derivatives, and controls u:f(x, dxdt, u) 0If the dynamics of musculoskeletal system are formulated implicitly, the Jacobian elements are often available analytically, eliminating the need for numerical differentiation; this is obviously computationally advantageous. Additionally, implicit formulation of musculoskeletal dynamics do not suffer from singularities from low mass bodies, zero muscle activation, or other stiff system or

physical exercise↗

Parametric study of grid size, time step and turbulence modeling on Navier-Stokes computations over airfoils

An upwind-biased implicit approximate factorization algorithm is applied to several steady and unsteady turbulent flows. The thin layer form of the compressible Navier-Stokes equation is used. Both the flux vector splitting and flux difference splitting methods are used to determine fluxes, and the results are compared. Flux difference splitting predicts results more accurately than flux vector splitting on a given mesh size, but, in its present implementation, is more severely limited by the maximum CFL number for unsteady time accurate flows. Physical aspects of the computations are also examined. An equilibrium turbulent boundary layer model computes generally better steady and unsteady results than a nonequilibrium model when there is little to no boundary layer separation. Conversely, when a significant region of separation exists, the nonequilibrium model performs in better agreement with experiment.

Rumsey, Christopher L.↗

Modeling supersonic combustion using a fully-implicit numerical method

A fully-implicit finite-volume algorithm for two-dimensional axisymmetric flows has been coupled to a detailed hydrogen-air reaction mechanism (13 species and 33 reactions) so that supersonic combustion phenomena may be investigated. Numerical computations are compared with ballistic-range shadowgraphs of Lehr (1972) that exhibit two discontinuities caused by a blunt body as it passes through a premixed stoichiometric hydrogen-air mixture. The suitability of the numerical procedure for simulating these double-front flows is shown. The requirements for the physical formulation and the numerical modeling of these flowfields are discussed. Finally, the sensitivity of these external flowfields to changes in certain key reaction rate constants is examined.

Maccormack, Robert W.↗

Scalable 3D reconstruction for X-ray single particle imaging with online machine learning

X-ray free-electron lasers offer unique capabilities for measuring the structure and dynamics of biomolecules, helping us understand the basic building blocks of life. Notably, high-repetition-rate free-electron lasers enable single particle imaging, where individual, weakly scattering biomolecules are imaged under near-physiological conditions with the opportunity to access fleeting states that cannot be captured in cryogenic or crystallized conditions. Existing X-ray single particle reconstruction algorithms, which estimate the particle orientation for each image independently, are slow and memory-intensive when handling the massive datasets generated by emerging free-electron lasers. Here, we introduce X-RAI (X-Ray single particle imaging with Amortized Inference), an online reconstruction framework that estimates the structure of 3D macromolecules from large X-ray single particle datasets. X-RAI consists of a convolutional encoder, which amortizes pose estimation over large datasets, as well as a physics-based decoder, which employs an implicit neural representation to enable high-quality 3D reconstruction in an end-to-end, self-supervised manner. We demonstrate that X-RAI achieves state-of-the-art performance for small-scale datasets in simulation and challenging experimental settings and demonstrate its unprecedented ability to process large datasets containing millions of diffraction images in an online fashion. These abilities signify a paradigm shift in X-ray single particle imaging towards real-time reconstruction.

Computer science↗

Effects of bleed-hole geometry and plenum pressure on three-dimensional shock-wave/boundary-layer/bleed interactions

A numerical study was performed to investigate 3D shock-wave/boundary-layer interactions on a flat plate with bleed through one or more circular holes that vent into a plenum. This study was focused on how bleed-hole geometry and pressure ratio across bleed holes affect the bleed rate and the physics of the flow in the vicinity of the holes. The aspects of the bleed-hole geometry investigated include angle of bleed hole and the number of bleed holes. The plenum/freestream pressure ratios investigated range from 0.3 to 1.7. This study is based on the ensemble-averaged, 'full compressible' Navier-Stokes (N-S) equations closed by the Baldwin-Lomax algebraic turbulence model. Solutions to the ensemble-averaged N-S equations were obtained by an implicit finite-volume method using the partially-split, two-factored algorithm of Steger on an overlapping Chimera grid.

Chyu, Wei J.↗

Efficient Preconditioning of a High-Order Solver for Multiple Physics

This work addresses preconditioning approaches for an implicit high-order solver frame-work applied to multiple physics. The solver is based on a space-time spectral element method and matrix-free Newton-Krylov solver developed at NASA over the recent years. Within this context, most preconditioning methods are impractical, as the computational time and memory requirements scale poorly with increasing polynomial orders. To improve computational efficiency, we first describe a novel entity-based Block Jacobi preconditioner for the continuous-Galerkin solution of the linear-elasticity and linear-shell equations. Second, we introduce a multigrid algorithm to further reduce time-to-solution on stiff cases arising from continuous-and discontinuous-Galerkin discretizations. Results obtained on relevant single-physics reference solutions, demonstrate the feasibility of the methods, paving the way for high-order solutions of fully coupled multi-physics problems.

STMD↗

Implicit flux-split schemes for the Euler equations

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Thomas, J. L.↗

Model-based Hierarchical Reinforcement Learning for Improved Physical Security Design: A Prototype

Prior work in FY24 developed an adversarial AI agent aid in path analysis of physical protection systems. This agent, trained using a model-based reinforcement learning algorithm, was able to successfully learn the most vulnerable path in facilities. It was able to extend the current state of practice for physical protection design by exhibiting dynamic behavior based on current environmental conditions. Whereas PathTrace largely performs a static, graph-based analysis, the AI agent was able to make decisions based on relative position in the facility, current conditions (was the adversarial agnet discovered?), and proximity to secondary targets. The agent demonstrated some novel capabilities, but had limitations that need to be resolved before it can be used for production purposes. For example, the adversarial agent generalizes poorly and takes a relatively long time to train. Nonetheless, there is still considerable promise for developing the adversarial agent further in order to explore even richer, more dynamic behaviors (e.g., adversary motivations, environmental debris, and more). This work considers a complementary idea; development of a planning agent. The planning agent is envisioned as an auto-complete-like tool that can help accelerate security system design by human experts. The agent would respect existing barriers and sensors placed by a human expert while offering cost-effective suggestions (i.e., implicitly balancing effectiveness with cost) to improve the design. The goal is for this agent to be part of an expert’s toolbox, not to totally upend the current state-of-practice, or to displace human experts. The ultimate goal would be concurrent training of both the adversarial and planning agent together, to learn entirely through self-play. This would represent an entirely new way of performing system deign. We selected a hierarchical, model-based reinforcement learning algorithm to serve as the planning agent. This is an extension of concepts used in the prior FY24 adversarial agent work. There, we had a single agent acting an environment. Here, we have two different sub-agents (policies), working together, to form a complete agent. There is a manager policy, which can select abstract goals on slower time scales, and a worker, which performs primitive actions to reach goals selected by the manager. It is worth noting that this class of algorithm is challenging to work with. From our understanding, our work is one of the first successful uses of model-based reinforcement learning (MBRL) in nuclear energy1 , and likely the first hierarchical model-based reinforcement learning application in nuclear energy. Further, this work is one of the first known attempts to apply AI to perform a design tasks in nuclear energy. Consequently, there were significant implementation challenges and the bulk of the work was focused on successful implementation and algorithm design. The results presented here are very low technology readiness level as a consequence of the lack of related literature, but still represent a significant step forward in the pursuit of applied AI for design.

42 ENGINEERING↗