Search NASA⌕ Search

SEARCH · Search NASA

Results for “explicit solution”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Machine-learning based model reduction for partial differential equations

We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The superconformal index and black hole instabilities

The superconformal index of $\mathcal{N}$ = 4 supersymmetric Yang-Mills theory with gauge group U(N) has provided powerful insights into the entropy of supersymmetric black holes in AdS 5 × S 5 , including some sub-leading logarithmic and non-perturbative corrections. Recently, the phase space of supersymmetric solutions has been argued to contain configurations other than the asymptotically AdS 5 black hole. Such configurations include the so-called grey galaxies where the black hole at the center is surrounded by a gas of gravitons. By numerically evaluating the superconformal index of $\mathcal{N}$ = 4 supersymmetric Yang-Mills at small values of N, we detect systematic deviations from the entropy of black holes with two distinct angular momenta. We find that the giant graviton expansion of the index is a numerically efficient way of evaluating the index that complements the direct character evaluation and allows for explicit access to N ≤ 15 with up to two giant gravitons in the expansion. We find it remarkable that a supersymmetric quantity in field theory, usually thought of as a rigid counting observable, indeed contains information about different phases in the space of supersymmetric solutions on the gravity side.

AdS-CFT correspondence↗
NASA NTRS1986

Euler solutions using an implicit multigrid technique

A coarse-grid correction algorithm has been implemented into an implicit upwind Euler solver and tested for transonic airfoil problems. The Euler solver uses split-flux formulation and penta-diagonal scalar equations, respectively, for the explicit and implicit operators. The multigrid sequence starts at the fine grid level, then steps down to each coarse grid level to smooth error components using implicit operators. Estimate of residuals can be obtained by two approaches, which differ in the level where the residuals are collected. Both approaches will lead to a work reduction factor of 12 for a Mach 0.75 flow at 2 degrees incidence on a 65x26 grid. The work reduction factor is found to increase proportional to the number of grid levels.

Li, Chien-Peng↗
NASA NTRS1989

Explicit and implicit calculations of turbulent cavity flows with and without yaw angle

Computations were performed to simulate turbulent supersonic flows past three-dimensional deep cavities with and without yaw. Simulation of these self-sustained oscillatory flows were generated through time accurate solutions of the Reynolds averaged complete Navier-Stokes equations using two different schemes: (1) MacCormack, finite-difference; and (2) implicit, upwind, finite-volume schemes. The second scheme, which is approximately 30 percent faster, is found to produce better time accurate results. The Reynolds stresses were modeled, using the Baldwin-Lomax algebraic turbulence model with certain modifications. The computational results include instantaneous and time averaged flow properties everywhere in the computational domain. Time series analyses were performed for the instantaneous pressure values on the cavity floor. The time averaged computational results show good agreement with the experimental data along the cavity floor and walls. When the yaw angle is nonzero, there is no longer a single length scale (length-to-depth ratio) for the flow, as is the case for zero yaw angle flow. The dominant directions and inclinations of the vortices are dramatically different for this nonsymmetric flow. The vortex shedding from the cavity into the mainstream flow is captured computationally. This phenomenon, which is due to the oscillation of the shear layer, is confirmed by the solutions of both schemes.

Yen, Guan-Wei↗
NASA NTRS2001

Characterizing Aeroelastic Systems Using Eigenanalysis, Explicitly Retaining The Aerodynamic Degrees of Freedom

Discrete time aeroelastic models with explicitly retained aerodynamic modes have been generated employing a time marching vortex lattice aerodynamic model. This paper presents analytical results from eigenanalysis of these models. The potential of these models to calculate the behavior of modes that represent damped system motion (noncritical modes) in addition to the simple harmonic modes is explored. A typical section with only structural freedom in pitch is examined. The eigenvalues are examined and compared to experimental data. Issues regarding the convergence of the solution with regard to refining the aerodynamic discretization are investigated. Eigenvector behavior is examined; the eigenvector associated with a particular eigenvalue can be viewed as the set of modal participation factors for that particular mode. For the present formulation of the equations of motion, the vorticity for each aerodynamic element appears explicitly as an element of each eigenvector in addition to the structural dynamic generalized coordinates. Thus, modal participation of the aerodynamic degrees of freedom can be assessed in M addition to participation of structural degrees of freedom.

Heeg, Jennifer↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
DOE OSTI2021

First Principles Simulations of Electrified Interfaces in Electrochemistry

