Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Dynamic substructuring by the boundary flexibility vector method of component mode synthesis

Component mode synthesis (CMS) is a method of dynamic analysis, for structures having a large number of degrees of freedom (DOF). These structures often required lengthy computer CPU time and large computer memory resources, if solved directly by the finite-element method (FEM). In CMS, the structure is divided into independent components in which the DOF are defined by a set of generalized coordinates defined by displacement shapes. The number of the generalized coordinates are much less than the original number of physical DOF, in the component. The displacement shapes are used to transform the component property matrices and any applied external loads, to a reduced system of coordinates. Reduced system property matrices are assembled, and any type of dynamic analysis is carried out in the reduced coordinate system. Any obtained results are back transformed to the original component coordinate systems. In all conventional methods of CMS, the mode shapes used for components are dynamic mode shapes, supplemented by static deflected shapes. Historically, all the dynamic mode shapes used in conventional CMS are the natural modes (eigenvectors) of components. A new method of CMS, namely the boundary flexibility vector method of CMS, is presented. The method provides for the incorporation of a set of static Ritz vectors, referred to as boundary flexibility vectors, as a replacement and/or supplement to conventional eigenvectors, as displacement shapes for components. The generation of these vectors does not require the solution of a costly eigenvalue problem, as in the case of natural modes in conventional CMS, and hence a substantial saving in CPU time can be achieved. The boundary flexibility vectors are generated from flexibility (or stiffness) properties of components. The formulation presented is for both free and fixed-interface components, and for both the free and forced vibration problems. Free and forced vibration numerical examples are presented to verify the accuracy of the method and the saving in CPU time. Compared to conventional methods of CMS, the results indicate that by using the new method, more accurate results can be obtained with a substantial saving in CPU time.

Abdallah, Ayman Ahmed↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
NASA NTRS1989

Thickening oscillation of a delta wing using Navier-Stokes and Navier-displacement equations

The problem of unsteady, supersonic, locally conical, vortical flow around a delta wing undergoing thickening oscillation is solved using the unsteady, thin-layer Navier-Stokes equations and the unsteady linearized Navier-displacement equations. The unsteady, thin-layer Navier-Stokes equations are solved using the implicit approximate-factorization finite-volume scheme to compute the conservative components of the flow vector field. With the conservative components known at any time step, the linearized, Navier-displacement equations are solved using the alternating, direction-implicit scheme to obtain the grid points displacements due to known displacement boundary conditions. A grid-displacements limiter, in the form of a low mesh Reynolds number, is used to limit grid-folding in regions of highly reversed flow.

Chuang, Hsin-Kung A.↗
NASA NTRS1978

Applied Routh approximation

The Routh approximation technique for reducing the complexity of system models was applied in the frequency domain to a 16th order, state variable model of the F100 engine and to a 43d order, transfer function model of a launch vehicle boost pump pressure regulator. The results motivate extending the frequency domain formulation of the Routh method to the time domain in order to handle the state variable formulation directly. The time domain formulation was derived and a characterization that specifies all possible Routh similarity transformations was given. The characterization was computed by solving two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given. Additional computational problems are discussed, including an optimization procedure that can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗
NASA NTRS1987

Use of a minimum rate of change formalism to quantify variability of extragalactic X-ray sources

A method to obtain rigorous, quantitative constraints on the rate of variability is suggested. The method is motivated by the case when the existence of time variability is unequivocal, but the statistical uncertainties are too large to apply more direct methods such as power spectrum analysis. Conceptually the data are fitted to a function of time and a set of free parameters. The method of Lagrange multipliers is used to solve for that parameter set which minimizes the value of the derivative at time t(m). The result can be related physically to the minimum efficiency with which rest mass must be converted to radiation energy. Slightly different formulations of the general principal are used to estimate maximum source size scales associated with the variability.

Schwartz, Daniel A.↗
NASA NTRS1991

