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 163 records · Page 9

Cloud-Vegetation Radiative Interaction: What Can We Learn from it about Cloud Optical Properties?

Because of their radiative interactions, the vegetation canopy and the atmosphere are coupled together; each serves as a boundary condition to the radative transfer equations in the adjacent medium. To better understand radiative processes in these media we need an accurate description of their interactions. This presentation outlines a technique needed to describe interactions between vegetation and clouds and exploits it to retrieve cloud optical depth from ground-based radiance measurements. measurements of zenith radiance in the RED and NIR spectral regions. In addition to an algebraic combinations of spectral radiances such as Normalized Difference Cloud Index (NDCI) that can result in poor retrievals due to its insensitivity to cloud fraction, both RED and NIR radiances as points on the "RED vs. NIR" plane are proposed to be used for retrieval. The proposed method is applied to a multi-channel sunphotometer (as a part of AERONET) measurements at the ARM site in Oklahoma. In addition to cloud optical depth, the new method also infers a "radiatively effective" cloud fraction.

Marshak, Alexander↗

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗

High level language-based robotic control system

This invention is a robot control system based on a high level language implementing a spatial operator algebra. There are two high level languages included within the system. At the highest level, applications programs can be written in a robot-oriented applications language including broad operators such as MOVE and GRASP. The robot-oriented applications language statements are translated into statements in the spatial operator algebra language. Programming can also take place using the spatial operator algebra language. The statements in the spatial operator algebra language from either source are then translated into machine language statements for execution by a digital control computer. The system also includes the capability of executing the control code sequences in a simulation mode before actual execution to assure proper action at execution time. The robot's environment is checked as part of the process and dynamic reconfiguration is also possible. The languages and system allow the programming and control of multiple arms and the use of inward/outward spatial recursions in which every computational step can be related to a transformation from one point in the mechanical robot to another point to name two major advantages.

Rodriguez, Guillermo↗

High level language-based robotic control system

This invention is a robot control system based on a high level language implementing a spatial operator algebra. There are two high level languages included within the system. At the highest level, applications programs can be written in a robot-oriented applications language including broad operators such as MOVE and GRASP. The robot-oriented applications language statements are translated into statements in the spatial operator algebra language. Programming can also take place using the spatial operator algebra language. The statements in the spatial operator algebra language from either source are then translated into machine language statements for execution by a digital control computer. The system also includes the capability of executing the control code sequences in a simulation mode before actual execution to assure proper action at execution time. The robot's environment is checked as part of the process and dynamic reconfiguration is also possible. The languages and system allow the programming and control of multiple arms and the use of inward/outward spatial recursions in which every computational step can be related to a transformation from one point in the mechanical robot to another point to name two major advantages.

Rodriguez, Guillermo↗

Indicated mean-effective pressure instrument

An apparatus for measuring indicated mean effective pressure (IMEP) of an internal combustion piston or rotary engine or of an external combustion engine such as a stirling engine is disclosed. An optical shaft encoder measures crankshaft angle of the engine. Changes in volume with respect to changes in crank angle of one or more cylinders (dV/d theta) is determined either empirically or algebraically from engine geometry and stored in a memory. As the crank angle changes, dV/d theta) is read from the memory and multiplied by chamber or cylinder pressure. The product (P dv/d theta) is then added to the total previously accumulated in the cycle. Each time theta changes by an amount equal to delta theta, the process is repeated. At the end of each engine cycle, the total is equal to the IMEP value for that cycle.

Rice, W. J.↗

Method for the calculation of spacecraft umbra and penumbra shadow terminator points

A method for calculating orbital shadow terminator points is presented. The current method employs the use of an iterative process which is used for an accurate determination of shadow points. This calculation methodology is required since orbital perturbation effects can introduce large errors when a spacecraft orbits a planet in a high altitude and/or highly elliptical orbit. To compensate for the required iteration methodology, all reference frame change definitions and calculations are performed with quaternions. Quaternion algebra significantly reduces the computational time required for the accurate determination of shadow terminator points.

Ortizlongo, Carlos R.↗

Exact solution of some linear matrix equations using algebraic methods

