Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time discretization”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Translating MAPGEN to ASPEN for MER

This software translates MAPGEN (Europa and APGEN) domains to ASPEN, and the resulting domain can be used to perform planning for the Mars Exploration Rover (MER). In other words, this is a conversion of two distinct planning languages (both declarative and procedural) to a third (declarative) planning language in order to solve the problem of faithful translation from mixed-domain representations into the ASPEN Modeling Language. The MAPGEN planning system is an example of a hybrid procedural/declarative system where the advantages of each are leveraged to produce an effective planner/scheduler for MER tactical planning. The adaptation of the planning system (ASPEN) was investigated, and, with some translation, much of the procedural knowledge encoding is amenable to declarative knowledge encoding. The approach was to compose translators from the core languages used for adapting MAGPEN, which consists of Europa and APGEN. Europa is a constraint- based planner/scheduler where domains are encoded using a declarative model. APGEN is also constraint-based, in that it tracks constraints on resources and states and other variables. Domains are encoded in both constraints and code snippets that execute according to a forward sweep through the plan. Europa and APGEN communicate to each other using proxy activities in APGEN that represent constraints and/or tokens in Europa. The composition of a translator from Europa to ASPEN was fairly straightforward, as ASPEN is also a declarative planning system, and the specific uses of Europa for the MER domain matched ASPEN s native encoding fairly closely. On the other hand, translating from APGEN to ASPEN was considerably more involved. On the surface, the types of activities and resources one encodes in APGEN appear to match oneto- one to the activities, state variables, and resources in ASPEN. But, when looking into the definitions of how resources are profiled and activities are expanded, one sees code snippets that access various information available during planning for the moment in time being planned to decide at the time what the appropriate profile or expansion is. APGEN is actually a forward (in time) sweeping discrete event simulator, where the model is composed of code snippets that are artfully interleaved by the engine to produce a plan/schedule. To solve this problem, representative code is simulated as a declarative series of task expansions. Predominantly, three types of procedural models were translated: loops, if statements, and code blocks. Loops and if statements were handled using controlled task expansion, and code blocks were handled using constraint networks that maintained the generation of results based on what the order of execution would be for a procedural representation. One advantage with respect to performance for MAPGEN is the use of APGEN s GUI. This GUI is written in C++ and Motif, and performs very well for large plans.

Rabideau, Gregg R.↗
NASA NTRS2016

Overview of the NASA Glenn Flux Reconstruction Based High-Order Unstructured Grid Code

A computational fluid dynamics code based on the flux reconstruction (FR) method is currently being developed at NASA Glenn Research Center to ultimately provide a large- eddy simulation capability that is both accurate and efficient for complex aeropropulsion flows. The FR approach offers a simple and efficient method that is easy to implement and accurate to an arbitrary order on common grid cell geometries. The governing compressible Navier-Stokes equations are discretized in time using various explicit Runge-Kutta schemes, with the default being the 3-stage/3rd-order strong stability preserving scheme. The code is written in modern Fortran (i.e., Fortran 2008) and parallelization is attained through MPI for execution on distributed-memory high-performance computing systems. An h- refinement study of the isentropic Euler vortex problem is able to empirically demonstrate the capability of the FR method to achieve super-accuracy for inviscid flows. Additionally, the code is applied to the Taylor-Green vortex problem, performing numerous implicit large-eddy simulations across a range of grid resolutions and solution orders. The solution found by a pseudo-spectral code is commonly used as a reference solution to this problem, and the FR code is able to reproduce this solution using approximately the same grid resolution. Finally, an examination of the code's performance demonstrates good parallel scaling, as well as an implementation of the FR method with a computational cost/degree- of-freedom/time-step that is essentially independent of the solution order of accuracy for structured geometries.

High-Order Methods↗
NASA NTRS2018

High-Order Stabilized Finite Elements on Dynamic Meshes

The development of dynamic mesh capability for turbulent flow simulations using the Streamlined Upwind Petrov-Galerkin (SUPG) discretization is described. The current work extends previous research to include high-order spatial accuracy, including the satisfaction of the discrete geometric conservation law (GCL) on curved elements. Two closely-related schemes are described and the ability of these schemes to satisfy the GCL, while also maintaining temporal accuracy and conservation is assessed. Studies indicate that although one scheme discretizes the time derivative in conservative form, both schemes exhibit temporal conservation errors that decrease according to the expected design order of accuracy. The source of the temporal conservation errors is examined, and it is demonstrated that many finite-volume and finite-element schemes can also be expected to have difficulty strictly satisfying conservation in time. The effects on conservation are examined and, while present in the simulations, are seen to be negligible for the problems considered.