Time-dependent solutions of viscous incompressible flows in moving co-ordinates

A time-accurate solution method for the incompressible Navier-Stokes equations in generalized moving coordinates is presented. A finite-volume discretization method that satisfies the geometric conservation laws for time-varying computational cells is used. The discrete equations are solved by a fractional-step solution procedure. The solution is second-order-accurate in space and first-order-accurate in time. The pressure and the volume fluxes are chosen as the unknowns to facilitate the formulation of a consistent Poisson equation and thus to obtain a robust Poisson solver with favorable convergence properties. The method is validated by comparing the solutions with other numerical and experimental results. Good agreement is obtained in all cases.

Rosenfeld, Moshe↗
NASA NTRS1994

On the nonlinear stability of viscous modes within the Rayleigh problem on an infinite flat plate

The stability has been investigated of the unsteady flow past an infinite flat plate when it is moved impulsively from rest, in its own plane. For small times the instantaneous stability of the flow depends on the linearized equations of motion which reduce in this problem to the Orr-Sommerfeld equation. It is known that the flow for certain values of Reynolds number, frequency and wave number is unstable to Tollmien-Schlichting waves, as in the case of the Blasius boundary layer flow past a flat plate. With increase in time, the unstable waves only undergo growth for a finite time interval, and this growth rate is itself a function of time. The influence of finite amplitude effects is studied by solving the full Navier-Stokes equations. It is found that the stability characteristics are markedly changed both by the consideration of the time evolution of the flow, and by the introduction of finite amplitude effects.

Webb, J. C.↗
DOE OSTI2021

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗
DOE OSTI2023

Anticipating gelation and vitrification with medium amplitude parallel superposition (MAPS) rheology and artificial neural networks

Abstract Anticipating qualitative changes in the rheological response of complex fluids (e.g., a gelation or vitrification transition) is an important capability for processing operations that utilize such materials in real-world environments. One class of complex fluids that exhibits distinct rheological states are soft glassy materials such as colloidal gels and clay dispersions, which can be well characterized by the soft glassy rheology (SGR) model. We first solve the model equations for the time-dependent, weakly nonlinear response of the SGR model. With this analytical solution, we show that the weak nonlinearities measured via medium amplitude parallel superposition (MAPS) rheology can be used to anticipate the rheological aging transitions in the linear response of soft glassy materials. This is a rheological version of a technique called structural health monitoring used widely in civil and aerospace engineering. We design and train artificial neural networks (ANNs) that are capable of quickly inferring the parameters of the SGR model from the results of sequential MAPS experiments. The combination of these data-rich experiments and machine learning tools to provide a surrogate for computationally expensive viscoelastic constitutive equations allows for rapid experimental characterization of the rheological state of soft glassy materials. We apply this technique to an aging dispersion of Laponite ® clay particles approaching the gel point and demonstrate that a trained ANN can provide real-time detection of transitions in the nonlinear response well in advance of incipient changes in the linear viscoelastic response of the system.

Lennon, Kyle R. (ORCID:0000000212515461)↗
DOE OSTI2024

Eco-driving Profile Optimization by Dynamic Programming for Battery Electric Vehicles

Although full automation has not yet been achieved, automated vehicles are a valid research area. Not only would automated vehicles provide ultimate driver convenience, but they would maximize energy efficiency by eliminating undesired human driving behaviors and optimally controlling the powertrain. From the perspective of control related to energy saving, speed profile optimization is important for improving system efficiency and satisfying passenger demands. This study employs Dynamic Programming (DP) to solve the constrained optimal problem for travel time, distance, and speed limit by exploring all possible control options. The solutions obtained by DP demonstrate consistent control patterns combining four control modes-acceleration, cruising, coasting, and braking, with cruising or coasting being selective depending on the boundary conditions. Further, this study introduces DP-based simulation results and attempts to provide comprehensive interpretations of the optimal policy by analyzing the essential factors that affect the control problem, including boundary conditions, road load, and powertrain characteristics. Based on these interpretations, the control concepts can be explained as the optimal policy selecting the best control option based on system efficiency and boundary conditions. The results of DP are compared with a human-like driver model to show that the optimal speed profiles can effectively reduce energy consumption.

