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 793 records · Page 44

Finite element simulation of temperature dependent free surface flows

The method of Engelman and Sani (1984) for a finite-element simulation of incompressible surface flows with a free and/or moving fluid interface, such as encountered in crystal growth and coating and polymer technology, is extended to temperature-dependent flows, including the effect of temperature-dependent surface tension. The basic algorithm of Saito and Scriven (1981) and Ruschak (1980) has been generalized and implemented in a robust and versatile finite-element code that can be employed with relative ease for the simulation of free-surface problems in complex geometries. As a result, the costly dependence on the Newton-Raphson algorithm has been eliminated by replacing it with a quasi-Newton iterative method, which nearly retains the superior convergence properties of the Newton-Raphson method.

Engelman, M. S.↗

Steady and unsteady transonic small disturbance analysis of realistic aircraft configurations

A transonic unsteady aerodynamic and aeroelasticity code CAP-TSD (Computational Aeroelasticity Program-Transonic Small Disturbance) has been developed for application to realistic aircraft configurations. The code uses a time-accurate approximate factorization (AF) algorithm for solution of the unsteady transonic small-disturbance potential equation. The paper gives an overview of the CAP-TSD code development effort and reports on recent algorithm modifications. The algorithm modifications include: an Engquist-Osher (E-O) type-dependent switch to treat regions of supersonic flow, extension of the E-O switch for second-order spatial accuracy, nonisentropic effects to treat strong-shock cases, nonreflecting far field boundary conditions for unsteady applications, and several modifications to accelerate convergence to steady state. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general. Calculations are also presented from a flutter analysis of a 45-deg sweptback wing which agree well with experimental data. The paper present descriptions of the CAP-TSD code and algorithm details along with results.

Batina, John T.↗

Nonlinear structural response using adaptive dynamic relaxation on a massively-parallel-processing system

A parallel adaptive dynamic relaxation (ADR) algorithm has been developed for nonlinear structural analysis. This algorithm has minimal memory requirements, is easily parallelizable and scalable to many processors, and is generally very reliable and efficient for highly nonlinear problems. Performance evaluations on single-processor computers have shown that the ADR algorithm is reliable and highly vectorizable, and that it is competitive with direct solution methods for the highly nonlinear problems considered. The present algorithm is implemented on the 512-processor Intel Touchstone DELTA system at Caltech, and it is designed to minimize the extent and frequency of interprocessor communication. The algorithm has been used to solve for the nonlinear static response of two and three dimensional hyperelastic systems involving contact. Impressive relative speedups have been achieved and demonstrate the high scalability of the ADR algorithm. For the class of problems addressed, the ADR algorithm represents a very promising approach for parallel-vector processing.

Oakley, David R.↗

Quantum Computing to Accelerate High Fidelity Computational Materials Modeling

In this CIF we worked to develop quantum algorithms for material science simulations based on new ideas recently proposed on plane wave basis sets. Many body simulations are not generally performed in plane wave basis sets on classical hardware, but with newly proposed quantum algorithms, it is possible this will be a highly efficient basis set to run quantum simulations on quantum hardware. Using state of the art classical simulations we ran small test simulations to estimate the resources that will be needed to run such plane wave algorithms on quantum hardware. We demonstrate our approach for a series of atoms and molecular systems.

Norman Tubman↗

Hyperspectral Sounder Products: SiFSAP and ClimFiSP

Infrared hyperspectral sounders have demonstrated to provide very high value information for a range of weather and climate applications. Traditional retrieval algorithms of hyperspectral sounders use the ‘cloud clearing’ methodology in the retrieval process due to the lack of means to account for cloud scattering effect. The corresponding Level-2 data products are therefore limited by two major factors: the degradation of spatial resolution as compared with the native resolution of the instruments and the lack of ‘radiance closure’ that is critically needed for climate trend studies. The single field-of-view (FOV) sounder atmospheric products (SiFSAP) algorithm has been developed to supplement existing operational products. The SiFSAP algorithm uses the principal component based radiative transfer model (PCRTM) that is ultra-fast and has been extensively validated for the cloud scattering simulation capability. The cloud properties are physically retrieved along with profiles of temperature, moisture, and trace gases of interest, surface properties simultaneously by fitting single FOV spectral measurements. Therefore, SiFSAP ensure the radiometric consistency between the retrieved geophysical properties and the top-of-atmosphere (TOA) spectral measurements. This presentation provides a general introduction of SiFSAP and details about the physical retrieval algorithm. Also introduced here is a derivative data product of SiFSAP, the climate fingerprinting Sounder Products (ClimFiSP). ClimFiSP include the space-time averaged properties of key climate variables that are derived from the space-time averaged radiances via the spectral fingerprinting scheme. The spectral fingerprinting method allows a low latency data update on ClimFiSP following any potential calibration update on satellite measurements. ClimFiSP also include the rigorously defined uncertainty characterization for trends or anomalies of climate variables, being critical for the construction of long-term climate data record. Both SiFSAP and ClimFiSP will be available to users through NASA's Goddard Earth Sciences Data and Information Services Center (GES DISC).

