Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational mathematics”

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,135 records · Page 63

Visibility of the lunar crescent

A model designed to predict whether or not the moon will be visible under any set of observing conditions is presented. It explicitly includes atmospheric clarity, which is calculated from the site's altitude, latitude, temperature, relative humidity, aerosol content, and time of the year. This mathematical model is combined with a lunar and solar ephemeris to yield a computer program which will predict the date of the first crescent sighting from any location. A list of 201 observations of lunar visibility was collected to test this model and other models. It is found that criteria involving the moonset lagtime and the moon's age have zones of uncertainty which typically cover the entire earth.

Schaefer, Bradley E.↗

Neural-Network Simulator

F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

Mitchell, Paul H.↗

Software For Depiction Of Three-Dimensional Objects

HME (Hierarchical Modeling Environment) is three-dimensional computer-graphics software system designed to give user complete access to total hierarchical mathematical model. Enables user to build, manipulate, and display hierarchical three-dimensional objects dynamically. Also includes created polygons in hierarchy. Establishes and edits proper coordination of eye points, sources of light, and connectivity of model necessary for accurate depiction of model. Written in C language.

Taylor, Frank↗

Navier-Stokes relaxation to sinh-Poisson states at finite Reynolds numbers

A mathematical framework is proposed in which it seems possible to justify the computationally-observed relaxation of a two-dimensional Navier-Stokes fluid to a 'most probable', or maximum entropy, state. The relaxation occurs at large but finite Reynolds numbers, and involves substantial decay of higher-order ideal invariants such as enstrophy. A two-fluid formulation, involving interpenetrating positive and negative vorticity fluxes (continuous and square integrable) is developed, and is shown to be intimately related to the passive scalar decay problem. Increasing interpenetration of the two fluids corresponds to the decay of vorticity flux due to viscosity. It is demonstrated numerically that, in two dimensions, passive scalars decay rapidly, relative to mean-square vorticity (enstrophy). This observation provides a basis for assigning initial data to the two-fluid field variables.

Montgomery, David↗

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time applications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

UTM↗

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

traffic complexity↗

State reduction for semi-Markov reliability models

Semi-Markov processes have proved to be an effective and convenient tool to construct models of systems that achieve reliability by redundancy and reconfiguration. These models are able to depict complex system architectures and to capture the dynamics of fault arrival and system recovery. A disadvantage of this approach is that the models can be extremely large, which poses both a model construction and a computational problem. Techniques are needed to reduce the model size. Because these systems are used in critical applications where failure can be expensive, there must be an analytically derived bound for the error produced by the model reduction technique. Automatic model generation programs have been written to help the reliability analyst produce models of complex systems. Because of the importance of these programs, the model reduction technique needs to be precise and easily implemented. This paper presents a model reduction technique called trimming that can be applied to a popular class of systems. An error bound for the trimming procedure is derived that uses readily available system parameters. The trimming procedure is precisely described and appears easy to implement in a model generation program.

Reduced order systems↗

Some applications of aerodynamic formulations to problems in aircraft dynamics

Two applications of mathematical modeling to aerodynamic problems are cussed. The first application is an investigation of the capacity of a nonlinear aerodynamic mathematical model to describe the aerodynamic reactions on an airfoil with a deflecting flap in transonic flow. Flow field computational methods are used to evaluate the nonlinear, unsteady aerodynamic data in terms of characteristic motions called for by the model. Histories of unconstrained motions of the flap are generated from the flap equations of motion, with the aerodynamic reactions specified by the mathematical model. In the second application wing rock is investigated. The most recent model accommodates experimental results wing rock by admitting the existence of aerodynamic hysteresis in the variation of the steady state rolling moment coefficient with roll angle is described.

Schiff, L. B.↗

Mathematical modelling of a human external respiratory system

A closed system of algebraic and common differential equations solved by computer is investigated. It includes equations which describe the activity pattern of the respiratory center, the phrenic nerve, the thrust produced by the diaphragm as a function of the lung volume and discharge frequency of the phrenic nerve, as well as certain relations of the lung stretch receptors and chemoreceptors on various lung and blood characteristics, equations for lung biomechanics, pulmonary blood flow, alveolar gas exchange and capillary blood composition equations to determine various air and blood flow and gas exchange parameters, and various gas mixing and arterial and venous blood composition equations, to determine other blood, air and gas mixing characteristics. Data are presented by means of graphs and tables, and some advantages of this model over others are demonstrated by test results.

