Search NASA⌕ Search

SEARCH · Search NASA

Results for “process algebras”

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 37 records · Page 2

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗

Elliptic Volume Grid Generation for Viscous CFD Parametric Design Studies

This paper presents a robust method for the generation of zonal volume grids of design parametrics for aerodynamic configurations. The process utilizes simple algebraic techniques with parametric splines coupled with elliptic volume grid generation to generate isolated zonal grids for changes in body configuration needed to perform parametric design studies. Speed of the algorithm is maximized through the algebraic methods and reduced number of grid points to be regenerated for each design parametric without sacrificing grid quality and continuity within the volume domain. The method is directly applicable to grid reusability, because it modifies existing ow adapted volume grids and enables the user to restart the CFD solution process with an established flow field. Use of this zonal approach reduces computer usage time to create new volume grids for design parametric studies by an order of magnitude, as compared to current methods which require the regeneration of an entire volume grid. A sample configuration of a proposed Single Stage-to-Orbit Vehicle is used to illustrate an application of this method.

Alter, Stephen J.↗

A moving-window parameter adaptive control system for the F8-DFBW aircraft

This paper describes the moving-window parameter adaptive control system developed for the NASA F8-DFBW aircraft. The control system employs a parameter identification process that, iteratively, adjusts parameters of a model of the aircraft motions in a batch processing manner so that responses generated from the model fit the outputs of sensors stored in a finite record referred to as the moving window. Tests are made on the validity of the parameter estimates before using the parameters in an on-line design process. The on-line design process is an algebraic mapping of the parameters of the model into primary control system feedback and feedforward gains. The mapping was selected to satisfy specific flying quality characteristics over the range of parameter variations expected. Results are presented from simulation studies on the identification algorithm, tests for parameter validity, and the on-line design process.

Montgomery, R. C.↗

A moving window parameter adaptive control system for the F8-DFBW aircraft

This paper describes the moving window parameter adaptive control system developed for the NASA F8-DFBW aircraft. The control system employs a parameter identification process that, iteratively, adjusts parameters of a model of the aircraft motions in a batch-processing manner so that responses generated from the model fit the outputs of sensors stored in a finite record referred to as the moving window. Tests are made on the validity of the parameter estimates before using the parameters in an on-line design process. The on-line design process is an algebraic mapping of the parameters of the model into primary control system feedback and feedforward gains. The mapping was selected to satisfy specific flying quality characteristics over the range of parameter variations expected. Results are presented from simulation studies on the identification algorithm made during the development of the system.

Dunn, H. J.↗

Developing Information Power Grid Based Algorithms and Software

This was an exploratory study to enhance our understanding of problems involved in developing large scale applications in a heterogeneous distributed environment. It is likely that the large scale applications of the future will be built by coupling specialized computational modules together. For example, efforts now exist to couple ocean and atmospheric prediction codes to simulate a more complete climate system. These two applications differ in many respects. They have different grids, the data is in different unit systems and the algorithms for inte,-rating in time are different. In addition the code for each application is likely to have been developed on different architectures and tend to have poor performance when run on an architecture for which the code was not designed, if it runs at all. Architectural differences may also induce differences in data representation which effect precision and convergence criteria as well as data transfer issues. In order to couple such dissimilar codes some form of translation must be present. This translation should be able to handle interpolation from one grid to another as well as construction of the correct data field in the correct units from available data. Even if a code is to be developed from scratch, a modular approach will likely be followed in that standard scientific packages will be used to do the more mundane tasks such as linear algebra or Fourier transform operations. This approach allows the developers to concentrate on their science rather than becoming experts in linear algebra or signal processing. Problems associated with this development approach include difficulties associated with data extraction and translation from one module to another, module performance on different nodal architectures, and others. In addition to these data and software issues there exists operational issues such as platform stability and resource management.

Dongarra, Jack↗

Interactive solution-adaptive grid generation procedure

TURBO-AD is a two dimensional interactive solution adaptive grid generation program. The code uniquely combines a grid adaptation technique that uses parametric mapping with control sources and an algebraic grid generation that uses control points into a single software package. The grid adaptation is achieved by first adapting the control points to a numerical solution in the parametric domain using the control sources obtained from flow properties. Then a new grid is generated from the adapted control net using the control point formulation. The new adapted grid in the parametric domain is then mapped back to the physical domain. This solution adaptive grid generation process is efficient because the number of control points is much less than the number of grid points and the grid generation from the adapted control net is an efficient algebraic process.

Choo, Yung K.↗

Interactive solution-adaptive grid generation procedure

TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

Henderson, Todd L.↗

Interactive solution-adaptive grid generation

TURBO-AD is an interactive solution-adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution-adaptive grid generation technique into a single interactive solution-adaptive grid generation package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties that had been encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on a unit square in the parametric domain, and the new adapted grid in the parametric domain is then mapped back to the physical domain. The grid adaptation is achieved by first adapting the control points to a numerical solution in the parametric domain using control sources obtained from flow properties. Then a new modified grid is generated from the adapted control net. This solution-adaptive grid generation process is efficient because the number of control points is much less than the number of grid points and the generation of a new grid from the adapted control net is an efficient algebraic process. TURBO-AD provides the user with both local and global grid controls.