Wan Wu↗

The NASA CloudSat/GPM Light Precipitation Validation Experiment (LPVEx)

Ground-based measurements of cool-season precipitation at mid and high latitudes (e.g., above 45 deg N/S) suggest that a significant fraction of the total precipitation volume falls in the form of light rain, i.e., at rates less than or equal to a few mm/h. These cool-season light rainfall events often originate in situations of a low-altitude (e.g., lower than 2 km) melting level and pose a significant challenge to the fidelity of all satellite-based precipitation measurements, especially those relying on the use of multifrequency passive microwave (PMW) radiometers. As a result, significant disagreements exist between satellite estimates of rainfall accumulation poleward of 45 deg. Ongoing efforts to develop, improve, and ultimately evaluate physically-based algorithms designed to detect and accurately quantify high latitude rainfall, however, suffer from a general lack of detailed, observationally-based ground validation datasets. These datasets serve as a physically consistent framework from which to test and refine algorithm assumptions, and as a means to build the library of algorithm retrieval databases in higher latitude cold-season light precipitation regimes. These databases are especially relevant to NASA's CloudSat and Global Precipitation Measurement (GPM) ground validation programs that are collecting high-latitude precipitation measurements in meteorological systems associated with frequent coolseason light precipitation events. In an effort to improve the inventory of cool-season high-latitude light precipitation databases and advance the physical process assumptions made in satellite-based precipitation retrieval algorithm development, the CloudSat and GPM mission ground validation programs collaborated with the Finnish Meteorological Institute (FMI), the University of Helsinki (UH), and Environment Canada (EC) to conduct the Light Precipitation Validation Experiment (LPVEx). The LPVEx field campaign was designed to make detailed measurements of cool-season light precipitation by leveraging existing infrastructure in the Helsinki Precipitation Testbed. LPVEx was conducted during the months of September--October, 2010 and featured coordinated ground and airborne remote sensing components designed to observe and quantify the precipitation physics associated with light rain in low-altitude melting layer environments over the Gulf of Finland and neighboring land mass surrounding Helsinki, Finland.

Petersen, Walter A.↗

Optimization of Selected Remote Sensing Algorithms for Embedded NVIDIA Kepler GPU Architecture

This paper evaluates the potential of embedded Graphic Processing Units in the Nvidias Tegra K1 for onboard processing. The performance is compared to a general purpose multi-core CPU and full fledge GPU accelerator. This study uses two algorithms: Wavelet Spectral Dimension Reduction of Hyperspectral Imagery and Automated Cloud-Cover Assessment (ACCA) Algorithm. Tegra K1 achieved 51 for ACCA algorithm and 20 for the dimension reduction algorithm, as compared to the performance of the high-end 8-core server Intel Xeon CPU with 13.5 times higher power consumption.

Riha, Lubomir↗

On the utility of finite element theory for computational fluid dynamics

An implicit finite element numerical solution algorithm is derived for the compressible Navier-Stokes equations expressed in generalized coordinates. The theoretical basis utilizes a Galerkin-Weighted Residuals formulation, and extremization of approximation error within the context of a multipole expansion. A von Neumann analysis for a simplified form indicates the algorithm fourth- to sixth-order phase accurate, with third-order dissipation for the elementary linear element construction. Performance is improved for the algorithm constructed using quadratic interpolation. Numerical experiments for shocked duct flows are employed to optimize the several algorithm parameters. Additional numerical solutions validate algorithm accuracy and utility for aerodynamics applications.

Baker, A. J.↗

Overview of a Generalized Numerical Predictor-Corrector Targeting Guidance with Application to Human-Scale Mars Entry, Descent, and Landing

Recent advances in planetary entry guidance algorithms are motived by precision landing criteria for human-scale Mars missions and improved in-space computing capabilities. An NPC targeting guidance algorithm, originally developed for the Mars Surveyor Program 2001 Missions, has been modified and extended to permit a fully generalized, flexible, and robust approach to spacecraft aerocapture and EDL guidance design. This paper describes this generalized targeting NPC guidance (NPCG) and how its modifications enable its use in precision targeting for human missions. System modeling, trajectory propagation, and guidance segment definition and design are described. Finally, the NPCG capability and performance is demonstrated using a human-scale Mars entry, descent, and landing mission simulation.

Rafael A Lugo↗

A diagonal form of an implicit approximate-factorization algorithm

A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates. The modification transforms the coupled system of equations into an uncoupled diagonal form that requires less computational work. For steady-state applications, the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. The diagonal algorithm reduces the storage requirement of the implicit solution process and therefore has an important effect on the application of implicit finite-difference schemes to vector processors. Results are presented for realistic two-dimensional transonic flow fields about airfoils. Computation costs are reduced to 24-34%.