This chapter discusses some of the recent advances made in the first principles modeling of electrochemical catalysts. It also discusses the key development, namely the ability to explicitly treat the effects of surface electrification due to electrochemical processes and applied voltages in a computationally efficient manner. The chapter introduces the thermodynamics and statistical mechanics of electrified metal-solution interfaces. It then discusses the structure of the electrode-electrolyte interface and the effects of applied voltages, followed by an overview of the first-principles model and a motivating example. The chapter also provides a brief summary of classical thermodynamics and describes the basics of thermodynamic detour. It considers the thermodynamics of macroscopic systems and introduces several useful fundamental relations. Here, the chapter also considers a system to exist in a certain macrostate, which is a particular thermodynamic state specified by a set of fixed properties such as constant particle number, constant volume, and constant temperature.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Coordinate transformation and construction of finite element mesh in a diverted tokamak geometry

A coordinate transformation technique between straight magnetic field line coordinate system (Ψ, θ) and Cartesian coordinate system (R, Z) is presented employing a Solov'ev solution of the Grad-Shafranov equation. Employing the equilibrium solution, the poloidal magnetic flux Ψ(R, Z) of a diverted tokamak, magnetic field line equation is solved computationally to find curves of constant poloidal angle θ, which provides us with explicit relations R = R(Ψ, θ) and Z = Z(Ψ, θ). Correspondingly, conversion from one coordinate to the other along particle trajectories in the vicinity of separatrix is demonstrated. Based on the magnetic structure, a finite element mesh is generated in a diverted tokamak geometry to solve Poisson's equation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Approximation of refrigerant thermophysical properties using neural networks to speed up transient thermofluid simulations

Accurate and efficient evaluations of refrigerant thermophysical properties and their partial derivatives are essential for transient simulations of thermofluid systems, where several computations need to be executed at each integration time step. Since the utilization of an Equation of State for retrieving properties based on a pair of independent inputs typically involves numerical iterations in solution procedures, when the input variables differ from the refrigerant state variables employed in dynamic models, a variety of approaches including lookup table interpolation and curve fitting have been developed to explicitly approximate these properties based on the state variables, and consequently eliminate internal iterations. This paper presents an alternative method that exploits derivative-informed neural networks to model refrigerant properties explicitly from inputs of pressure and enthalpy, while ensuring consistent partial derivatives generated by differentiating the neural networks. Computational speed and accuracy of the proposed approach are demonstrated via transient simulations of a discretized heat exchanger model in Modelica, and comparisons against other property evaluation routines. Simulation results indicate that the proposed approach can realize a significant speedup with negligible discrepancies in predicted transients. The method is implemented in an open-source Modelica library.

Ma, Jiacheng↗
DOE OSTI2021

Analytical modeling for redox flow battery design

Deeper market penetration of redox flow batteries requires optimization of the cell performance. Though important for optimization, detailed analytical solutions have not been developed for electrolyte flow, mass and charge transport, and reaction kinetics within redox flow batteries. To this end, here we present analytical solutions to active species concentration and over-potential based on advection-diffusion transport for ions and Bulter-Volmer model for interface reaction kinetics. The solutions were validated with results from a finite element model. These solutions were then applied to investigate the relationship between over-potential and state of charge, current density, reaction rate constant, flow velocity, diffusivity, total active species concentration, and electrode structure. Explicit formulas were identified for minimum activation over-potential and limiting current density as well as their dependence on electrolyte properties, operation conditions, and electrode structure. With our new mathematical formulas, this work provides a theoretical framework for flow battery design.

25 ENERGY STORAGE↗
DOE OSTI2022

Bifurcation Buckling Analysis and Non-Linear Collapse Analysis of Teardrop Shaped Vacuum Chamber

The Spallation Neutron Source (SNS) accelerator is being upgraded to increase the beam power from 1.4MW at 1GeV to 2.8MW at 1.3GeV. The currents in the middle two injection chicane magnets cannot simply be scaled up to accommodate the increased injection energy of 1.3GeV due to potential excessive H- stripping; the magnets must be replaced with longer, lower-field magnets and the associated vacuum chambers need to be redesigned. A new teardrop-shaped vacuum chamber was initially designed to accommodate the new magnets and the updated beam paths and instrumentation. This paper focuses on the structural stability study of the teardrop shape vacuum chamber based on buckling analysis. Protection against collapse from buckling according to the ASME BPVC requirement has been evaluated in depth. First, a Type-1 bifurcation buckling analysis using a linear eigenvalue solution to determine the critical load factor was performed. Subsequently, a Type-3 nonlinear collapse analysis was conducted using the static Riks method with elastic-plastic material properties and imperfections explicitly considered in the model geometry. The critical buckling load for the teardrop shape vacuum chamber was confidently estimated based upon this two-stage approach.

