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 1,099 records · Page 61

Thermal mathematical modeling of a multicell common pressure vessel nickel-hydrogen battery

A two-dimensional and time-dependent thermal model of a multicell common pressure vessel (CPV) nickel-hydrogen battery was developed. A finite element solver called PDE/Protran was used to solve this model. The model was used to investigate the effects of various design parameters on the temperature profile within the cell. The results were used to help find a design that will yield an acceptable temperature gradient inside a multicell CPV nickel-hydrogen battery. Steady-state and unsteady-state cases with a constant heat generation rate and a time-dependent heat generation rate were solved.

Kim, Junbom↗

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Gibson, J. S.↗

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Gibson, J. S.↗

LEGION: Lightweight Expandable Group of Independently Operating Nodes

LEGION is a lightweight C-language software library that enables distributed asynchronous data processing with a loosely coupled set of compute nodes. Loosely coupled means that a node can offer itself in service to a larger task at any time and can withdraw itself from service at any time, provided it is not actively engaged in an assignment. The main program, i.e., the one attempting to solve the larger task, does not need to know up front which nodes will be available, how many nodes will be available, or at what times the nodes will be available, which is normally the case in a "volunteer computing" framework. The LEGION software accomplishes its goals by providing message-based, inter-process communication similar to MPI (message passing interface), but without the tight coupling requirements. The software is lightweight and easy to install as it is written in standard C with no exotic library dependencies. LEGION has been demonstrated in a challenging planetary science application in which a machine learning system is used in closed-loop fashion to efficiently explore the input parameter space of a complex numerical simulation. The machine learning system decides which jobs to run through the simulator; then, through LEGION calls, the system farms those jobs out to a collection of compute nodes, retrieves the job results as they become available, and updates a predictive model of how the simulator maps inputs to outputs. The machine learning system decides which new set of jobs would be most informative to run given the results so far; this basic loop is repeated until sufficient insight into the physical system modeled by the simulator is obtained.

Burl, Michael C.↗

Evolution of Plasmaspheric Refilling: A Comparison of Measurements with an Interhemispheric Plasmasphere Model

The evolution of plasmasphere is closely coupled to processes governing flux tube refilling and transport. In this study we follow this evolution through a series of sequential ion observations made by RIMS on the DE 1 satellite and with the intervening time intervals filled by simulations made with the FLIP model. The FLIP model solves the continuity and momentum equations for the major ion species as well as the energy equations for ions and electrons along entire flux tubes rom 100 k altitude in both hemispheres. Convection has recently been included, driven a dawn-dusk electric field model. Since the observations are necessarily restricted to two local time passes through the plasmasphere per orbit, the FLIP code will follow the observed flux tubes as they corotate and convect through the other local times. The period of DE 1 is such that nearly the same flux tubes are observed every second day or every sixth orbit. The composite of observations and simulations allows assessment of the degree to which the degree to which the FLIP simulations accurately describe the processes which govern flux tube refilling over the two-day period between observations of the same flux tubes.

Comfort, Richard H.↗

Data enhancement and analysis through mathematical deconvolution of signals from scientific measuring instruments

Mathematical deconvolution of digitized analog signals from scientific measuring instruments is shown to be a means of extracting important information which is otherwise hidden due to time-constant and other broadening or distortion effects caused by the experiment. Three different approaches to deconvolution and their subsequent application to recorded data from three analytical instruments are considered. To demonstrate the efficacy of deconvolution, the use of these approaches to solve the convolution integral for the gas chromatograph, magnetic mass spectrometer, and the time-of-flight mass spectrometer are described. Other possible applications of these types of numerical treatment of data to yield superior results from analog signals of the physical parameters normally measured in aerospace simulation facilities are suggested and briefly discussed.

Wood, G. M.↗

Effect of stratification and geometrical spreading on sonic boom rise time

The purpose of our investigation is to determine the effect of unsteadiness (not associated with turbulence) on rise time. The unsteadiness considered here is due to (1) geometrical spreading, (2) stratification, which includes variation in density, temperature, and relative humidity, and (3) N shaped waveform. A very general Burgers equation, which includes all these effects, is the propagation model for our study. The equation is solved by a new computational algorithm in which all the calculations are done in the time domain. The present paper is a progress report in which some of the factors contributing to unsteadiness are studied, namely geometrical spreading and variation in relative humidity. The work of Pierce and Kang, which motivated our study, is first reviewed. We proceed with a discussion of the Burgers equation model and the algorithm for solving the equation. Some comparison tests to establish the validity of the algorithm are presented. The algorithm is then used to determine the distance required for a steady-state shock, on encountering an abrupt change in relative humidity, to reach a new steady state based on the new humidity. It is found that the transition distance for plane shocks of amplitude 70 Pa is about 4 km when the change in relative humidity is 10 percent. Shocks of amplitude 140 Pa require less distance. The effect of spherical and cylindrical spreading is also considered. We demonstrate that a spreading shock wave never reaches steady state and that its rise time will be less than the equivalent steady state shock. Finally we show that an N wave has a slightly shorter rise time than a step shock of the same amplitude.

