Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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,207 records · Page 67

An Architecture for Real-Time Interpretation and Visualization of Structural Sensor Data in a Laboratory Environment

A visualization system is being developed out of the need to monitor, interpret, and make decisions based on the information from several thousand sensors during experimental testing to facilitate development and validation of structural health monitoring algorithms. As an added benefit the system will enable complete real-time sensor assessment of complex test specimens. Complex structural specimens are routinely tested that have hundreds or thousands of sensors. During a test, it is impossible for a single researcher to effectively monitor all the sensors and subsequently interesting phenomena occur that are not recognized until post-test analysis. The ability to detect and alert the researcher to these unexpected phenomena as the test progresses will significantly enhance the understanding and utilization of complex test articles. Utilization is increased by the ability to halt a test when the health monitoring algorithm response is not satisfactory or when an unexpected phenomenon occurs, enabling focused investigation potentially through the installation of additional sensors. Often if the test continues, structural changes make it impossible to reproduce the conditions that exhibited the phenomena. The prohibitive time and costs associated with fabrication, sensoring, and subsequent testing of additional test articles generally makes it impossible to further investigate the phenomena. A scalable architecture is described to address the complex computational demands of structural health monitoring algorithm development and laboratory experimental test monitoring. The researcher monitors the test using a photographic quality 3D graphical model with actual sensor locations identified. In addition, researchers can quickly activate plots displaying time or load versus selected sensor response along with the expected values and predefined limits. The architecture has several key features. First, distributed dissimilar computers may be seamlessly integrated into the information flow. Second, virtual sensors may be defined that are complex functions of existing sensors or other virtual sensors. Virtual sensors represent a calculated value not directly measured by particular physical instrument. They can be used, for example, to represent the maximum difference in a range of sensors or the calculated buckling load based on the current strains. Third, the architecture enables autonomous response to preconceived events, where by the system can be configured to suspend or abort a test if a failure is detected in the load introduction system. Fourth, the architecture is designed to allow cooperative monitoring and control of the test progression from multiple stations both remote and local to the test system. To illustrate the architecture, a preliminary implementation is described monitoring the Stitched Composite Wing recently tested at LaRC.

Doggett, William↗

Spectral Correlation in MODIS Water-Leaving Reflectance Retrieval Uncertainty

Spectral remote sensing reflectance, Rrs(λ) (sr−1), is the fundamental quantity used to derive a host of bio-optical and biogeochemical properties of the water column from satellite ocean color measurements. Estimation of uncertainty in those derived geophysical products is therefore dependent on knowledge of the uncertainty in satellite-retrieved R rs . Furthermore, since the associated algorithms require R rs at multiple spectral bands, the spectral (i.e., band-to-band)error covariance in R rs is needed to accurately estimate the uncertainty in those derived properties. This study establishes a derivative-based approach for propagating instrument random noise, instrument systematic uncertainty, and forward model uncertainty into R rs as retrieved using NASA’s multiple-scattering epsilon (MSEPS) atmospheric correction algorithm, to generate pixel-level error covariance in R rs . The approach is applied to measurements from Moderate Resolution Imaging Spectroradiometer (MODIS) on the Aqua satellite and verified using Monte Carlo (MC) analysis. We also make use of this full spectral error covariance in R rs to calculate uncertainty in phytoplankton pigment chlorophyll-a concentration (chl a , mg/m 3 ) and diffuse attenuation coefficient of downwelling irradiance at 490 nm (K d (490), m -1 ). Accounting for the error covariance in R rs generally reduces the estimated relative uncertainty in chl a by ∼1-2% (absolute value) in waters with chl a < 0.25 mg/m 3 where the color index (CI) algorithm is used. The reduction is ∼5-10% in waters with chl a > 0.35 mg/m 3 where the blue-green ratio (OCX) algorithm is used. Such reduction can be higher than 30% in some regions. For K d (490), the reduction by error covariance is generally ∼2%, but can be higher than 20% in some regions. The error covariance in R rs is further verified through forward-calculating chl a from MODIS-retrieved and in situ R rs and comparing estimated uncertainty with observed differences. An 8-day global composite of propagated uncertainty shows that the goal of 35% uncertainty in chl a can be achieved over deep ocean waters (chl a ≤ 0.1 mg/m3). While the derivative-based approach generates reasonable error covariance in R rs some assumptions should be updated as our knowledge improves. These include the inter-band error correlation in top-of-atmosphere reflectance, and uncertainties in the calibration of MODIS 869 nm band, in ancillary data, and in the in situ data used for system vicarious calibration.

Ocean color↗

General approaches for achieving high speed computations

The basic organizational approach to achieve high speed computations has been to execute several instructions concurrently. Various algorithmic structures and related computer organizations have been identified and used for this purpose. Each of them is better suited for some classes of applications, provides a potential speed-up with respect to the sequential computer, and suffers from degradation factors that reduce the effective speed-up obtained. The basic algorithmic structures are presented, the corresponding computer organizations described and the potential degradation factors identified. Also included are considerations related to the cost of the system and to the corresponding programming methodology.