Algebraic methods are used to construct the exact solution P of the linear matrix equation PA + BP = - C, where A, B, and C are matrices with real entries. The emphasis of this equation is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The paper is divided into six sections which include the proof of the basic lemma, the Liapunov equation, and the computer implementation for the rational, integer and modular algorithms. Two numerical examples are given and the entire calculation process is depicted.

Djaferis, T. E.↗

Grid flexibility and patching techniques

The numerical determination of combustor flowfields is of great value to the combustor designer. An a priori knowledge of the flow behavior can speed the combustor design process and reduce the number of experimental test rigs required to arrive at an optimal design. Even 2-D steady incompressible isothermal flow predictions are of use; many codes of this kind are available, each employing different techniques to surmount the difficulties arising from the nonlinearity of the governing equations and from typically irregular combustor geometries. Mapping techniques (algebraic and elliptic PDE), and adaptive grid methods (both multi-grid and grid embedding) as applied to axisymmetric combustors are discussed.

Keith, T. G.↗

Concurrent Image Processing Executive (CIPE). Volume 3: User's guide

CIPE (the Concurrent Image Processing Executive) is both an executive which organizes the parameter inputs for hypercube applications and an environment which provides temporary data workspace and simple real-time function definition facilities for image analysis. CIPE provides two types of user interface. The Command Line Interface (CLI) provides a simple command-driven environment allowing interactive function definition and evaluation of algebraic expressions. The menu interface employs a hierarchical screen-oriented menu system where the user is led through a menu tree to any specific application and then given a formatted panel screen for parameter entry. How to initialize the system through the setup function, how to read data into CIPE symbols, how to manipulate and display data through the use of executive functions, and how to run an application in either user interface mode, are described.

Lee, Meemong↗

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗

Systolic VLSI for Kalman filters

A novel two-dimensional parallel computing method for real-time Kalman filtering is presented. The mathematical formulation of a Kalman filter algorithm is rearranged to be the type of Faddeev algorithm for generalizing signal processing. The data flow mapping from the Faddeev algorithm to a two-dimensional concurrent computing structure is developed. The architecture of the resulting processor cells is regular, simple, expandable, and therefore naturally suitable for VLSI chip implementation. The computing methodology and the two-dimensional systolic arrays are useful for Kalman filter applications as well as other matrix/vector based algebraic computations.

Yeh, H.-G.↗

Computation of asymmetric supersonic flows around cones at large incidence

The Schiff-Steger parabolized Navier-Stokes (PNS) code has been modified to allow computation of conical flowfields around cones at high incidence. The improved algorithm of Degani and Schiff has been incorporated with the PNS code. This algorithm adds the cross derivative and circumferential viscous terms to the original PNS code and modifies the algebraic eddy viscosity turbulence model to take into account regions of so called cross-flow separation. Assuming the flowfield is conical (but not necessarily symmetric) a marching stepback procedure is used: the solution is marched one step downstream using improved PNS code and the flow variables are then scaled to place the solution back to the original station. The process is repeated until no change in the flow variables is observed with further marching. The flow variables are then constant along rays of the flowfield. The experiments obtained by Bannik and Nebbeling were chosen as a test case. In these experiments a cone of 7.5 deg. half angle at Mach number 2.94 and Reynolds number 1.372 x 10(7) was tested up 34 deg. angle of attack. At high angle of attack nonconical asymmetric leeward side vortex patterns were observed. In the first set of computations, using an earlier obtained solution of the above cone for angle of attack of 22.6 deg. and at station x=0.5 as a starting solution, the angle of attack was gradually increased up to 34 deg. During this procedure the grid was carfully adjusted to capture the bow shock. A stable, converged symmetric solution was obtained. Since the numerical code converged to a symmetric solution which is not the physical one, the stability was tested by a random perturbation at each point. The possible effect of surface roughness or non perfect body shape was also investigated. It was concluded that although the assumption of conical viscous flows can be very useful for certain cases, it can not be used for the present case. Thus the second part of the investigation attempted to obtain a marching (in space) solution with the PNS method using the conical solution as initial data. Finally, the solution of the full Navier-Stokes equations was carried out.

