SEARCH · Search NASA

Results for “Algorithms and Theoretical Developments”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1987

On a finite element CFD algorithm for compressible, viscous and turbulent aerodynamic flows

This paper develops and analyses individual construction aspects of an efficient and accurate finite element algorithm for prediction of viscous and turbulent flow fields of impact in aerodynamics. The theoretical construction employs a Taylor weak statement (TWS) for coincident embedding of stability mechanisms within a classic Galerkin finite element formulation of semidiscrete approximation error orthogonalization. A wide variety of the stabilizing mechanisms of independently derived CFD algorithms are contained within the TWS theory. An implicit construction that meets the requirement of efficient convergence to steady state is developed. The theoretical asymptotic error estimates of the TWS finite element algorithm for supersonic and viscous boundary layer flows are verified. Application to a three-dimensional turbulent flow is cited.

Baker, A. J.↗

NASA NTRS1978

A statistical technique for determining rainfall over land employing Nimbus-6 ESMR measurements

At 37 GHz, the frequency at which the Nimbus 6 Electrically Scanning Microwave Radiometer (ESMR 6) measures upwelling radiance, it was shown theoretically that the atmospheric scattering and the relative independence on electromagnetic polarization of the radiances emerging from hydrometers make it possible to monitor remotely active rainfall over land. In order to verify experimentally these theoretical findings and to develop an algorithm to monitor rainfall over land, the digitized ESMR 6 measurements were examined statistically. Horizontally and vertically polarized brightness temperature pairs (TH, TV) from ESMR 6 were sampled for areas of rainfall over land as determined from the rain recording stations and the WSR 57 radar, and areas of wet and dry ground (whose thermodynamic temperatures were greater than 5 C) over the Southeastern United States. These three categories of brightness temperatures were found to be significantly different in the sense that the chances that the mean vectors of any two populations coincided were less than 1 in 100.

Rodgers, E.↗

NASA NTRS1991

Remote sensing of earth terrain

In remote sensing, the encountered geophysical media such as agricultural canopy, forest, snow, or ice are inhomogeneous and contain scatters in a random manner. Furthermore, weather conditions such as fog, mist, or snow cover can intervene the electromagnetic observation of the remotely sensed media. In the modelling of such media accounting for the weather effects, a multi-layer random medium model has been developed. The scattering effects of the random media are described by three-dimensional correlation functions with variances and correlation lengths corresponding to the fluctuation strengths and the physical geometry of the inhomogeneities, respectively. With proper consideration of the dyadic Green's function and its singularities, the strong fluctuation theory is used to calculate the effective permittivities which account for the modification of the wave speed and attenuation in the presence of the scatters. The distorted Born approximation is then applied to obtain the correlations of the scattered fields. From the correlation of the scattered field, calculated is the complete set of scattering coefficients for polarimetric radar observation or brightness temperature in passive radiometer applications. In the remote sensing of terrestrial ecosystems, the development of microwave remote sensing technology and the potential of SAR to measure vegetation structure and biomass have increased effort to conduct experimental and theoretical researches on the interactions between microwave and vegetation canopies. The overall objective is to develop inversion algorithms to retrieve biophysical parameters from radar data. In this perspective, theoretical models and experimental data are methodically interconnected in the following manner: Due to the complexity of the interactions involved, all theoretical models have limited domains of validity; the proposed solution is to use theoretical models, which is validated by experiments, to establish the region in which the radar response is most sensitive to the parameters of interest; theoretically simulated data will be used to generate simple invertible models over the region. For applications to the remote sensing of sea ice, the developed theoretical models need to be tested with experimental measurements. With measured ground truth such as ice thickness, temperature, salinity, and structure, input parameters to the theoretical models can be obtained to calculate the polarimetric scattering coefficients for radars or brightness temperature for radiometers and then compare theoretical results with experimental data. Validated models will play an important role in the interpretation and classification of ice in monitoring global ice cover from space borne remote sensors in the future. We present an inversion algorithm based on a recently developed inversion method referred to as the Renormalized Source-Type Integral Equation approach. The objective of this method is to overcome some of the limitations and difficulties of the iterative Born technique. It recasts the inversion, which is nonlinear in nature, in terms of the solution of a set of linear equations; however, the final inversion equation is still nonlinear. The derived inversion equation is an exact equation which sums up the iterative Neuman (or Born) series in a closed form and, thus, is a valid representation even in the case when the Born series diverges; hence, the name Renormalized Source-Type Integral Equation Approach.

Yueh, Herng-Aung↗

NASA NTRS1988

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗

NASA NTRS1994

MODIS. Volume 2: MODIS level 1 geolocation, characterization and calibration algorithm theoretical basis document, version 1