Lang, T.↗

Experiments on Supervised Learning Algorithms for Text Categorization

Modern information society is facing the challenge of handling massive volume of online documents, news, intelligence reports, and so on. How to use the information accurately and in a timely manner becomes a major concern in many areas. While the general information may also include images and voice, we focus on the categorization of text data in this paper. We provide a brief overview of the information processing flow for text categorization, and discuss two supervised learning algorithms, viz., support vector machines (SVM) and partial least squares (PLS), which have been successfully applied in other domains, e.g., fault diagnosis [9]. While SVM has been well explored for binary classification and was reported as an efficient algorithm for text categorization, PLS has not yet been applied to text categorization. Our experiments are conducted on three data sets: Reuter's- 21578 dataset about corporate mergers and data acquisitions (ACQ), WebKB and the 20-Newsgroups. Results show that the performance of PLS is comparable to SVM in text categorization. A major drawback of SVM for multi-class categorization is that it requires a voting scheme based on the results of pair-wise classification. PLS does not have this drawback and could be a better candidate for multi-class text categorization.

Namburu, Setu Madhavi↗

Digital SAR processing using a fast polynomial transform

A new digital processing algorithm based on the fast polynomial transform is developed for producing images from Synthetic Aperture Radar data. This algorithm enables the computation of the two dimensional cyclic correlation of the raw echo data with the impulse response of a point target, thereby reducing distortions inherent in one dimensional transforms. This SAR processing technique was evaluated on a general-purpose computer and an actual Seasat SAR image was produced. However, regular production runs will require a dedicated facility. It is expected that such a new SAR processing algorithm could provide the basis for a real-time SAR correlator implementation in the Deep Space Network.

Butman, S.↗

Digital SAR processing using a fast polynomial transform

A new digital processing algorithm based on the fast polynomial transform is developed for producing images from Synthetic Aperture Radar data. This algorithm enables the computation of the two dimensional cyclic correlation of the raw echo data with the impulse response of a point target, thereby reducing distortions inherent in one dimensional transforms. This SAR processing technique was evaluated on a general-purpose computer and an actual Seasat SAR image was produced. However, regular production runs will require a dedicated facility. It is expected that such a new SAR processing algorithm could provide the basis for a real-time SAR correlator implementation in the Deep Space Network. Previously announced in STAR as N82-11295

Truong, T. K.↗

Parallel processors and nonlinear structural dynamics algorithms and software

A nonlinear structural dynamics program with an element library that exploits parallel processing is under development. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program. As a byproduct an automatic scheme for assigning time steps was devised. A rudimentary form of the program is complete and has been tested; it shows substantial advantage can be taken of parallelism. In addition, a stability proof for the subcycling algorithm has been developed.

Belytschko, T.↗

Application of unstructured grid methods to steady and unsteady aerodynamic problems

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

Batina, John T.↗

An order (n) algorithm for the dynamics simulation of robotic systems

The formulation of an Order (n) algorithm for DISCOS (Dynamics Interaction Simulation of Controls and Structures), which is an industry-standard software package for simulation and analysis of flexible multibody systems is presented. For systems involving many bodies, the new Order (n) version of DISCOS is much faster than the current version. Results of the experimental validation of the dynamics software are also presented. The experiment is carried out on a seven-joint robot arm at NASA's Goddard Space Flight Center. The algorithm used in the current version of DISCOS requires the inverse of a matrix whose dimension is equal to the number of constraints in the system. Generally, the number of constraints in a system is roughly proportional to the number of bodies in the system, and matrix inversion requires O(p exp 3) operations, where p is the dimension of the matrix. The current version of DISCOS is therefore considered an Order (n exp 3) algorithm. In contrast, the Order (n) algorithm requires inversion of matrices which are small, and the number of matrices to be inverted increases only linearly with the number of bodies. The newly-developed Order (n) DISCOS is currently capable of handling chain and tree topologies as well as multiple closed loops. Continuing development will extend the capability of the software to deal with typical robotics applications such as put-and-place, multi-arm hand-off and surface sliding.

Chun, H. M.↗

Multivariate interactive digital analysis system /MIDAS/ - A new fast multispectral recognition system

The MIDAS system is a prototype, multiple-pipeline digital processor mechanizing the multivariate-Gaussian, maximum-likelihood decision algorithm operating at 200,000 pixels/second. It incorporates displays and film printer equipment under control of a general purpose midi-computer and possesses sufficient flexibility that operational versions of the equipment may be subsequently specified as subsets of the system.

Kriegler, F.↗

A geostationary longitude acquisition planning algorithm