Choo, Yung K.↗

Monotonically improving approximate answers to relational algebra queries

We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.

Smith, Kenneth P.↗

Two-Dimensional Systolic Array For Kalman-Filter Computing

Two-dimensional, systolic-array, parallel data processor performs Kalman filtering in real time. Algorithm rearranged to be Faddeev algorithm for generalized signal processing. Algorithm mapped onto very-large-scale integrated-circuit (VLSI) chip in two-dimensional, regular, simple, expandable array of concurrent processing cells. Processor does matrix/vector-based algebraic computations. Applications include adaptive control of robots, remote manipulators and flexible structures and processing radar signals to track targets.

Chang, Jaw John↗

An algebraic approach to image de-smearing: Symmetries of polynomials and their zeros

Frequently a photograph received from a spacecraft will be smeared by some process, e.g., by camera motion. Algebraically such smearing can be represented as p = sigma f, where sigma is the true picture, p is the received picture, and f is the smearing function. (p, sigma, and f are polynomials in two variables x and y.) Thus, in principle, sigma can be recovered by multiplying p by 1/f. However, there are problems involved in computing 1/f. Some of these problems are investigated.

Johnson, D. L.↗

Numerical stability in problems of linear algebra.

Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

Babuska, I.↗

Symbolic-numeric interface: A review

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach.

Ng, E. W.↗

Inherent Conservatism in Deterministic Quasi-Static Structural Analysis

The cause of the long-suspected excessive conservatism in the prevailing structural deterministic safety factor has been identified as an inherent violation of the error propagation laws when reducing statistical data to deterministic values and then combining them algebraically through successive structural computational processes. These errors are restricted to the applied stress computations, and because mean and variations of the tolerance limit format are added, the errors are positive, serially cumulative, and excessively conservative. Reliability methods circumvent these errors and provide more efficient and uniform safe structures. The document is a tutorial on the deficiencies and nature of the current safety factor and of its improvement and transition to absolute reliability.

Verderaime, V.↗

Transfer Functions Via Laplace- And Fourier-Borel Transforms

Approach to solution of nonlinear ordinary differential equations involves transfer functions based on recently-introduced Laplace-Borel and Fourier-Borel transforms. Main theorem gives transform of response of nonlinear system as Cauchy product of transfer function and transform of input function of system, together with memory effects. Used to determine responses of electrical circuits containing variable inductances or resistances. Also possibility of doing all noncommutative algebra on computers in such symbolic programming languages as Macsyma, Reduce, PL1, or Lisp. Process of solution organized and possibly simplified by algebraic manipulations reducing integrals in solutions to known or tabulated forms.

Can, Sumer↗

A high-speed linear algebra library with automatic parallelism

Parallel or distributed processing is key to getting highest performance workstations. However, designing and implementing efficient parallel algorithms is difficult and error-prone. It is even more difficult to write code that is both portable to and efficient on many different computers. Finally, it is harder still to satisfy the above requirements and include the reliability and ease of use required of commercial software intended for use in a production environment. As a result, the application of parallel processing technology to commercial software has been extremely small even though there are numerous computationally demanding programs that would significantly benefit from application of parallel processing. This paper describes DSSLIB, which is a library of subroutines that perform many of the time-consuming computations in engineering and scientific software. DSSLIB combines the high efficiency and speed of parallel computation with a serial programming model that eliminates many undesirable side-effects of typical parallel code. The result is a simple way to incorporate the power of parallel processing into commercial software without compromising maintainability, reliability, or ease of use. This gives significant advantages over less powerful non-parallel entries in the market.

Boucher, Michael L.↗

Vector formulation for interferogram surface fitting

Interferometry is an optical testing technique that quantifies the optical path difference (OPD) between a reference wave front and a test wave front based on the interference of light. Fringes are formed when the OPD is an integral multiple of the illuminating wavelength. The resultant two-dimensional pattern is called an interferogram. The function of any interferogram analysis program is to extract this OPD and to produce a representation of the test wave front (or surface). This is accomplished through a three-step process of sampling, ordering, and fitting. We develop a generalized linear-algebra vector-notation model of the interferogram sampling and fitting process.

Fischer, David J.↗

[Formian 2 and a Formian Function for Processing Polyhedric Configurations]

The work began in October 1994 with the following objectives: (1) to produce an improved version of the programming language Formian; and (2) to create a means for computer aided handling of polyhedric configurations including the geodesic forms of all kinds. A new version of Formian, referred to as Formian 2, is being implemented to operate in the Windows 95 environment. It is an ideal tool for configuration management in a convenient and user-friendly manner. The second objective was achieved by creating a standard Formian function that allows convenient handling of all types of polyhedric configurations. In particular, the focus of attention is on polyhedric configurations that are of importance in architectural and structural engineering fields. The natural medium for processing of polyhedric configurations is a programming language that incorporates the concepts of 'formex algebra'. Formian is such a programming language in which the processing of polyhedric configurations can be carried out using the standard elements of the language. A description of this function is included in a chapter for a book entitled 'Beyond the Cube: the Architecture of space Frames and Polyhedra'. A copy of this chapter is appended.

Nooshin, H.↗