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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Vegetation Effects on Soil Moisture Estimation

Several successful algorithms have been developed to estimate soil moisture of bare surfaces. We previously reported a new algorithm using the tilted Bragg approximation. However, these algorithms are only applicable to bare surfaces. When vegetation is present, soil moisture is typically underestimated by bare surface algorithms. In order to derive soil moisture under vegetation, we have to understand the complex scattering process due to vegetation. Our main interest is to retrieve the global soil moisture information using Hydros L-band polarimetric radar data. The Hydros mission will provide the first global view of land soil moisture using L-band radar and radiometer. The unique characteristics of the Hydros data are the availability of the low resolution soil moisture information from radiometer data and the continuous time series radar data collected at the same incidence angle. In this paper, we will examine a potential inversion algorithm to retrieve soil moisture under vegetation canopies using Hydros L-band polarimetric radar data.

soil moisture↗
NASA NTRS1985

A fast efficient implicit scheme for the gasdynamic equations using a matrix reduction technique

An efficient implicit finite-difference algorithm for the gasdynamic equations utilizing matrix reduction techniques is presented. A significant reduction in arithmetic operations is achieved without loss of the stability characteristics generality found in the Beam and Warming approximate factorization algorithm. Steady-state solutions to the conservative Euler equations in generalized coordinates are obtained for transonic flows and used to show that the method offers computational advantages over the conventional Beam and Warming scheme. Existing Beam and Warming codes can be retrofit with minimal effort. The theoretical extension of the matrix reduction technique to the full Navier-Stokes equations in Cartesian coordinates is presented in detail. Linear stability, using a Fourier stability analysis, is demonstrated and discussed for the one-dimensional Euler equations.

Barth, T. J.↗
NASA NTRS2004

Review of TRMM/GPM Rainfall Algorithm Validation

A review is presented concerning current progress on evaluation and validation of standard Tropical Rainfall Measuring Mission (TRMM) precipitation retrieval algorithms and the prospects for implementing an improved validation research program for the next generation Global Precipitation Measurement (GPM) Mission. All standard TRMM algorithms are physical in design, and are thus based on fundamental principles of microwave radiative transfer and its interaction with semi-detailed cloud microphysical constituents. They are evaluated for consistency and degree of equivalence with one another, as well as intercompared to radar-retrieved rainfall at TRMM's four main ground validation sites. Similarities and differences are interpreted in the context of the radiative and microphysical assumptions underpinning the algorithms. Results indicate that the current accuracies of the TRMM Version 6 algorithms are approximately 15% at zonal-averaged / monthly scales with precisions of approximately 25% for full resolution / instantaneous rain rate estimates (i.e., level 2 retrievals). Strengths and weaknesses of the TRMM validation approach are summarized. Because the dew of convergence of level 2 TRMM algorithms is being used as a guide for setting validation requirements for the GPM mission, it is important that the GPM algorithm validation program be improved to ensure concomitant improvement in the standard GPM retrieval algorithms. An overview of the GPM Mission's validation plan is provided including a description of a new type of physical validation model using an analytic 3-dimensional radiative transfer model.

Smith, Eric A.↗
NASA NTRS1988

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗
NASA NTRS1993

Producing approximate answers to database queries

We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. The exact answer is produced if all of the needed data are available and query processing is allowed to continue until completion. The monotone query processing algorithm of APPROXIMATE works within the standard relational algebra framework and can be implemented on a relational database system with little change to the relational architecture. We describe here the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations of both set-valued and single-valued queries. We show how APPROXIMATE is implemented to make effective use of semantic information, provided by an object-oriented view of the database, and describe the additional overhead required by APPROXIMATE.

Vrbsky, Susan V.↗
NASA NTRS1988

Parallel algorithm for determining motion vectors in ice floe images by matching edge features

A parallel algorithm is described to determine motion vectors of ice floes using time sequences of images of the Arctic ocean obtained from the Synthetic Aperture Radar (SAR) instrument flown on-board the SEASAT spacecraft. Researchers describe a parallel algorithm which is implemented on the MPP for locating corresponding objects based on their translationally and rotationally invariant features. The algorithm first approximates the edges in the images by polygons or sets of connected straight-line segments. Each such edge structure is then reduced to a seed point. Associated with each seed point are the descriptions (lengths, orientations and sequence numbers) of the lines constituting the corresponding edge structure. A parallel matching algorithm is used to match packed arrays of such descriptions to identify corresponding seed points in the two images. The matching algorithm is designed such that fragmentation and merging of ice floes are taken into account by accepting partial matches. The technique has been demonstrated to work on synthetic test patterns and real image pairs from SEASAT in times ranging from .5 to 0.7 seconds for 128 x 128 images.

Manohar, M.↗
NASA NTRS1986

Multiple grid problems on concurrent-processing computers

Three computer codes were studied which make use of concurrent processing computer architectures in computational fluid dynamics (CFD). The three parallel codes were tested on a two processor multiple-instruction/multiple-data (MIMD) facility at NASA Ames Research Center, and are suggested for efficient parallel computations. The first code is a well-known program which makes use of the Beam and Warming, implicit, approximate factored algorithm. This study demonstrates the parallelism found in a well-known scheme and it achieved speedups exceeding 1.9 on the two processor MIMD test facility. The second code studied made use of an embedded grid scheme which is used to solve problems having complex geometries. The particular application for this study considered an airfoil/flap geometry in an incompressible flow. The scheme eliminates some of the inherent difficulties found in adapting approximate factorization techniques onto MIMD machines and allows the use of chaotic relaxation and asynchronous iteration techniques. The third code studied is an application of overset grids to a supersonic blunt body problem. The code addresses the difficulties encountered when using embedded grids on a compressible, and therefore nonlinear, problem. The complex numerical boundary system associated with overset grids is discussed and several boundary schemes are suggested. A boundary scheme based on the method of characteristics achieved the best results.

