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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

An Analysis of Delay and Travel Times at Sao Paulo International Airport (AISP/GRU): Planning Based on Simulation Model

The occurrence of flight delays in Brazil, mostly verified at the ground (airfield), is responsible for serious disruptions at the airport level but also for the unchaining of problems in all the airport system, affecting also the airspace. The present study develops an analysis of delay and travel times at Sao Paulo International Airport/ Guarulhos (AISP/GRU) airfield based on simulation model. Different airport physical and operational scenarios had been analyzed by means of simulation. SIMMOD Plus 4.0, the computational tool developed to represent aircraft operation in the airspace and airside of airports, was used to perform these analysis. The study was mainly focused on aircraft operations on ground, at the airport runway, taxi-lanes and aprons. The visualization of the operations with increasing demand facilitated the analyses. The results generated in this work certify the viability of the methodology, they also indicated the solutions capable to solve the delay problem by travel time analysis, thus diminishing the costs for users mainly airport authority. It also indicated alternatives for airport operations, assisting the decision-making process and in the appropriate timing of the proposed changes in the existing infrastructure.

Santana, Erico Soriano Martins↗
DOE OSTI2022

Applying Crystallography and 19 F NMR to investigate dynamics and partner protein interactions in a long chain Flavodoxin

Flavodoxin (Fld) is a small FMN containing protein that is involved in single electron transfer. The long‐chain flavodoxin in Rhodopseudomonas palustris bacteria replaces ferredoxin as a low‐potential electron carrier when iron is scarce. Thus it is proposed to interact with the bifurcating electron transfer flavoprotein (ETF) that yields low‐potential electrons. A surface loop on Fld interacts with another of Fld's partner proteins, so we hypothesize that it also mediates Fld's interaction with ETF. To monitor interactions with ETF directly and investigate dynamics in this loop, we are using 19 F NMR in solution. 19 F is hyperresponsive to changes in its chemical environment with a chemical shift range of >300 ppm. To provide a static reference point and assess structural heterogeneity, we are also exploiting X‐ray crystallography. In this study we selectively fluorinated the five tyrosine residues in Fld. We obtained resonance assignments from 19 F spectra of Fld variants in which individual tyrosine residues have been replaced. We obtain well resolved signals for each residue, but the resonances' linewidths indicate dynamics that affects some resonances more than others. Y90 residue displays two resonances demonstrating two different conformations that interconvert slowly on an NMR time scale. Meanwhile the crystal structure solved at 2.1Å resolution reveals two molecules per asymmetric unit providing two perspectives on the details of the structure. The crystal symmetry is monoclinic in contrast to most of the other Flds, which are orthorhombic. Interestingly, the long loop bearing Y121 and Y123 is not well resolved in chain B of the crystal structure, and the NMR line of Y123 is exceptionally broad, both indicating that the loop is dynamic and capable of altering its conformation to accomodate binding to a partner protein. Future directions include monitoring the changes in the 19 F NMR of the Fld when titrated with the partner protein, temperature dependence of the NMR spectrum and relaxation studies to evaluate time scales of motions.

Khan, Sharique↗
NASA NTRS1980

The Eddington limit and supercritical accretion. I - Time-independent calculations

Spherically symmetric, steady state accretion of an ionized hydrogen plasma onto a neutron star is considered for accretion rates which exceed a critical rate at which the Eddington limiting luminosity is produced. The coupled hydrodynamic and frequency integrated, radiative transfer equations are solved for accretion rates up to 10 times the nominal limit. Steady state solutions are presented that imply a multiplicity of different luminosity solutions for a single accretion rate in this 'supercritical' regime.

Burger, H. L.↗
NASA NTRS1989

Finite element modeling of electromagnetic fields and waves using NASTRAN

The various formulations of Maxwell's equations are reviewed with emphasis on those formulations which most readily form analogies with Navier's equations. Analogies involving scalar and vector potentials and electric and magnetic field components are presented. Formulations allowing for media with dielectric and conducting properties are emphasized. It is demonstrated that many problems in electromagnetism can be solved using the NASTRAN finite element code. Several fundamental problems involving time harmonic solutions of Maxwell's equations with known analytic solutions are solved using NASTRAN to demonstrate convergence and mesh requirements. Mesh requirements are studied as a function of frequency, conductivity, and dielectric properties. Applications in both low frequency and high frequency are highlighted. The low frequency problems demonstrate the ability to solve problems involving media inhomogeneity and unbounded domains. The high frequency applications demonstrate the ability to handle problems with large boundary to wavelength ratios.

Moyer, E. Thomas, Jr.↗
NASA NTRS1989

Hopf bifurcation in the driven cavity