Autonomous vehicles↗
DOE OSTI2021

Analytic quasi-steady evolution of marginally unstable kinetic plasma instabilities in the presence of drag and scattering

The 1D bump-on-tail problem is studied in order to determine the influence of drag on quasi-steady solutions near marginal stability (1-γ d /γ L << 1) when effective collisions are much larger than the instability growth rate (ν>>γ). In this common tokamak regime, it is rigorously shown that the paradigmatic Berk–Breizman cubic equation for the nonlinear mode evolution reduces to a much simpler differential equation, dubbed the time-local cubic equation, which can be solved directly. It is found that in addition to increasing the saturation amplitude, drag introduces a shift in the apparent oscillation frequency by modulating the saturated wave envelope. Furthermore, excellent agreement is found between the analytic solution for the mode evolution and both the numerically integrated Berk–Breizman cubic equation and fully nonlinear 1D Vlasov simulations. Experimentally isolating the contribution of drag to the saturated mode amplitude for verification purposes is explored but complicated by the reality that the amount of drag cannot be varied independently of other key parameters in realistic scenarios. While the influence of drag is modest when the ratio of effective drag to effective scattering α/ν is very small, it can become substantial when α/ν ≳ 0.5, suggesting that drag should be accounted for in quantitative models of fast-ion-driven instabilities in fusion plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Limits on clustering and smooth quintessence from the EFTofLSS

We apply the Effective Field Theory of Large-Scale Structure (EFTofLSS) to analyze cosmological models with clustering quintessence, which allows us to consistently describe the parameter region in which the quintessence equation of state w < -1. First, we extend the description of biased tracers in redshift space to the presence of clustering quintessence, and compute the one-loop power spectrum. We solve the EFTofLSS equations using the exact time dependence, which is relevant to obtain unbiased constraints. Then, fitting the full shape of BOSS pre-reconstructed power spectrum measurements, the BOSS post-reconstruction BAO measurements, BAO measurements from 6DF/MGS and eBOSS, the Supernovae from Pantheon, and a prior from BBN, we bound the clustering quintessence equation of state parameter w = -1.011 -0.048 +0.053 at 68% C.L. Further combining with Planck, we obtain w = -1.028 -0.030 +0.037 at 68% C.L. We also obtain constraints on smooth quintessence, in the physical regime w ≥ -1: combining all datasets, we get -1 ≤ w < -0.979 at 68% C.L. These results strongly support a cosmological constant.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Numerically modeling stochastic inflation in slow-roll and beyond

In this work, we present a complete numerical treatment of inflationary dynamics under the influence of stochastic corrections from sub-Hubble modes. We discuss how to exactly model the stochastic noise terms arising from the sub-Hubble quantum modes that give rise to the coarse-grained inflaton dynamics in the form of stochastic differential equations. The stochastic differential equations are solved event by event on a discrete time grid. We then compute the power spectrum of curvature perturbations that can be compared with the power spectrum computed in the traditional fashion using the Mukhanov-Sasaki equation by canonically quantizing the inflaton fluctuations. Our numerical procedure helps us to easily extend the formalism to ultra slow-roll inflation and study the possibility of primordial black hole formation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Reinforcement Learning via Gaussian Processes with Neural Network Dual Kernels