Degani, David↗

A triangular thin shell finite element: Nonlinear analysis

Aspects of the formulation of a triangular thin shell finite element which pertain to geometrically nonlinear (small strain, finite displacement) behavior are described. The procedure for solution of the resulting nonlinear algebraic equations combines a one-step incremental (tangent stiffness) approach with one iteration in the Newton-Raphson mode. A method is presented which permits a rational estimation of step size in this procedure. Limit points are calculated by means of a superposition scheme coupled to the incremental side of the solution procedure while bifurcation points are calculated through a process of interpolation of the determinants of the tangent-stiffness matrix. Numerical results are obtained for a flat plate and two curved shell problems and are compared with alternative solutions.

Thomas, G. R.↗

An Automated Marching Scheme for Overset Structured Surface Mesh Generation

Starting with a Boundary Representation (BRep) of the geometry of an aerospace vehicle, an automated marching scheme is presented for generation of structured overset surface meshes. First, a pre-processing step automatically generates discrete representations of the BRep faces and BRep edges by tessellating in parameter space. Topological connectivity between the discretized BRep edges is then established, followed by automatic grid point distribution on these edges based on local turning angle, proximity to sharp geometric features, and prescribed maximum stretching ratio and grid spacing. A set of initial curves for algebraic or hyperbolic marching on a surface is then derived from the redistributed edge curves. A spatially-variable marching distance together with a grid point distribution in the marching direction are automatically determined for each initial curve. A set of overset surface meshes that covers the entire geometry is then obtained by combining the surface meshes around the BRep edges, and the structured meshes derived from the discretized BRep faces

Shishir A Pandya↗

General-Purpose Time-Accurate Adaptive-Grid Method

Adaptive-grid method provides for generation of time-accurate grids used to solve wide variety of problems numerically. Intended use in computation of compressible flows. Part of solution method including algebraic grid-movement scheme; algorithm solving, by use of explicit numerical-integration scheme, Euler equations of unsteady flow; and temporal coupling routine utilizing grid-prediction/correction method to link dynamic grid with Euler-equation-solving algorithm. Improves ability to adapt grid to multiple features of solution and involves use of coarse grid in prediction stage of temporal coupling reducing central-processing-unit cost of obtaining new grid.

Bockelie, Michael J.↗

Domain decomposition methods in aerodynamics

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Venkatakrishnan, V.↗

PLA realizations for VLSI state machines

A major problem associated with state assignment procedures for VLSI controllers is obtaining an assignment that produces minimal or near minimal logic. The key item in Programmable Logic Array (PLA) area minimization is the number of unique product terms required by the design equations. This paper presents a state assignment algorithm for minimizing the number of product terms required to implement a finite state machine using a PLA. Partition algebra with predecessor state information is used to derive a near optimal state assignment. A maximum bound on the number of product terms required can be obtained by inspecting the predecessor state information. The state assignment algorithm presented is much simpler than existing procedures and leads to the same number of product terms or less. An area-efficient PLA structure implemented in a 1.0 micron CMOS process is presented along with a summary of the performance for a controller implemented using this design procedure.

Gopalakrishnan, S.↗

Lagrangian Approach to Jet Mixing and Optimization of the Reactor for Production of Carbon Nanotubes

This study was motivated by an attempt to optimize the High Pressure carbon oxide (HiPco) process for the production of carbon nanotubes from gaseous carbon oxide, The goal is to achieve rapid and uniform heating of catalyst particles by an optimal arrangement of jets. A mixed Eulerian and Lagrangian approach is implemented to track the temperature of catalyst particles along their trajectories as a function of time. The FLUENT CFD software with second-order upwind approximation of convective terms and an algebraic multigrid-based solver is used. The poor performance of the original reactor configuration is explained in terms of features of particle trajectories. The trajectories most exposed to the hot jets appear to be the most problematic for heating because they either bend towards the cold jet interior or rotate upwind of the mixing zone. To reduce undesirable slow and/or oscillatory heating of catalyst particles, a reactor configuration with three central jets is proposed and the optimal location of the central and peripheral nozzles is determined.

Povitsky, Alex↗