Incompressible two dimensional calculations are reported for the impulsively started lid driven cavity with aspect ratio two. The algorithm is based on the time dependent streamfunction equation, with a Crank-Nicolson differencing scheme for the diffusion terms, and with an Adams-Bashforth scheme for the convection terms. A multigrid method is used to solve the linear implicit equations at each time step. Periodic asymptotic solutions have been found for Re = 10000 and for Re = 5000. The Re = 5000 results are validated by grid refinement calculations. The solutions are shown to be precisely periodic, and care is taken to demonstrate that asymptotic states were reached. A discussion is included about the indicators that are used to show that an asymptotic state was reached, and to show that the asymptotic state is indeed periodic.

Goodrich, John W.↗
NASA NTRS1992

Direct numerical simulations of a spatially developing plane wake

In the present paper, direct numerical methods by which to simulate the spatially developing free shear flows in the transitional region are described and the numerical results of a spatially developing plane wake are presented. The incompressible time-dependent Navier-Stokes equations were solved using Pade finite difference approximations in the streamwise direction, a mapped pseudospectral Fourier method in the cross-stream direction, and a third-order compact Runge-Kutta scheme for time advancement. The unstable modes of the Orr-Sommerfeld equations were used to perturb the inlet of the wake. Statistical analyses were performed and some numerical results were compared with experimental measurements. When only the fundamental mode is forced, the energy spectra show amplification of the fundamental and its higher harmonics. In this case, unperturbed alternate vortices develop in the saturation region of the wake. The phase jitter around the fundamental frequency plays a critical role in generating vortices of random shape and spacing. Large- and small-scale distortions of the fundamental structure are observed. Pairing of vortices of the same sign is observed, as well as vortex coupling of vortices of the opposite sign.

Maekawa, Hiroshi↗
NASA NTRS1993

Robust fuel- and time-optimal control of uncertain flexible space structures

The problem of computing open-loop, fuel- and time-optimal control inputs for flexible space structures in the face of modeling uncertainty is investigated. Robustified, fuel- and time-optimal pulse sequences are obtained by solving a constrained optimization problem subject to robustness constraints. It is shown that 'bang-off-bang' pulse sequences with a finite number of switchings provide a practical tradeoff among the maneuvering time, fuel consumption, and performance robustness of uncertain flexible space structures.

Wie, Bong↗
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scaling and adiabaticity in a rapidly expanding gluon plasma

In this work we aim to gain qualitative insight on the far-from-equilibrium behavior of the gluon plasma produced in the early stages of a heavy-ion collision. It was recently discovered [1] that the distribution functions of quarks and gluons in QCD effective kinetic theory (EKT) exhibit self-similar “scaling” evolution with time-dependent scaling exponents long before those exponents reach their pre-hydrodynamic fixed-point values. In this work we shed light on the origin of this time-dependent scaling phenomenon in the small-angle approximation to the Boltzmann equation. We first solve the Boltzmann equation numerically and find that time-dependent scaling is a feature of this kinetic theory, and that it captures key qualitative features of the scaling of hard gluons in QCD EKT. We then proceed to study scaling analytically and semi-analytically in this equation. We find that an appropriate momentum rescaling allows the scaling distribution to be identified as the instantaneous ground state of the operator describing the evolution of the distribution function, and the approach to the scaling function is described by the decay of the excited states. That is to say, there is a frame in which the system evolves adiabatically. Furthermore, from the conditions for adiabaticity we can derive evolution equations for the time-dependent scaling exponents. In addition to the known free-streaming and BMSS fixed points, we identify a new “dilute” fixed point when the number density becomes small before hydrodynamization. Corrections to the fixed point exponents in the small-angle approximation agree quantitatively with those found previously in QCD EKT and arise from the evolution of the ratio between hard and soft scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1992

Transient scattering from two-dimensional dielectric cylinders of arbitrary shape

In this work, the problem of transient scattering by arbitrary shaped two-dimensional dielectric cylinders is solved using the marching-on-in-time (MOT) technique. The dielectric problem is approached via the surface equivalence principle. A pair of coupled integral equations are derived by enforcing the continuity of the electric and magnetic fields which are solved by using the method of moments. Numerical results are presented for two cross sections, viz. a circle and a square, and compared with inverse discrete Fourier transform (IDFT) techniques. In each case, good agreement is obtained with the IDFT solution.

Vechinski, Douglas A.↗
NASA NTRS1997

Algorithms for Performance, Dependability, and Performability Evaluation using Stochastic Activity Networks