The paper is concerned with the phase of the geosynchronous mission termed station acquisition, which involves the maneuvering of a spacecraft to its geostationary longitude by means of the spacecraft propulsion system. An algorithm which assists in maneuver planning is described, and examples of its use are presented. The algorithm can be applied when sequences of more than three maneuvers are to be expected. While, in general, three maneuvers are sufficient to achieve the desired end conditions when orbital mechanics are the only consideration, operational considerations may add constraints resulting in an increased number of maneuvers required.

Petruzzo, C. J.↗

Analysis techniques for multivariate root loci

Analysis and techniques are developed for the multivariable root locus and the multivariable optimal root locus. The generalized eigenvalue problem is used to compute angles and sensitivities for both types of loci, and an algorithm is presented that determines the asymptotic properties of the optimal root locus.

Thompson, P. M.↗

Contrast reduction by the atmosphere and retrieval of nonuniform surface reflectance

A radiative transfer model is developed which gives the upward radiance at nadir for any 1-D Lambertian surface reflectance. This model is used to depict the atmospheric effect on the transmittance of contrast for any 1-D surface reflectance. Here by contrast we mean a general variation of the radiation field across the image. With the aid of this model an inversion algorithm is developed for retrieval of true surface reflectance from high resolution satellite data (e.g., Landsat). This inversion technique can be a useful tool for extraction of surface reflectance from satellite data in the case of a surface reflectance variable in one dimension only (e.g., seashore or near borders of big fields). A sensitivity study of the inversion procedure on the knowledge of atmospheric parameters and sensor calibration was performed. It is shown that this inversion technique is stable even in the presence of errors in the sensor calibration and the atmospheric parameters. The method was applied to Landsat data in two wavelengths. The results show reasonable dependence of the derived surface reflectance on the distance from the seashore.

Mekler, Y.↗

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗

Mesh generation by conformal and quasiconformal mappings

It is pointed out that many recent advances in the finite-difference solution of elliptic equations have been limited to regions whose boundary contours coincide with coordinate lines of the Cartesian coordinate system. The reason for this is related to the fact that in the case of an arbitrary curvilinear coordinate system the original equation becomes much more complex. However, there is no added complexity if an orthogonal coordinate system is generated from a conformal mapping. In the present investigation, a finite difference method developed for the construction of conformal mappings has been generalized to construct quasi-conformal mappings. It is expected that the use of more sophisticated numerical algorithms could lead to improvements in both speed and accuracy. Quasi-conformal mappings have applications not only in the solution of elliptic equations but also in other areas such as orthogonal mesh generation on surfaces and the solution of certain fluid flow problems.

Mastin, C. W.↗

A fully vectorized numerical solution of the incompressible Navier-Stokes equations

A vectorizable algorithm is presented for the implicit finite difference solution of the incompressible Navier-Stokes equations in general curvilinear coordinates. The unsteady Reynolds averaged Navier-Stokes equations solved are in two dimension and non-conservative primitive variable form. A two-layer algebraic eddy viscosity turbulence model is used to incorporate the effects of turbulence. Two momentum equations and a Poisson pressure equation, which is obtained by taking the divergence of the momentum equations and satisfying the continuity equation, are solved simultaneously at each time step. An elliptic grid generation approach is used to generate a boundary conforming coordinate system about an airfoil. The governing equations are expressed in terms of the curvilinear coordinates and are solved on a uniform rectangular computational domain. A checkerboard SOR, which can effectively utilize the computer architectural concept of vector processing, is used for iterative solution of the governing equations.

Patel, N.↗

A comparison of the efficiency of numerical methods for integrating chemical kinetic rate equations

The efficiency of several algorithms used for numerical integration of stiff ordinary differential equations was compared. The methods examined included two general purpose codes EPISODE and LSODE and three codes (CHEMEQ, CREK1D and GCKP84) developed specifically to integrate chemical kinetic rate equations. The codes were applied to two test problems drawn from combustion kinetics. The comparisons show that LSODE is the fastest code available for the integration of combustion kinetic rate equations. It is shown that an iterative solution of the algebraic energy conservation equation to compute the temperature can be more efficient then evaluating the temperature by integrating its time-derivative.

Radhakrishnan, K.↗

Embedded mesh solutions of the Euler equation using a multiple-grid method

New developments make it now possible to obtain solutions to Euler equations for many problems on the basis of acceptable computing times. The possibility of an extension of these methods to more difficult flows and increasingly complex geometries can depend on obtaining suitable grid structures. Thus, an attractive approach to complex geometries involves the recasting of the problem into the framework of a multiple-grid structure. The discrete equations represented on the grid are solved as a simultaneous system. In the present investigation, this is accomplished with the aid of Ni's multiple-grid algorithm. The multiple-grid structure provided in this study represents the first step towards a completely general modular approach to the solution of the complete compressible flow problem. In the presented cases, a fine mesh resolution is obtained within the embedded mesh regions, while preserving the global coarse mesh convergence rates.

Usab, W. J., Jr.↗