Cleveland, Robin O.↗

Fault tolerance of artificial neural networks with applications in critical systems

This paper investigates the fault tolerance characteristics of time continuous recurrent artificial neural networks (ANN) that can be used to solve optimization problems. The principle of operations and performance of these networks are first illustrated by using well-known model problems like the traveling salesman problem and the assignment problem. The ANNs are then subjected to 13 simultaneous 'stuck at 1' or 'stuck at 0' faults for network sizes of up to 900 'neurons'. The effects of these faults is demonstrated and the cause for the observed fault tolerance is discussed. An application is presented in which a network performs a critical task for a real-time distributed processing system by generating new task allocations during the reconfiguration of the system. The performance degradation of the ANN under the presence of faults is investigated by large-scale simulations, and the potential benefits of delegating a critical task to a fault tolerant network are discussed.

Protzel, Peter W.↗

Effects of Communication Delay on Human Spaceflight Missions

Missions onboard the International Space Station rely on the real-time availability of a large ground team of system experts to command the vehicle, solve safety-critical problems, and guide the crew during complex operations. Also, in Low Earth Orbit (LEO), supplies can be sent and crews evacuated quite quickly if needed. Future missions Beyond Low Earth Orbit (BLEO) will not have this 24/7, real-time safety net as communication latency increases, resupply difficulty increases, and evacuation opportunities diminish. There are few, if any, terrestrial analogs for human spaceflight missions BLEO that reflect the conditions—including extreme environments, long mission durations, and small crew sizes – that make these missions so high risk. Studies on specific conditions, such as communication delays and asynchronous interactions, have been performed in NASA Earth-based analog missions and have found that communication delays can disrupt ground-crew interactions and adversely impact team performance. However, there are gaps and limitations in studies conducted to date, notably on human spacecraft system failure response and recovery, the impacts of shorter lunar-relevant communication delays on complex operations, and the effectiveness of countermeasures. The work presented here breaks down real anomalies that occurred on ISS and Apollo missions and creates example scenarios fort Lunar Surface and Mars missions to explore the impact of communication delays of varying length on onboard operations and mission outcomes. Our analyses indicate that short communication delays (e.g., seconds to a minute) adversely impact the ability for ground to provide real-time oversight and guidance and to catch quickly emerging problems in time. Longer communication delays (e.g., up to 40 minutes on Mars missions) call for a shift of responsibility for tactical operations from ground to crew; crew must make time-critical decisions independently and respond to time-critical vehicle anomalies to prevent consequences.

human-systems integration↗

Effects of Communication Delay on Human Spaceflight Missions

Missions onboard the International Space Station rely on the real-time availability of a large ground team of system experts to command the vehicle, solve safety-critical problems, and guide the crew during complex operations. Also, in Low Earth Orbit (LEO), supplies can be sent and crews evacuated quite quickly if needed. Future missions Beyond Low Earth Orbit (BLEO) will not have this 24/7, real-time safety net as communication latency increases, resupply difficulty increases, and evacuation opportunities diminish. There are few, if any, terrestrial analogs for human spaceflight missions BLEO that reflect the conditions—including extreme environments, long mission durations, and small crew sizes – that make these missions so high risk. Studies on specific conditions, such as communication delays and asynchronous interactions, have been performed in NASA Earth-based analog missions and have found that communication delays can disrupt ground-crew interactions and adversely impact team performance. However, there are gaps and limitations in studies conducted to date, notably on human spacecraft system failure response and recovery, the impacts of shorter lunar-relevant communication delays on complex operations, and the effectiveness of countermeasures. The work presented here breaks down real anomalies that occurred on ISS and Apollo missions and creates example scenarios fort Lunar Surface and Mars missions to explore the impact of communication delays of varying length on onboard operations and mission outcomes. Our analyses indicate that short communication delays (e.g., seconds to a minute) adversely impact the ability for ground to provide real-time oversight and guidance and to catch quickly emerging problems in time. Longer communication delays (e.g., up to 40 minutes on Mars missions) call for a shift of responsibility for tactical operations from ground to crew; crew must make time-critical decisions independently and respond to time-critical vehicle anomalies to prevent consequences.

human-systems integration↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

On the numerical solution of two-dimensional, laminar compressible flows with imbedded shock waves.

The complete, time-dependent Navier-Stokes equations are expressed in conservation form and solved by employing an explicit finite difference numerical technique which incorporates artificial viscosity terms of the form first suggested by Rusanov for numerical stability in the vicinity of shock waves. Surface boundary conditions are developed in a consistent and unique manner through the use of a physically oriented extrapolation procedure. From numerical experimentation an extended range for the explicit stability parameter is established. Also employed is an additional convergence parameter which relates incremental spatial steps. Convergence of the transient solution to a steady state flow was obtained after 400 to 500 time steps.

Goodrich, W. D.↗

Propagation of quasifracture in viscoelastic media under low-cycle repeated stressing