Modeling tools and technologies are important for aerospace development. At the University of Illinois, we have worked on advancing the state of the art in modeling by Markov reward models in two important areas: reducing the memory necessary to numerically solve systems represented as stochastic activity networks and other stochastic Petri net extensions while still obtaining solutions in a reasonable amount of time, and finding numerically stable and memory-efficient methods to solve for the reward accumulated during a finite mission time. A long standing problem when modeling with high level formalisms such as stochastic activity networks is the so-called state space explosion, where the number of states increases exponentially with size of the high level model. Thus, the corresponding Markov model becomes prohibitively large and solution is constrained by the the size of primary memory. To reduce the memory necessary to numerically solve complex systems, we propose new methods that can tolerate such large state spaces that do not require any special structure in the model (as many other techniques do). First, we develop methods that generate row and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix, permitting us to cache portions of the matrix and hence reduce the solution time. Finally, we develop a new memory and computationally efficient technique for Gauss-Seidel based solvers that avoids the need for generating rows of A in order to solve Ax = b. This is a significant performance improvement for on-the-fly methods as well as other recent solution techniques based on Kronecker operators. Taken together, these new results show that one can solve very large models without any special structure.

Deavours, Daniel D.↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
NASA NTRS1976

Time-asymptotic solutions of the Navier-Stokes equation for free shear flows using an alternating-direction implicit method

An uncoupled time asymptotic alternating direction implicit method for solving the Navier-Stokes equations was tested on two laminar parallel mixing flows. A constant total temperature was assumed in order to eliminate the need to solve the full energy equation; consequently, static temperature was evaluated by using algebraic relationship. For the mixing of two supersonic streams at a Reynolds number of 1,000, convergent solutions were obtained for a time step 5 times the maximum allowable size for an explicit method. The solution diverged for a time step 10 times the explicit limit. Improved convergence was obtained when upwind differencing was used for convective terms. Larger time steps were not possible with either upwind differencing or the diagonally dominant scheme. Artificial viscosity was added to the continuity equation in order to eliminate divergence for the mixing of a subsonic stream with a supersonic stream at a Reynolds number of 1,000.

Rudy, D. H.↗
NASA NTRSDate not supplied

Lessons Learned in Systems Engineering Availability and Recommendations for Mission Technical Leaders

In spaceflight missions at Goddard Space Flight Center (GSFC), the Mission System Engineer (MSE) is the technical leader of the overall engineering team and also is the Independent Engineering Technical Authority. The responsibility of this role includes the definition of the mission design architecture, concept of operations, and mission requirements, management of risk throughout the development, and verification and validation of the final system performance and function amongst other duties. This responsibility inherently requires time management, enabling focus on a balanced development with appropriate risk. Time is the most valuable resource of the MSE. The system engineer’s availability to interact with the development team (often product or component design leads and technicians, often in different worksites) to discover and mitigate mission risks during development is key to mission success. This paper presents examples from Lunar Reconnaissance Orbiter, Landsat 9, and Neutron star Interior Composition ExploreR (NICER) which represent in-house and out-of-house hardware builds. These examples demonstrate how interactions between the Mission Systems Engineers and other project and partner engineers result in discovery of critical risks, leading to early mitigation with significant cost and performance savings. These three missions would have suffered test failures or on-orbit failures had their MSEs not set aside time to visit engineers and technicians that were working on key pieces of space flight hardware. Availability is more than just time; it is openness to listen to concerns and questions. It begins by building a level of trust in the team that it is safe to ask questions or share concerns without the fear of blame or additional workload. It also requires enabling informal conversations (over lunch, coffee, in the clean room, or at the team members desk, etc.) where key information can be exchanged, and team members may even provide an easy-to-implement mitigation idea for another subsystem. Availability is a highly valuable commodity and completely non-obvious to protect and optimize. The natural tendency of engineers is to keep themselves busy with solving problems that they know about. This paper is encouraging MSEs to resist this tendency to try and solve all the complex problems themselves and actively devote daily time to learning and solving problems that are found with informal communications with other team members.

Lessons Learned↗
DOE OSTI2025

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Preconditioned methods for solving the incompressible and low speed compressible equations

The introduction of artificial time derivatives which permit faster convergence to the steady state is used to precondition steady state incompressible equation-solving acceleration methods. An optimal value is obtained for beta, given constant alpha, where alpha and beta are arbitrary functions in the general preconditioning stage. A symmetric hyperbolic system is formed by the resulting incompressible equations. Compressible equations in conservation form with slow flow are also considered.

Turkel, Eli↗
NASA NTRS2013

Optimal Integration of Departures and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations - spatial, temporal, and hybrid separations - were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buffer, spatial separation outperformed temporal separation when the uncertainty buffer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buffer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buffer sizes.

terminal airspace↗
NASA NTRS1993

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