While deep neural networks (DNNs) and Gaussian Processes (GPs) are both popularly utilized to solve problems in reinforcement learning, both approaches feature undesirable drawbacks for challenging problems. DNNs learn complex non-linear embeddings, but do not naturally quantify uncertainty and are often data-inefficient to train. GPs infer posterior distributions over functions, but popular kernels exhibit limited expressivity on complex and high-dimensional data. Fortunately, recently discovered conjugate and neural tangent kernel functions encode the behavior of overparameterized neural networks in the kernel domain. We demonstrate that these kernels can be efficiently applied to regression and reinforcement learning problems by analyzing a baseline case study.We apply GPs with neural network dual kernels to solve reinforcement learning tasks for the first time. We demonstrate, using the well understood mountain-car problem, that GPs empowered with dual kernels perform at least as well as those using the conventional radial basis function kernel. Finally, we conjecture that by inheriting the probabilistic rigor of GPs and the powerful embedding properties of DNNs, GPs using NN dual kernels will empower future reinforcement learning models on difficult domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Novel Results Visualization for Dynamic PSA and New Modeling Features in EMRALD

The Event Modeling Risk Assessment Linked Diagram (EMRALD) tool, developed at the Idaho National Laboratory (INL), was designed to simplify the creation of dynamic models and support various research projects. One of the primary goals of EMRALD was to provide visual methods for modeling. EMRALD consists of two main components: a web-based user interface for model development and a solve engine for running model simulations. Over time, it has evolved to meet the diverse needs of its users. Initially, EMRALD's results were simple text outputs with final key state percentages and uncertainty bounds. However, because EMRALD utilizes a three-phase discrete event simulation and tracks the paths of each simulation run leading to a key state, there is significant potential to analyze large sets of path results data, including state paths, events, and timing. Visualizing this data meaningfully posed a challenge. To address this, a novel time-based Sankey diagram was developed. EMRALD exports results data in a format that can be opened in this Sankey viewer, allowing users to visualize paths, occurrences, events, and probability data for the entire simulation run in a single diagram. Moreover, when EMRALD was first created, there were limited tools capable of meeting its graphical requirements, many of which are no longer supported. In 2024, a new web-based interface was developed using modern graphing tools, enabling additional modeling features. This paper discusses the new dynamic PSA results visualization capability and the enhanced modeling tools available in EMRALD.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Nuclear Thermal Rocket Emulator for a Hardware-in-the-Loop Test Bed

To support NASA’s mission to use nuclear thermal rockets for future Mars missions, an instrumentation and control test bed has been built at Oak Ridge National Laboratory. The system is designed as a hardware-in-the-loop test bed for testing control elements and autonomous control algorithms for nuclear thermal propulsion rockets. The mock reactor system consists of a modular and scalable framework, using inexpensive components and open-source software. The hardware system consists of a two-phase flow loop and a mock reactor with six control drums. A single-board computer (NVIDIA Jetson) handles reactor core emulation and hosts a message queuing telemetry transport broker that allows user-deployed control algorithms to interact with the system hardware. The reactor emulator receives sensor data from the hardware and provides the simulated performance of the reactor under steady-state, transient, and fault conditions. The emulator uses a reactivity lookup table and the point kinetics equations to solve for the reactor dynamics in real time. Emulated reactor dynamics and sensor input inform the autonomous control algorithm’s decision-making in a closed-loop manner. The current system is capable of operating at 10 Hz, but faster cycle rates are an area of ongoing research. This test bed will enable NASA and other space vendors to rigorously test their autonomous control systems for NTP rockets under transient (reactor startup and shutdown), steady-state, and fault conditions to reduce development time and risk for autonomous control systems in future missions.

autonomous control↗
NASA NTRS1970

Dynamic characteristics of a variable-mass flexible missile

The general motion of a variable mass flexible missile with internal flow and aerodynamic forces is considered. The resulting formulation comprises six ordinary differential equations for rigid body motion and three partial differential equations for elastic motion. The simultaneous differential equations are nonlinear and possess time-dependent coefficients. The differential equations are solved by a semi-analytical method leading to a set of purely ordinary differential equations which are then solved numerically. A computer program was developed for the numerical solution and results are presented for a given set of initial conditions.

Meirovitch, L.↗