Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation algorithms”

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 217 records · Page 12

Transonic solutions of a wing/pylon/finned store using hybrid domain decomposition

Transonic Euler calculations about a complex multicomponent configuration are presented. The 3D Euler equations are solved utilizing an upwind-biased, alternating direction implicit, approximately factored, multigrid algorithm. Computational results are compared to experimental data of the finned store in a carriage position.

Newman, James C., III↗

Site partitioning for distributed redundant disk arrays

Distributed redundant disk arrays can be used in a distributed computing system or database system to provide recovery in the presence of temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites into redundant arrays in such way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-complete and we propose two heuristic algorithms for finding approximate solutions.

Mourad, Antoine N.↗

First MEM task IRMEO in IRAF

The first task for image restoration using the Maximum Entropy Method (MEM) in IRAF, called IRMEO, is described. The underlining algorithm is the approximate Newton method for optimization. The basic input images and parameters for deconvolution are described in some detail. Results of preliminary tests, including the number of iterations, required CPU time on a variety of computers, and deconvolved images are reported and compared with those from other deconvolution methods. The merits and limitations of this task are pointed out. The possible development of better MEM tasks on the basis of IRMEO is also discussed.

Wu, Nailong↗

Computation of unsteady flows over airfoils

Two methods are described for calculating unsteady flows over rapidly pitching airfoils. The first method is based on an interactive scheme in which the inviscid flow is obtained by a panel method. The boundary layer flow is computed by an interactive method that makes use of the Hilbert integral to couple the solutions of the inviscid and viscous flow equations. The second method is based on the solution of the compressible Navier-Stokes equations. The solution of these equations is obtained with an approximately factorized numerical algorithm, and with single block or multiple grids which enable grid embedding to enhance the resolution at isolated flow regions. In addition, the attached flow region can be computed by the numerical solution of compressible boundary layer equations. Unsteady pressure distributions obtained with both methods are compared with available experimental data.

Ekaterinaris, J. A.↗

Effects of spatial order of accuracy on the computation of vortical flowfields

The objective of the present investigation is to assess the effect of the spatial order of accuracy used for the evaluation of the inviscid fluxes on the resolution of higher order quantitites, such as velocity gradients. The viscous terms are computed as second-order accurate with central difference formulas, even though for the explicit part of the algorithm higher order approximations may be used. A viscous/inviscid method is used, and the outer part of the flowfield is computed with the inviscid flow equations. The viscous boundary-layer type flow region close to the body surface is computed with an algebraic eddy viscosity model. Results obtained with the conservative and nonconservative formulations and the viscous/inviscid approach are compared with available experimental data. The effect of grid refinement on the accuracy of the solution is also presented.

Ekaterinaris, J. A.↗

On the Effective Construction of Compactly Supported Wavelets Satisfying Homogenous Boundary Conditions on the Interval

We construct compactly supported wavelet bases satisfying homogeneous boundary conditions on the interval (0,1). The maximum features of multiresolution analysis on the line are retained, including polynomial approximation and tree algorithms. The case of H(sub 0)(sup 1)(0, 1)is detailed, and numerical values, required for the implementation, are provided for the Neumann and Dirichlet boundary conditions.

Chiavassa, G.↗

Aerothermodynamic Measurement and Prediction for Modified Orbiter at Mach 6 and 10

Detailed heat-transfer rate distributions measured laterally over the windward surface of an orbiter-like configuration using thin-film resistance heat-transfer gauges and globally using the newly developed relative intensity, two-color thermographic phosphor technique are presented for Mach 6 and 10 in air. The angle of attack was varied from 0 to 40 deg, and the freestream Reynolds number based on the model length was varied from 4 x 10(exp 5) to 6 x 10(exp 6) at Mach 6, corresponding to laminar, transitional, and turbulent boundary layers; the Reynolds number at Mach 10 was 4 x 10(exp 5), corresponding to laminar flow. The primary objective of the present study was to provide detailed benchmark heat-transfer data for the calibration of computational fluid-dynamics codes. Predictions from a Navier-Stokes solver referred to as the Langley aerothermodynamic upwind relaxation algorithm and an approximate boundary-layer solving method known as the axisymmetric analog three-dimensional boundary layer code are compared with measurement. In general, predicted laminar heat-transfer rates are in good agreement with measurements.

Micol, John R.↗

Site Partitioning for Redundant Arrays of Distributed Disks

Redundant arrays of distributed disks (RADD) can be used in a distributed computing system or database system to provide recovery in the presence of disk crashes and temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites of a distributed storage system into redundant arrays in such a way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-hard. We then propose and evaluate several heuristic algorithms for finding approximate solutions. Simulation results show that significant reduction in remote parity update costs can be achieved by optimizing the site partitioning scheme.

Mourad, Antoine N.↗

MODIS Status