Source record↗

Computing a Stability Spectrum by Use of the HHT

The Hilbert-Huang transform (HHT) is part of the mathematical basis of a method of calculating a stability spectrum. This method can be regarded as an extended and improved version of a prior HHT-based method of calculating a damping spectrum. In the prior method, information on positive damping (which leads to stability) and negative damping (which leads to instability) becomes mixed into a single squared damping loss factor. Hence, there is no way to distinguish between stability and instability by examining a damping spectrum. In contrast, in the present stabilityspectrum method, information on the mathematical sign of the damping is retained, making it possible to identify reThe Hilbert-Huang transform (HHT) is part of the mathematical basis of a method of calculating a stability spectrum. This method can be regarded as an extended and improved version of a prior HHT-based method of calculating a damping spectrum. In the prior method, information on positive damping (which leads to stability) and negative damping (which leads to instability) becomes mixed into a single squared damping loss factor. Hence, there is no way to distinguish between stability and instability by examining a damping spectrum. In contrast, in the present stabilityspectrum method, information on the mathematical sign of the damping is retained, making it possible to identify regions of instability in a spectrum. This method is expected to be especially useful for analyzing vibration-test data for the purpose of predicting vibrational instabilities in structures (e.g., flutter in airplane wings).

Huang, Norden E.↗

Monte Carlo techniques for solving transport problems

The Monte Carlo procedure is a model sampling technique. A model is established, and the behavior of sample units in this model is followed. A sufficient number of sample units are followed to obtain a statistical average or macroscopic quantities, which are the quantities of interest. This technique was used in crude form by Fermi in connection with the building of the first atomic pile. Later, Von Neumann and Ulam developed and used the Monte Carlo procedure extensively in developing the atomic bomb. Since then this technique has gained considerable use in nuclear reactor problems (refs. 1 and 2), and we at the Lewis Research Center have been extending it to thermal radiation (refs. 3 and 4), rarefied gas flows, and plasma flow problems (ref. 5). This technique, which requires a large number of sample histories to obtain solutions with small variances, is receiving greater use because of the development of the high-speed electronic computers.

SAMPLED DATA SYSTEM↗

Software Model Of Software-Development Process

Collection of computer programs constitutes software tool for simulation of medium- to large-scale software-development projects. Necessary to include easily identifiable and more-readily quantifiable characteristics like costs, times, and numbers of errors. Mathematical model incorporating these and other factors of dynamics of software-development process implemented in the Software Life Cycle Simulator (SLICS) computer program. Simulates dynamics of software-development process. In combination with input and output expert software systems and knowledge-based management software system, develops information for use in managing large software-development project. Intended to aid managers in planning, managing, and controlling software-development processes by reducing uncertainties in budgets, required personnel, and schedules.

Lin, Chi Y.↗

A Lightning Channel Retrieval Algorithm for the North Alabama Lightning Mapping Array (LMA)

A new multi-station VHF time-of-arrival (TOA) antenna network is, at the time of this writing, coming on-line in Northern Alabama. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The network will support on-going ground validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. It will also provide for many interesting and detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and will offer many interesting comparisons with other meteorological/geophysical wets associated with lightning and thunderstorms. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. In this study, a new revised channel mapping retrieval algorithm is introduced. The algorithm is an extension of earlier work provided in Koshak and Solakiewicz (1996) in the analysis of the NASA Kennedy Space Center (KSC) Lightning Detection and Ranging (LDAR) system. As in the 1996 study, direct algebraic solutions are obtained by inverting a simple linear system of equations, thereby making computer searches through a multi-dimensional parameter domain of a Chi-Squared function unnecessary. However, the new algorithm is developed completely in spherical Earth-centered coordinates (longitude, latitude, altitude), rather than in the (x, y, z) cartesian coordinates employed in the 1996 study. Hence, no mathematical transformations from (x, y, z) into spherical coordinates are required (such transformations involve more numerical error propagation, more computer program coding, and slightly more CPU computing time). The new algorithm also has a more realistic definition of source altitude that accounts for Earth oblateness (this can become important for sources that are hundreds of kilometers away from the network). In addition, the new algorithm is being applied to analyze computer simulated LMA datasets in order to obtain detailed location/time retrieval error maps for sources in and around the LMA network. These maps will provide a more comprehensive analysis of retrieval errors for LMA than the 1996 study did of LDAR retrieval errors. Finally, we note that the new algorithm can be applied to LDAR, and essentially any other multi-station TWA network that depends on direct line-of-site antenna excitation.