The propagation of a craze as quasifracture under repeated cyclic stressing in polymeric systems has been under intensive investigation recently. Based upon a time-dependent crazing theory, the governing differential equation describing the propagation of a single craze as quasifracture in an infinite viscoelastic plate has been solved for sinusoidal stresses. Numerical methods have been employed to obtain the normalized craze length as a function of time. The computed results indicate that the length of a quasifracture may decelerate and decrease indicating that its velocity can reverse. This behavior may be consistent with the observed and much discussed craze healing and the enclosure model in fatigue and fracture of solids.

Liu, X. P.↗

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.↗

Optimal digital redesign of cascaded analogue controllers

This paper presents a new, optimal digital redesign technique for finding an optimal cascaded digital controller from the given continuous-time counterpart by minimizing a quadratic performance index. The control gains can be obtained by solving a set of Liapunov equations. The developed optimal cascaded digital controller enables the state and/or outputs of the digitally controlled closed-loop sampled-data system to optimally match those of the original continuous-time closed-loop system at any instant between sampling periods. The developed control law can be implemented using inexpensive and reliable digital electronics with a relatively long sampling period.

Shieh, L. S.↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique signature of visual behavior. This is true even in a restricted domain, such as piloting an aircraft, where patterns of visual signatures might represent activities like communicating, navigating, and monitoring. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these activities based on their behavioral signatures. The method is in some respects similar to recurrence analysis, but here we compare not individual fixations, but groups of fixations aggregated over a fixed time interval. The duration of this interval is a parameter that we will refer to as τ. We assume that the environment has been divided into a set of N different areas-of-interest (AOIs). For a given interval of time of duration τ, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector. These proportions can be converted to counts by multiplying by τ divided by the average fixation duration (another parameter that we fix at 280 milliseconds). We compare different intervals by computing the chi-square statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. We have investigated the method using a set of 10 synthetic "activities," that sample 4 AOIs. Four of these activities visit 3 of the 4 AOIs, with equal probability; as there are four different ways to leave-one- out, there are four such activities. Similarly, there are six different activities that leave-two-out. Sequences of simulated behavior were generated by running each activity for 40 seconds, in sequence, for a total of 6.7 minutes. The figure to the right shows the matrix of chi-square statistics, using a value of 2.8 seconds for τ, corresponding to 10 fixations. Low values (dark) indicate poor evidence for activity differences, while high values (bright) indicate strong evidence. The dark squares along the main diagonal each correspond to the forty second intervals in which the activity was held constant; the 4x4 block at the lower left corresponds to the four leave-one-out activities, while the 6x6 block in the upper right corresponds to the leave-two-out activities. (The anti-diagonal pattern of white squares indicates those activity pairs that share no AOIs.) The chi-square values can be binarized by choosing a particular significance level; we are interested in grouping bins that represent the same activity, effectively accepting the null hypothesis. Therefore, we may adopt a relatively lax criterion; for example, choosing a p-value of 0.2 means that two behaviors that have only a 1-in-5 chance of being produced by a single activity might nevertheless be clustered together. We have explored several methods to perform clustering on the data and solving for the activity probabilities. Greedy methods begin by selecting the time bin that is similar to the most (or least) other bins, and then forming a cluster from it and all other non-discriminable bins. These methods show mediocre performance, as they do not take into account temporal contiguity. Preliminary results indicate that methods that "grow" clusters in time from seed points perform better.

activity analysis↗

Thermosolutal convection during directional solidification

During solidification of a binary alloy at constant velocity vertically upward, thermosolutal convection can occur if the solute rejected at the crystal-melt interface decreases the density of the melt. We assume that the crystal-melt interface remains planar and that the flow field is periodic in the horizontal direction. The time-dependent nonlinear differential equations for fluid flow, concentration, and temperature are solved numerically in two spatial dimensions for small Prandtl numbers and moderately large Schmidt numbers. For slow solidification velocities, the thermal field has an important stabilizing influence: near the onset of instability the flow is confined to the vicinity of the crystal-melt interface. Further, for slow velocities, as the concentration increases, the horizontal wavelength of the flow decreases rapidly - a phenomenon also indicated by linear stability analysis. The lateral inhomogeneity in solute concentration due to convection is obtained from the calculations. For a narrow range of solutal Rayleigh numbers and wavelengths, the flow is periodic in time.

Mcfadden, G. B.↗

Energetic ionized helium in the quiet time radiation belts - Theory and comparison with observation

Theoretical calculations of helium ion distributions in the inner magnetosphere are compared to observations made by ATS-6 and Explorer-45. Coupled transport equations for equatorially mirroring singly and doubly ionized helium ions in the steady state limit with an outer boundary of L = 7 are solved. Radial profiles and energy spectra are computed at all lower L values. Theoretical quiet time predictions are compared to satellite observations of energetic helium ions in the lower MeV range. It is found that the theory adequately represents the principal characteristics of the radiation belt helium ion population.

Spjeldvik, W. N.↗