Anderson, W. Kyle↗
NASA NTRS1972

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗
NASA NTRS2018

A Higher-Order Space-Time Finite-Element Method for Moving-Body and Fluid-Structure Interaction Problems

We present a high-order finite-element method for moving body and fluid/structure interaction problems. Our solution strategy is based on a space-time discontinuous Galerkin (DG) spectral-element discretization which extends to arbitrary order of accuracy. The space-time DG discretization is a natural choice for moving body and fluid-structure interaction problems as moving surfaces are incorporated simply by considering curved space-time elements whose space-time faces align with the moving body. We present a discontinuous-Galerkin in time discretization for six-degree of motion modeling of rigid bodies, and a continuous-Galerkin discretization for equations of linear elasticity to generate curved space-time meshes. Numerical results for several simple 2D test cases are presented in order to verify the implementation of the different models. Finally we present a preliminary dynamic simulation of a parachute.

High-Order↗
NASA NTRS2013

High-Order Space-Time Methods for Conservation Laws

Current high-order methods such as discontinuous Galerkin and/or flux reconstruction can provide effective discretization for the spatial derivatives. Together with a time discretization, such methods result in either too small a time step size in the case of an explicit scheme or a very large system in the case of an implicit one. To tackle these problems, two new high-order space-time schemes for conservation laws are introduced: the first is explicit and the second, implicit. The explicit method here, also called the moment scheme, achieves a Courant-Friedrichs-Lewy (CFL) condition of 1 for the case of one-spatial dimension regardless of the degree of the polynomial approximation. (For standard explicit methods, if the spatial approximation is of degree p, then the time step sizes are typically proportional to 1/p(exp 2)). Fourier analyses for the one and two-dimensional cases are carried out. The property of super accuracy (or super convergence) is discussed. The implicit method is a simplified but optimal version of the discontinuous Galerkin scheme applied to time. It reduces to a collocation implicit Runge-Kutta (RK) method for ordinary differential equations (ODE) called Radau IIA. The explicit and implicit schemes are closely related since they employ the same intermediate time levels, and the former can serve as a key building block in an iterative procedure for the latter. A limiting technique for the piecewise linear scheme is also discussed. The technique can suppress oscillations near a discontinuity while preserving accuracy near extrema. Preliminary numerical results are shown

Huynh, H. T.↗
NASA NTRS1989

Multi-grid for structures analysis

In structural analysis the amount of computational time necessary for a solution is proportional to the number of degrees of freedom times the bandwidth squared. In implicit time analysis, this must be done at each discrete point in time. If, in addition, the problem is nonlinear, then this solution must be iterated at each point in time. If the bandwidth is large, the size of the problem that can be analyzed is severely limited. The multi-grid method is a possible algorithm which can make this solution much more computationally efficient. This method has been used for years in computational fluid mechanics. It works on the fact that relaxation is very efficient on the high frequency components of the solution (nearest neighbor interactions) and not very good on low frequency components of the solution (far interactions). The multi-grid method is then to relax the solution on a particular model until the residual stops changing. This indicates that the solution contains the higher frequency components. A coarse model is then generated for the lower frequency components to the solution. The model is then relaxed for the lower frequency components of the solution. These lower frequency components are then interpolated to the fine model. In computational fluid mechanics the equations are usually expressed as finite differences.

Kascak, Albert F.↗
NASA NTRS2013

Discrete Data Qualification System and Method Comprising Noise Series Fault Detection