Koshak, William↗

An efficient computational method for characterizing the effects of random surface errors on the average power pattern of reflectors

Based on the works of Ruze (1966) and Vu (1969), a novel mathematical model has been developed to determine efficiently the average power pattern degradations caused by random surface errors. In this model, both nonuniform root mean square (rms) surface errors and nonuniform illumination functions are employed. In addition, the model incorporates the dependence on F/D in the construction of the solution. The mathematical foundation of the model rests on the assumption that in each prescribed annular region of the antenna, the geometrical rms surface value is known. It is shown that closed-form expressions can then be derived, which result in a very efficient computational method for the average power pattern. Detailed parametric studies are performed with these expressions to determine the effects of different random errors and illumination tapers on parameters such as gain loss and sidelobe levels. The results clearly demonstrate that as sidelobe levels decrease, their dependence on the surface rms/wavelength becomes much stronger and, for a specified tolerance level, a considerably smaller rms/wavelength is required to maintain the low sidelobes within the required bounds.

Rahmat-Samii, Y.↗

Mathematical Model of Bubble Sloshing Dynamics for Cryogenic Liquid Helium in Orbital Spacecraft Dewar Container

A generalized mathematical model is investigated of sloshing dynamics for dewar containers, partially filled with a liquid of cryogenic superfluid helium 2, driven by both gravity gradient and jitter accelerations applicable to two types of scientific spacecrafts, which are eligible to carry out spinning motion and/or slew motion to perform scientific observations during normal spacecraft operation. Two examples are given for the Gravity Probe-B (GP-B) with spinning motion, and the Advanced X-Ray Astrophysics Facility-Spectroscopy (AXAF-S) with slew motion, which are responsible for the sloshing dynamics. Explicit mathematical expressions for the modelling of sloshing dynamics to cover these forces acting on the spacecraft fluid systems are derived. The numerical computation of sloshing dynamics will be based on the noninertial frame spacecraft bound coordinate, and we will solve the time-dependent three-dimensional formulations of partial differential equations subject to initial and boundary conditions. Explicit mathematical expressions of boundary conditions lo cover capillary force effects on the liquid-vapor interface in microgravity environments are also derived. Results of the simulations of the mathematical model are illustrated.

Hung, R. J.↗

The Laboratory for Oceans Computing Facility

The first VAX computer in the Laboratory for Oceans Computing Facility (LOCF) was installed and the facility was largely expanded. The growth is not only in hardware and software, but also in the number of users and in supporting research and development projects. The LOCF serves as a general purpose computing facility for: ocean color research projects, sea ice research projects, processing of the Nimbus-7 Coastal Zone Color Scanner data set, real time ingest and analysis of TIROS-N satellite data, study of the Synthetic Aperture Radar data, study of LANDSAT data, and many others. The physical space and the electrical power layout of the computing room were modified to accommodate all the equipment. The LOCF has several image processing stations which include two International Imaging Systems (IIS) model 75 processors and one Adage processor. The facility has the capability of ingesting the TIROS-N HRPT satellite data on a real time basis. More than 30 software packages were installed on the systems. System software packages, network software, FORTRAN and C compilers, database management software, image processing software, graphics, mathematics and statistics packages, TAE, Catalog Manager, GEMPAK, LAS and many other software developed on the LOCF computers such as SEAPAK have greatly advanced the capability of the LOCF.

Kao, R.↗

Efficient Model-Based Diagnosis Engine

An efficient diagnosis engine - a combination of mathematical models and algorithms - has been developed for identifying faulty components in a possibly complex engineering system. This model-based diagnosis engine embodies a twofold approach to reducing, relative to prior model-based diagnosis engines, the amount of computation needed to perform a thorough, accurate diagnosis. The first part of the approach involves a reconstruction of the general diagnostic engine to reduce the complexity of the mathematical-model calculations and of the software needed to perform them. The second part of the approach involves algorithms for computing a minimal diagnosis (the term "minimal diagnosis" is defined below). A somewhat lengthy background discussion is prerequisite to a meaningful summary of the innovative aspects of the present efficient model-based diagnosis engine. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD (see figure). Diagnosis - the task of finding faulty components - is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. A minimal diagnosis stands in contradistinction to the trivial solution, in which all components are deemed to be faulty, and which, therefore, always explains all inconsistencies.

Fijany, Amir↗