The EOS Moderate Resolution Imaging Spectrometer (MODIS) is being developed by NASA for flight on the Earth Observing System (EOS) series of satellites, the first of which (EOS-AM-1) is scheduled for launch in 1998. This document describes the algorithms and their theoretical basis for the MODIS Level 1B characterization, calibration, and geolocation algorithms which must produce radiometrically, spectrally, and spatially calibrated data with sufficient accuracy so that Global change research programs can detect minute changes in biogeophysical parameters. The document first describes the geolocation algorithm which determines geodetic latitude, longitude, and elevation of each MODIS pixel and the determination of geometric parameters for each observation (satellite zenith angle, satellite azimuth, range to the satellite, solar zenith angle, and solar azimuth). Next, the utilization of the MODIS onboard calibration sources, which consist of the Spectroradiometric Calibration Assembly (SRCA), Solar Diffuser (SD), Solar Diffuser Stability Monitor (SDSM), and the Blackbody (BB), is treated. Characterization of these sources and integration of measurements into the calibration process is described. Finally, the use of external sources, including the Moon, instrumented sites on the Earth (called vicarious calibration), and unsupervised normalization sites having invariant reflectance and emissive properties is treated. Finally, algorithms for generating utility masks needed for scene-based calibration are discussed. Eight appendices are provided, covering instrument design and additional algorithm details.

Barker, John L.↗

NASA NTRS1979

A new hybrid algorithm for computing a fast discrete Fourier transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's more conventional algorithm. However, more additions are required.

Reed, I. S.↗

NASA NTRS1977

Software for C1 interpolation

The problem of mathematically defining a smooth surface, passing through a finite set of given points is studied. Literature relating to the problem is briefly reviewed. An algorithm is described that first constructs a triangular grid in the (x,y) domain, and first partial derivatives at the modal points are estimated. Interpolation in the triangular cells using a method that gives C sup.1 continuity overall is examined. Performance of software implementing the algorithm is discussed. Theoretical results are presented that provide valuable guidance in the development of algorithms for constructing triangular grids.

Lawson, C. L.↗

NASA NTRS1990

A two-level structure for advanced space power system automation

The tasks to be carried out during the three-year project period are: (1) performing extensive simulation using existing mathematical models to build a specific knowledge base of the operating characteristics of space power systems; (2) carrying out the necessary basic research on hierarchical control structures, real-time quantitative algorithms, and decision-theoretic procedures; (3) developing a two-level automation scheme for fault detection and diagnosis, maintenance and restoration scheduling, and load management; and (4) testing and demonstration. The outlines of the proposed system structure that served as a master plan for this project, work accomplished, concluding remarks, and ideas for future work are also addressed.

Loparo, Kenneth A.↗

NASA NTRS1993

Parallel O(log n) algorithms for open- and closed-chain rigid multibody systems based on a new mass matrix factorization technique

In this paper, parallel O(log n) algorithms for computation of rigid multibody dynamics are developed. These parallel algorithms are derived by parallelization of new O(n) algorithms for the problem. The underlying feature of these O(n) algorithms is a drastically different strategy for decomposition of interbody force which leads to a new factorization of the mass matrix (M). Specifically, it is shown that a factorization of the inverse of the mass matrix in the form of the Schur Complement is derived as M(exp -1) = C - B(exp *)A(exp -1)B, wherein matrices C, A, and B are block tridiagonal matrices. The new O(n) algorithm is then derived as a recursive implementation of this factorization of M(exp -1). For the closed-chain systems, similar factorizations and O(n) algorithms for computation of Operational Space Mass Matrix lambda and its inverse lambda(exp -1) are also derived. It is shown that these O(n) algorithms are strictly parallel, that is, they are less efficient than other algorithms for serial computation of the problem. But, to our knowledge, they are the only known algorithms that can be parallelized and that lead to both time- and processor-optimal parallel algorithms for the problem, i.e., parallel O(log n) algorithms with O(n) processors. The developed parallel algorithms, in addition to their theoretical significance, are also practical from an implementation point of view due to their simple architectural requirements.

Fijany, Amir↗

NASA NTRS2010

Hazard Detection Analysis for a Forward-Looking Interferometer

The Forward-Looking Interferometer (FLI) is a new instrument concept for obtaining the measurements required to alert flight crews to potential weather hazards to safe flight. To meet the needs of the commercial fleet, such a sensor should address multiple hazards to warrant the costs of development, certification, installation, training, and maintenance. The FLI concept is based on high-resolution Infrared Fourier Transform Spectrometry (FTS) technologies that have been developed for satellite remote sensing. These technologies have also been applied to the detection of aerosols and gases for other purposes. The FLI concept is being evaluated for its potential to address multiple hazards including clear air turbulence (CAT), volcanic ash, wake vortices, low slant range visibility, dry wind shear, and icing during all phases of flight (takeoff, cruise, and landing). The research accomplished in this second phase of the FLI project was in three major areas: further sensitivity studies to better understand the potential capabilities and requirements for an airborne FLI instrument, field measurements that were conducted in an effort to provide empirical demonstrations of radiometric hazard detection, and theoretical work to support the development of algorithms to determine the severity of detected hazards

West, Leanne↗

NASA NTRS1987

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗

NASA NTRS1993

Resource utilization model for the algorithm to architecture mapping model

The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories.

Stoughton, John W.↗

NASA NTRS1989

Modeling of high speed chemically reacting flow-fields

The SPARK3D and SPARK3D-PNS computer programs were developed to model 3-D supersonic, chemically reacting flow-fields. The SPARK3D code is a full Navier-Stokes solver, and is suitable for use in scramjet combustors and other regions where recirculation may be present. The SPARK3D-PNS is a parabolized Navier-Stokes solver and provides an efficient means of calculating steady-state combustor far-fields and nozzles. Each code has a generalized chemistry package, making modeling of any chemically reacting flow possible. Research activities by the Langley group range from addressing fundamental theoretical issues to simulating problems of practical importance. Algorithmic development includes work on higher order and upwind spatial difference schemes. Direct numerical simulations employ these algorithms to address the fundamental issues of flow stability and transition, and the chemical reaction of supersonic mixing layers and jets. It is believed that this work will lend greater insight into phenomenological model development for simulating supersonic chemically reacting flows in practical combustors. Currently, the SPARK3D and SPARK3D-PNS codes are used to study problems of engineering interest, including various injector designs and 3-D combustor-nozzle configurations. Examples, which demonstrate the capabilities of each code are presented.

Drummond, J. P.↗

NASA NTRS1995

Robust integration schemes for generalized viscoplasticity with internal-state variables. Part 2: Algorithmic developments and implementation

This two-part report is concerned with the development of a general framework for the implicit time-stepping integrators for the flow and evolution equations in generalized viscoplastic models. The primary goal is to present a complete theoretical formulation, and to address in detail the algorithmic and numerical analysis aspects involved in its finite element implementation, as well as to critically assess the numerical performance of the developed schemes in a comprehensive set of test cases. On the theoretical side, the general framework is developed on the basis of the unconditionally-stable, backward-Euler difference scheme as a starting point. Its mathematical structure is of sufficient generality to allow a unified treatment of different classes of viscoplastic models with internal variables. In particular, two specific models of this type, which are representative of the present start-of-art in metal viscoplasticity, are considered in applications reported here; i.e., fully associative (GVIPS) and non-associative (NAV) models. The matrix forms developed for both these models are directly applicable for both initially isotropic and anisotropic materials, in general (three-dimensional) situations as well as subspace applications (i.e., plane stress/strain, axisymmetric, generalized plane stress in shells). On the computational side, issues related to efficiency and robustness are emphasized in developing the (local) interative algorithm. In particular, closed-form expressions for residual vectors and (consistent) material tangent stiffness arrays are given explicitly for both GVIPS and NAV models, with their maximum sizes 'optimized' to depend only on the number of independent stress components (but independent of the number of viscoplastic internal state parameters). Significant robustness of the local iterative solution is provided by complementing the basic Newton-Raphson scheme with a line-search strategy for convergence. In the present second part of the report, we focus on the specific details of the numerical schemes, and associated computer algorithms, for the finite-element implementation of GVIPS and NAV models.

Li, Wei↗

NASA NTRS1984

Atmospheric Effects on Remote Sensing of the Earth's Surface

The main causes and magnitude of the atmospheric effects on remote sensing of the Earth's surface are determined. Theoretical study as well as measurements are included. The knowledge gained from this study will be used to develop atmospheric correction algorithms and to test them with satellite data. In a theoretical investigation of the relative effects of the aerosol optical thickness, absorption, and size distribution on remote sensing, it was found that aerosol absorption has a significant effect on satellite measurements of surface reflectivity. The absorption effect is stronger for high than for low surface reflectances. The aerosol optical thickness is dominant for small surface reflectances. The accuracy of clustering algorithms depends on both parameters. The vegetation index, however, is affected by the optical thickness but only weakly affected by the absorption. A laboratory simulation of the atmospheric effect on the radiance of sunlight scattered from the Earth's surface-atmosphere system was performed. This experiment verified the existence of the adjacency effect (the effect of a bright field on the radiance detected above a dark field) and was used to test 3-D radiative transfer models. In a theoretical study it was found that atmospheric scattering resulting from the adjacency effect reduces the separability between surface classes.

Fraser, R. E.↗

NASA NTRS1990

Computational enhancement of an unsymmetric block Lanczos algorithm

An unsymmetric block Lanczos algorithm has been employed for the dynamic analysis of a large system which has arbitrary damping and/or repeated (or closely spaced) eigenvalues. In the algorithm development, the right and left Lanczos vectors are all theoretically biorthogonal to each other. However, these vectors may lose the biorthogonality owing to cancellation and roundoff errors. For the unsymmetric case there can be a breakdown, even without numerical errors. This paper describes computational techniques which have led to a robust unsymmetric block Lanczos algorithm.

Kim, Hyoung M.↗

NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

NASA NTRS1992

Towards a theory of automated elliptic mesh generation

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Cordova, J. Q.↗