A Sensor Data Qualification (SDQ) function has been developed that allows the onboard flight computers on NASA s launch vehicles to determine the validity of sensor data to ensure that critical safety and operational decisions are not based on faulty sensor data. This SDQ function includes a novel noise series fault detection algorithm for qualification of the output data from LO2 and LH2 low-level liquid sensors. These sensors are positioned in a launch vehicle s propellant tanks in order to detect propellant depletion during a rocket engine s boost operating phase. This detection capability can prevent the catastrophic situation where the engine operates without propellant. The output from each LO2 and LH2 low-level liquid sensor is a discrete valued signal that is expected to be in either of two states, depending on whether the sensor is immersed (wet) or exposed (dry). Conventional methods for sensor data qualification, such as threshold limit checking, are not effective for this type of signal due to its discrete binary-state nature. To address this data qualification challenge, a noise computation and evaluation method, also known as a noise fault detector, was developed to detect unreasonable statistical characteristics in the discrete data stream. The method operates on a time series of discrete data observations over a moving window of data points and performs a continuous examination of the resulting observation stream to identify the presence of anomalous characteristics. If the method determines the existence of anomalous results, the data from the sensor is disqualified for use by other monitoring or control functions.

Fulton, Christopher↗
NASA NTRS2001

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special non-deteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of 'non-reflecting kernels,' nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The non-deteriorating algorithm, which is the core of the new ABCs is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals, and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimension spaces, It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the non-modified scheme. In the paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABCs' algorithm.

Ryabenkii, V. S.↗
NASA NTRS2015

Detection and Modeling of High-Dimensional Thresholds for Fault Detection and Diagnosis

Many Fault Detection and Diagnosis (FDD) systems use discrete models for detection and reasoning. To obtain categorical values like oil pressure too high, analog sensor values need to be discretized using a suitablethreshold. Time series of analog and discrete sensor readings are processed and discretized as they come in. This task isusually performed by the wrapper code'' of the FDD system, together with signal preprocessing and filtering. In practice,selecting the right threshold is very difficult, because it heavily influences the quality of diagnosis. If a threshold causesthe alarm trigger even in nominal situations, false alarms will be the consequence. On the other hand, if threshold settingdoes not trigger in case of an off-nominal condition, important alarms might be missed, potentially causing hazardoussituations. In this paper, we will in detail describe the underlying statistical modeling techniques and algorithm as well as the Bayesian method for selecting the most likely shape and its parameters. Our approach will be illustrated by several examples from the Aerospace domain.

Computer Systems↗
NASA NTRS1990

An initial test of a normative Figure Of Merit for the quality of overall task performance

An overall indicator, or Figure Of Merit (FOM), of the quality of crew/vehicle system performance is needed to establish the effect of workload on efficiency and to identify overload conditions. A normative FOM is proposed in which performance is measured on a representative task and a normative data base obtained. FOMs for subsequent executions of the task are then reported in terms of weighted deviations from average task performance. Performance of discrete tasks is measured primarily in terms of subtask time and errors. Discrete task performance is then combined with a measure of continuous vehicle control. In order to test the normative FOM procedure, the technique was applied to an existing set of data from a simulated landing task in which standard communications with ATC was compared with a data link communications system. The results indicated that while mean task performance was not affected, task variability, as measured by the FOM, was significantly higher when data link communications were used. In order to establish the sensitivity of the normative FOM method, further testing of the measure is recommended.

Lemay, Moira↗
NASA NTRS1993

Near-field supersonic flow predictions by an adaptive unstructured tetrahedral grid solver

Applicability of a three-dimensional solution adaptive unstructured tetrahedral Euler flow solver about generic models for near-field sonic boom pressure signature predictions is evaluated. Comparisons of computational and experimental data demonstrates the capability of the method for predicting inviscid solutions useful for high speed calculations about simple 3-D geometries. The approach has promising features and results indicate potential for application to more complex configurations. The mesh generation is based on the advancing front technique, and steady state solutions of the Euler equations are achieved by explicit time integration. Spatial discretization uses the Taylor-Galerkin approach; an alternate time integration, based on the Runge-Kutta method, is also included. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry-adaptive grid procedure has also been incorporated.

Djomehri, M. J.↗
NASA NTRS1996

Discrete Deterministic and Stochastic Petri Nets

Petri nets augmented with timing specifications gained a wide acceptance in the area of performance and reliability evaluation of complex systems exhibiting concurrency, synchronization, and conflicts. The state space of time-extended Petri nets is mapped onto its basic underlying stochastic process, which can be shown to be Markovian under the assumption of exponentially distributed firing times. The integration of exponentially and non-exponentially distributed timing is still one of the major problems for the analysis and was first attacked for continuous time Petri nets at the cost of structural or analytical restrictions. We propose a discrete deterministic and stochastic Petri net (DDSPN) formalism with no imposed structural or analytical restrictions where transitions can fire either in zero time or according to arbitrary firing times that can be represented as the time to absorption in a finite absorbing discrete time Markov chain (DTMC). Exponentially distributed firing times are then approximated arbitrarily well by geometric distributions. Deterministic firing times are a special case of the geometric distribution. The underlying stochastic process of a DDSPN is then also a DTMC, from which the transient and stationary solution can be obtained by standard techniques. A comprehensive algorithm and some state space reduction techniques for the analysis of DDSPNs are presented comprising the automatic detection of conflicts and confusions, which removes a major obstacle for the analysis of discrete time models.