Eberhardt, D. S.↗
NASA NTRS1993

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel↗
NASA NTRS1977

Implicit approximate-factorization schemes for the efficient solution of steady transonic flow problems

Implicit approximate-factorization algorithms (AF) are developed for the solution of steady-state transonic flow problems. The performance of the AF solution method is evaluated relative to that of the standard solution method for transonic flow problems, successive line over-relaxation (SLOR). Both methods are applied to the solution of the nonlinear, two-dimensional transonic small-disturbance equation. Results indicate that the AF method requires substantially less computer time than SLOR to solve the nonlinear finite-difference matrix equation for a transonic flow field. This increase in computational efficiency is achieved with no appreciable increase in computer storage or coding complexity.

Ballhaus, W. F.↗
NASA NTRS1978

Geological applications of thermal-inertia mapping from satellite

The author has identified the following significant results. A more efficient algorithm for calculating surface temperature was developed. This algorithm was determined to be essentially exact, and relative accuracies in determining thermal inertia of the finite difference and the linear Fourier series algorithms were approximately 5% for both. A procedure for performing geometric registration was developed.

Offield, T. W.↗
NASA NTRS1978

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗
NASA NTRS1980

Transonic airfoil design code

Program aids in design of shockless airfoils, assists development of fuel-conserving, supercritical wings. Algorithm calculates approximate airfoil shape given prescribed pressure distribution. This allows design of families of transonic airfoils for use in aircraft wings or turbine and compressor blades. Program is written in FORTRAN IV for batch execution on CDC-6000.

Bauer, F.↗
NASA NTRS1981

Implicit calculations of transonic flows using monotone methods

Implicit approximate-factorization algorithms have been developed that use monotone methods for the calculation of steady and unsteady transonic flows governed by the small-disturbance-potential equation. These algorithms use the new Engquist-Osher switch in the type-dependent differencing in place of the standard Murman-Cole switch. The resulting algorithms are more stable; hence, calculations can be done more efficiently. For steady flows, the convergence rate is about 35% faster, and for unsteady flows the allowable time step is about 10 times larger. These improvements are achieved with no increase in computer storage and with only minor modifications in codes that use the Murman-Cole switch. Also an implicit algorithm has been developed for the steady full-potential equation in one-dimension, which uses monotone methods.

Goorjian, P. M.↗
NASA NTRS1981

Navier-Stokes solutions for nonaxisymmetric nozzle flows

The compressible Navier-Stokes equations for two-dimensional and three-dimensional flow are solved for nonaxisymmetric nozzle configurations. Both internal flow alone and combined internal and external flow cases are considered. An implicit approximate factorization algorithm is employed to solve the governing equations which are cast in terms of a body-fitted coordinate system. Turbulence closure is accomplished with a composite algebraic model. Two-dimensional results for a wedge plug nozzle flow in the form of surface pressures compare favorably with experimental data. Three-dimensional calculations for two nonaxisymmetric nozzles are also presented and compared with data.

Swanson, R. C.↗
NASA NTRS1982

Numerical solution of transonic wing flow fields

A fast, fully implicit, approximate factorization algorithm designed to solve the conservative full-potential equation is used to compute lifting-wing flow fields with embedded transonic flow. The computer program (TWING - transonic wing analysis) uses an elliptic-solver numerical grid-generation routine and is capable of analyzing arbitrary wing geometries with sweep, twist, taper, and section variation. Computed flowfield results for several wing geometries are presented; they demonstrate substantial improvement in convergence speed relative to the FL028 computer code.

Holst, T. L.↗
NASA NTRS1983

Numerical solution of three-dimensional unsteady transonic flow over wings including inviscid/viscous interactions

A numerical procedure is presented for computing the unsteady transonic flow field about three dimensional swept wings undergoing general time dependent motion. The outer inviscid portion of the flow is assumed to be governed by the modified unsteady transonic small disturbance potential equation which is integrated in the time domain by means of an efficient alternating direction implicit approximate factorization algorithm. Gross dominant effects of the shock boundary layer interaction are accounted for by a simple empirically defined model. Viscous flow regions adjacent to the wing surface and in the trailing wake are described by a set of integral equations appropriate for compressible turbulent shear layers. The two dimensional boundary layer equations are applied quasi-statically stripwise across the span. Coupling with the outer inviscid flow is implemented through use of the displacement thickness concept within the limitations of small disturbance theory. Validity of the assumptions underlying the method is established by comparison with experimental data for the flow about a high aspect ratio transport wing having an advanced airfoil section.

Rizzetta, D. P.↗
NASA NTRS1985

A three-dimensional incompressible flow simulation method and its application to the Space Shuttle main engine. II Turbulent flow

An implicit finite difference code cast in general curvilinear coordinates is further developed for three-dimensional incompressible turbulent flows. The code is based on the method of pseudocompressibility and utilizes the Beam and Warming implicit approximate factorization algorithm to achieve computational efficiency. A multiple-zone method is further extended to include composite-grids to overcome the excessive computer memory required for solving turbulent flows in complex three-dimensional geometries. A simple turbulence model is proposed for internal flows. The code is being used for the Space Shuttle Main Engine (SSME) internal flow analyses.

Chang, J. L. C.↗