Jiang, Hao↗
DOE OSTI2022

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Workshop on Improving Holdup Monitoring in the US

The characterization and quantification of nuclear deposits, or residual nuclear material retained in process equipment, generally referred to as holdup, continues to challenge nuclear processing facilities in DOE program areas such as nuclear criticality safety, material control and accountability, environmental management. The efficiency and effectiveness of nuclear operations in these facilities depends heavily on the results from nondestructive techniques designed to measure nuclear materials in situ. The traditional methods used to measure holdup were established more than 30 years ago and assume unrealistic conditions for most measurement cases. These blind, in situ measurements present unique challenges due to the following attributes: unique, non-ideal geometries; unknown deposit thicknesses; lack of representative calibration standards; large number of holdup deposit locations; and poor accessibility for many measurement locations. These difficulties and the poor assumptions made to handle them have resulted in measurement uncertainties that are often too large for many programs to effectively utilize. In an effort to address and identify solutions to the current holdup challenges facing the US nuclear industry, Oak Ridge National Laboratory hosted the Technical Workshop on Improving Holdup Monitoring in the US. The two-day workshop held August 21–22, 2019, was attended by 35 holdup measurement practitioners, program managers, stakeholders from US Department of Energy sites, the Nuclear Regulatory Commission, and representatives from commercial industry. The primary objectives were to identify critical elements of a successful and defensible holdup measurement program; identify technical challenges, needs, and potential improvements associated with measurement of holdup; and share best practices and lessons learned from recent accumulation events. Fourteen presentations were delivered on holdup topics including necessary elements for effective program management, measurement needs, emerging technologies and other measurement solutions, and lessons learned from recent events. These presentations highlighted best practices related to accumulation monitoring, considerations and proactive steps to facilitate holdup in new facility designs, imaging solutions to improve holdup assumptions, and new software developed in support of holdup measurements. Breakout sessions were also employed to determine additional needs and identify potential solutions to common holdup challenges. The primary discussions focused on causes and prevention of material accumulations, needs for uranium and plutonium measurements, and reduction of measurement uncertainty, all of which were explicitly identified as critical needs during the 2018 Workshop on Technical and Programmatic Needs for a Sustainable NDA Program for the US DOE.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1975

A numerical scheme to solve unstable boundary value problems

A new iterative scheme for solving boundary value problems is presented. It consists of the introduction of an artificial time dependence into a modified version of the system of equations. Then explicit forward integrations in time are followed by explicit integrations backwards in time. The method converges under much more general conditions than schemes based in forward time integrations (false transient schemes). In particular it can attain a steady state solution of an elliptical system of equations even if the solution is unstable, in which case other iterative schemes fail to converge. The simplicity of its use makes it attractive for solving large systems of nonlinear equations.

Kalnay Derivas, E.↗
NASA NTRS1984

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces.

Mastin, E. W.↗
NASA NTRS1992

Developing A Navier-Stokes Algorithm For Supercomputers

Report discusses development of algorithm for solution of Navier-Stokes equations of flow on parallel-processing supercomputers. Involves combination of prior techniques to form algorithm to compute flows in complicated three-dimensional configurations. Includes explicit finite-difference numerical-integration scheme applicable to flows represented by hierarchy of mathematical models ranging from Euler to full Navier-Stokes. Of interest to researchers looking for ways to structure problems for greater computational efficiency.

Swisshelm, Julie M.↗
NASA NTRS1993

A nonlinear control design for energy sink simulation in the Euler-Poinsot problem

A nonlinear control design is presented for the purpose of quantitatively simulating the effects of internal damping mechanisms modeled as energy sinks on the attitude dynamics of rigid body spacecraft. Damping is important because it is often the driving mechanism behind passive attitude acquisition maneuvers. Introduction of the controller into the Euler attitude equations of motion allows for the explicit representation of damping without the introduction of additional degrees of freedom required for a physical damping mechanism. This result is significant because perturbation techniques which rely on the closed form solution of the unperturbed problem can then be used to analyze the effects of perturbations upon a damped system. The controller is designed to dissipate kinetic energy while maintaining the magnitude of the angular momentum vector. Control torques are nonlinear functions of the angular momentum components expressed in a body-fixed frame. A numerical simulation of an actual damping mechanism during a decay from minor axis spin into a flat spin is presented showing that the nonlinear controller gives a good qualitative representation and, in many instances, a good quantitative approximation of the attitude motion of a representative spacecraft containing a damping mechanism.

Kammer, Daniel C.↗
NASA NTRS1987

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel↗