MATHEMATICAL MODELS↗
NASA NTRS1991

Comparison of advanced reduced-basis methods for transient structural analysis

Two advanced reduced-basis methods for linear, transient structural analysis, the force-derivative method and the Lanczos method, are compared to two widely-used modal methods, the mode-displacement method and the mode-acceleration method. Comparisons are made for two linear example problems: a proportionally-damped cantilevered beam subject to a discrete tip load which varies linearly with time, and a discretely-damped multispan beam subject to a uniformly distributed load which varies as a quintic function of time. Results from the methods are compared in terms of the number of basis vectors required to obtain a desired level of accuracy and the associated computational times. The results are problem dependent, and it is shown that for the cantilevered beam problem, the mode-acceleration and force-derivative methods are the most efficient in terms of the number of basis vectors and computational time. The force-derivative method is shown to be the most effective method for solving the multispan beam problem with closely-spaced frequencies. In general, the force-derivative method is shown to produce an accurate solution using very few basis vectors and to require less computational time as compared to the other methods studied.

Mcgowan, David M.↗
NASA NTRS1996

BPSK Demodulation Using Digital Signal Processing

A digital communications signal is a sinusoidal waveform that is modified by a binary (digital) information signal. The sinusoidal waveform is called the carrier. The carrier may be modified in amplitude, frequency, phase, or a combination of these. In this project a binary phase shift keyed (BPSK) signal is the communication signal. In a BPSK signal the phase of the carrier is set to one of two states, 180 degrees apart, by a binary (i.e., 1 or 0) information signal. A digital signal is a sampled version of a "real world" time continuous signal. The digital signal is generated by sampling the continuous signal at discrete points in time. The rate at which the signal is sampled is called the sampling rate (f(s)). The device that performs this operation is called an analog-to-digital (A/D) converter or a digitizer. The digital signal is composed of the sequence of individual values of the sampled BPSK signal. Digital signal processing (DSP) is the modification of the digital signal by mathematical operations. A device that performs this processing is called a digital signal processor. After processing, the digital signal may then be converted back to an analog signal using a digital-to-analog (D/A) converter. The goal of this project is to develop a system that will recover the digital information from a BPSK signal using DSP techniques. The project is broken down into the following steps: (1) Development of the algorithms required to demodulate the BPSK signal; (2) Simulation of the system; and (3) Implementation a BPSK receiver using digital signal processing hardware.

Garcia, Thomas R.↗
NASA NTRS1998

Creep Life of Ceramic Components Using a Finite-Element-Based Integrated Design Program (CARES/CREEP)

The desirable properties of ceramics at high temperatures have generated interest in their use for structural application such as in advanced turbine engine systems. Design lives for such systems can exceed 10,000 hours. The long life requirement necessitates subjecting the components to relatively low stresses. The combination of high temperatures and low stresses typically places failure for monolithic ceramics in the creep regime. The objective of this paper is to present a design methodology for predicting the lifetimes of structural components subjected to creep rupture conditions. This methodology utilizes commercially available finite element packages and takes into account the time-varying creep strain distributions (stress relaxation). The creep life, of a component is discretized into short time steps, during which the stress and strain distributions are assumed constant. The damage is calculated for each time step based on a modified Monkman-Grant creep rupture criterion. Failure is assumed to occur when the normalized accumulated damage at any point in the component is greater than or equal to unity. The corresponding time will be the creep rupture life for that component. Examples are chosen to demonstrate the Ceramics Analysis and Reliability Evaluation of Structures/CREEP (CARES/CREEP) integrated design program, which is written for the ANSYS finite element package. Depending on the component size and loading conditions, it was found that in real structures one of two competing failure modes (creep or slow crack growth) will dominate. Applications to benchmark problems and engine components are included.

Powers, L. M.↗