The Moderate Resolution Imaging Spectroradiometer (MODIS) was sent into orbit on the Earth Observing System (EOS) Terra spacecraft in December 1999. The MODIS began taking observations on February 24, 2000. Instrument checkout and characterization progressed to the point in the Fall of 2000 along with the checkout of algorithms so that approximately 40 products for land, ocean and atmosphere studies on global and regional scales were and are now being produced systematically. These products are now designated "beta", products indicating that they are still being examined and validated, but in most cases are amenable to examination by the scientific and applications community to further assess their utility and provide feedback to the validation process and the MODIS Science Team. It is expected that many products will progress to "provisionally useful" or fully "validated" status by mid-year 2001. one goal is to produce a systematically processed data set by the end of 2001 from MODIS extends from November 2000 through October 2001. Overall the MODIS instrument and the associated data processing systems are performing well. The many examples of MODIS observations indicate that the prospect for highly useful and exciting studies of the Earth-atmosphere system using MODIS data looks very good.

Salomonson, Vincent V.↗

On Kalman filter solution of space-time interpolation

The approximate Kalman filtering algorithm presented in [1] for image sequence processing can introduce unacceptable negative eigenvalues in the information matrix and can have degraded performance in some applications. The improved algorithm presented in this note guarantees a positive definite information matrix, leading to more stable filter performance.

data↗

Post-Flight Performance Analysis of Navigation and Advanced Guidance Algorithms on a Terrestrial Suborbital Rocket Flight

There is currently renewed interest in robotic and crewed landers for a return to the lunar surface. Advanced guidance and navigation algorithms are essential to accurately delivering cargo and crew safely to the moon successfully. This paper reports the overall performance of an integrated set of navigation and guidance algorithms flown on a terrestrial suborbital rocket up to an altitude of approximately 100km. The navigation algorithm consists of an onboard extended Kalman Filter (EKF) that ingests multiple sensor measurements, one of which is the output from a terrain relative navigation (TRN) algorithm that cross-references camera images to on-board satellite imagery to perform feature correlation within the camera image. The guidance algorithm solves for a 6-degree-of-freedom (DoF) optimal trajectory using a successive convexification method during powered descent. The altitude range as well as the landing dynamics experienced during this test flight are realistic for an extraterrestrial landing and provide an invaluable data set to gauge the current development of these landing algorithms in an effort to advance the overall software readiness levels (SRL). This paper will delve into different aspects of each algorithm and present an analysis of the in-flight performance of the algorithms. This flight was conducted under the National Aeronautics and Space Administration (NASA) Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project focused on technology advancement for landing applications.

Guidance↗

Back to the Future: Consistency-Based Trajectory Tracking

Given a model of a physical process and a sequence of commands and observations received over time, the task of an autonomous controller is to determine the likely states of the process and the actions required to move the process to a desired configuration. We introduce a representation and algorithms for incrementally generating approximate belief states for a restricted but relevant class of partially observable Markov decision processes with very large state spaces. The algorithm presented incrementally generates, rather than revises, an approximate belief state at any point by abstracting and summarizing segments of the likely trajectories of the process. This enables applications to efficiently maintain a partial belief state when it remains consistent with observations and revisit past assumptions about the process' evolution when the belief state is ruled out. The system presented has been implemented and results on examples from the domain of spacecraft control are presented.

Kurien, James↗

Performance analysis for the expanding search PN acquisition algorithm

An approach is described for approximating the cumulative probability distribution of the acquisition time of the serial pseudonoise (PN) search algorithm. The results are applicable to both variable and fixed dwell time systems. The theory is developed for the case where some a priori information is available on the PN code epoch (reacquisition problem or acquisition of very long codes). Also considered is the special case of a search over the whole code. The accuracy of the approximation is demonstrated by comparisons with published exact results for the fixed dwell time algorithm.

Braun, W. R.↗

A comparison of computational methods and algorithms for the complex gamma function

A survey and comparison of some computational methods and algorithms for gamma and log-gamma functions of complex arguments are presented. Methods and algorithms reported include Chebyshev approximations, Pade expansion and Stirling's asymptotic series. The comparison leads to the conclusion that Algorithm 421 published in the Communications of ACM by H. Kuki is the best program either for individual application or for the inclusion in subroutine libraries.

Ng, E. W.↗

EEG Artifact Removal Using a Wavelet Neural Network

!n this paper we developed a wavelet neural network. (WNN) algorithm for Electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural network and the time/frequency property of wavelet. We. compared the WNN algorithm with .the ICA technique ,and a wavelet thresholding method, which was realized by using the Stein's unbiased risk estimate (SURE) with an adaptive gradient-based optimal threshold. Experimental results on a driving test data set show that WNN can remove EEG artifacts effectively without diminishing useful EEG information even for very noisy data.

Nguyen, Hoang-Anh T.↗

Practical implementation of an accurate method for multilevel design sensitivity analysis

Solution techniques for handling large scale engineering optimization problems are reviewed. Potentials for practical applications as well as their limited capabilities are discussed. A new solution algorithm for design sensitivity is proposed. The algorithm is based upon the multilevel substructuring concept to be coupled with the adjoint method of sensitivity analysis. There are no approximations involved in the present algorithm except the usual approximations introduced due to the discretization of the finite element model. Results from the six- and thirty-bar planar truss problems show that the proposed multilevel scheme for sensitivity analysis is more effective (in terms of computer incore memory and the total CPU time) than a conventional (one level) scheme even on small problems. The new algorithm is expected to perform better for larger problems and its applications on the new generation of computer hardwares with 'parallel processing' capability is very promising.

Nguyen, Duc T.↗