Pulliam, T. H.↗

Simulation modeling and preliminary analysis of TIMS data from the Carlin area and the northern Grapevine Mountains, Nevada

A theoretical radiance model was employed together with laboratory data on a suite of igneous rock to evaluate various algorithms for processing Thermal Infrared Multispectral Scanner (TIMS) data. Two aspects of the general problem were examined: extraction of emissivity information from the observed TIMS radiance data, and how to use emissivity data in a way that is geologically meaningful. The four algorithms were evaluated for appropriate band combinations of TIMS data acquired on both day and night overflights of the Tuscarora Mountains, including the Carlin gold deposit, in north-central Nevada. Analysis of a color composited PC decorrelated image (Bands 3, 4, 5--blue/green/red) of the Northern Grapevine Mountains, Nevada, area showed some useful correlation with the regional geology. The thermal infrared region provides fundamental spectral information that can be used to discriminate the major rock types occurring on the Earth's surface.

Watson, Ken↗

A Diagonal Form of an Implicit Approximate-Factorization Algorithm

A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates. The modification transforms the coupled system of equations into an uncoupled diagonal form that requires less computational work. For steady-state applications, the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. The diagonal algorithm reduces the storage requirement of the implicit solution process and therefore has an important effect on the application of implicit finite-difference schemes to vector processors. Results are presented for realistic two-dimensional transonic flow fields about airfoils. Computation costs are reduced 24-34%.

Pulliam, T. H.↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Application of optimality criteria in structural synthesis

The rational use of optimality criteria was investigated for a class of structural synthesis problems where materials, configuration and applied load conditions are specified, and the minimum weight design is to be determined. The potential of hybrid methods of structural optimization for dealing with relatively large design problems involving practical complexity was explored. The reduced basis concept in design space was used to decrease the number of generalized design variables dealt with by the mathematical programming algorithm. Optimality criteria methods for obtaining design vectors associated with displacement, system buckling and natural frequency constraints are presented. A stress ratio method was used to generate a basis design vector representing the stress constraints. The finite element displacement method was used as the basic structural analysis tool. Results for several examples of truss systems subject to stress, displacement and minimum size constraints are presented. An assessment of these results indicates the effectiveness of the hybrid method developed.

Terai, K.↗

Control automation in undersea manipulation systems

The requirements for the successful use of automated manipulation in an undersea environment are discussed, and initial specifications for systems which share control between a human operator and an autonomous control element are established. Areas of concern include: (1) objectives of automation; (2) characteristics of the underwater task; (3) hierarchy of control algorithms; (4) man/machine interface; (5) sensory feedback; and (6) general system organization. Special emphasis is placed on the solutions to the problem of controlling an undersea manipulator which is capable of performing certain automatic functions and implementing these solutions using current technology. Current capabilities for control automation are summarized.

Freedy, A.↗

Extension of Gauss' method for the solution of Kepler's equation

Gauss' method for solving Kepler's equation is extended to arbitrary epochs and orbital eccentricities. Although originally developed for near parabolic orbits in the vicinity of pericenter, a generalization of the method leads to a highly efficient algorithm which compares favorably to other methods in current use. A key virtue of the technique is that convergence is obtained by a method of successive substitutions with an initial approximation that is independent of the orbital parameters. The equations of the algorithm are universal, i.e., independent of the nature of the orbit whether elliptic, hyperbolic, parabolic or rectilinear.

Battin, R. H.↗

Establishment of a rotor model basis

Radial-dimension computations in the RSRA's blade-element model are modified for both the acquisition of extensive baseline data and for real-time simulation use. The baseline data, which are for the evaluation of model changes, use very small increments and are of high quality. The modifications to the real-time simulation model are for accuracy improvement, especially when a minimal number of blade segments is required for real-time synchronization. An accurate technique for handling tip loss in discrete blade models is developed. The mathematical consistency and convergence properties of summation algorithms for blade forces and moments are examined and generalized integration coefficients are applied to equal-annuli midpoint spacing. Rotor conditions identified as 'constrained' and 'balanced' are used and the propagation of error is analyzed.

Mcfarland, R. E.↗

Entropy condition satisfying approximations for the full potential equations of transonic flow

A class of conservative difference approximations for the steady full potential equation was presented. They are, in general, easier to program than the usual density biasing algorithms, and in fact, differ only slightly from them. Rigorous proof indicated that these new schemes satisfied a new discrete entropy inequality, which ruled out expansion shocks, and that they have sharp, steady, discrete shocks. A key tool in the analysis is the construction of a new entropy inequality for the full potential equation itself. Results of some numerical experiments using the new schemes are presented.

Osher, S.↗