Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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,459 records · Page 81

Numerical model for dendritic solidification of binary alloys

A finite element model capable of simulating solidification of binary alloys and the formation of freckles is presented. It uses a single system of equations to deal with the all-liquid region, the dendritic region, and the all-solid region. The dendritic region is treated as an anisotropic porous medium. The algorithm uses the bilinear isoparametric element, with a penalty function approximation and a Petrov-Galerkin formulation. Numerical simulations are shown in which an NH4Cl-H2O mixture and a Pb-Sn alloy melt are cooled. The solidification process is followed in time. Instabilities in the process can be clearly observed and the final compositions obtained.

Felicelli, S. D.↗

Obtaining the Grobner Initialization for the Ground Flash Fraction Retrieval Algorithm

At optical wavelengths and from the vantage point of space, the multiple scattering cloud medium obscures one's view and prevents one from easily determining what flashes strike the ground. However, recent investigations have made some progress examining the (easier, but still difficult) problem of estimating the ground flash fraction in a set of N flashes observed from space In the study by Koshak, a Bayesian inversion method was introduced for retrieving the fraction of ground flashes in a set of flashes observed from a (low earth orbiting or geostationary) satellite lightning imager. The method employed a constrained mixed exponential distribution model to describe the lightning optical measurements. To obtain the optimum model parameters, a scalar function of three variables (one of which is the ground flash fraction) was minimized by a numerical method. This method has formed the basis of a Ground Flash Fraction Retrieval Algorithm (GoFFRA) that is being tested as part of GOES-R GLM risk reduction.

Solakiewicz, R.↗

Ice-Over-Water Cloud Properties in an Artificial Neural Network Approach

Clouds are a crucial component of the atmospheric energy system, particularly the radiative balance within, above, and below the troposphere. The vertical distribution of cloud mass and phase determines layer heating rates, the loss of radiation to space, and the amount of radiative heating at the surface. Thus, it is important to know how clouds are distributed both vertically and horizontally at all times of day. Satellite remote sensing is the only approach available to monitor clouds day and night around the globe. In this paper several artificial neural network (ANN) algorithms, employing several Aqua MODIS infrared channels, profiles of relative humidity and temperature from GMAO numerical weather analyses, and the retrieved total cloud visible optical depth, are trained to detect multilayer ice-over-water cloud systems and to retrieve some of their properties as identified by a year of 2008 Aqua MODIS data matched with CloudSat and CALIPSO (CC) cloud profiles. The CC lidar and radar profiles provide the vertical structure that serves as output truth for the multilayer algorithm. The neural networks were trained using one year (2008) of cloud top height data from the CC dataset, with correlation around 0.94 (0.95) and MAE as low as 0.82 (0.81) km for nonpolar regions during the day (night). Applying the trained ANN to independent year 2009 MODIS data resulted in a combined ML and single layer hit rate of 86.4% (85.1%) for nonpolar regions during the day (night). Since the ANN is trained using near-nadir MODIS pixels, infrared radiance corrections were developed as a function of view zenith angle from MODIS and applied to off-nadir pixels when processing MODIS swath data. The multilayer amount derived with the ANN is relatively invariant with increasing view zenith angle compared to the multilayer amount without the corrections.

MODIS↗

Memory-Efficient Onboard Rock Segmentation

Rockster-MER is an autonomous perception capability that was uploaded to the Mars Exploration Rover Opportunity in December 2009. This software provides the vision front end for a larger software system known as AEGIS (Autonomous Exploration for Gathering Increased Science), which was recently named 2011 NASA Software of the Year. As the first step in AEGIS, Rockster-MER analyzes an image captured by the rover, and detects and automatically identifies the boundary contours of rocks and regions of outcrop present in the scene. This initial segmentation step reduces the data volume from millions of pixels into hundreds (or fewer) of rock contours. Subsequent stages of AEGIS then prioritize the best rocks according to scientist- defined preferences and take high-resolution, follow-up observations. Rockster-MER has performed robustly from the outset on the Mars surface under challenging conditions. Rockster-MER is a specially adapted, embedded version of the original Rockster algorithm ("Rock Segmentation Through Edge Regrouping," (NPO- 44417) Software Tech Briefs, September 2008, p. 25). Although the new version performs the same basic task as the original code, the software has been (1) significantly upgraded to overcome the severe onboard re source limitations (CPU, memory, power, time) and (2) "bulletproofed" through code reviews and extensive testing and profiling to avoid the occurrence of faults. Because of the limited computational power of the RAD6000 flight processor on Opportunity (roughly two orders of magnitude slower than a modern workstation), the algorithm was heavily tuned to improve its speed. Several functional elements of the original algorithm were removed as a result of an extensive cost/benefit analysis conducted on a large set of archived rover images. The algorithm was also required to operate below a stringent 4MB high-water memory ceiling; hence, numerous tricks and strategies were introduced to reduce the memory footprint. Local filtering operations were re-coded to operate on horizontal data stripes across the image. Data types were reduced to smaller sizes where possible. Binary- valued intermediate results were squeezed into a more compact, one-bit-per-pixel representation through bit packing and bit manipulation macros. An estimated 16-fold reduction in memory footprint relative to the original Rockster algorithm was achieved. The resulting memory footprint is less than four times the base image size. Also, memory allocation calls were modified to draw from a static pool and consolidated to reduce memory management overhead and fragmentation. Rockster-MER has now been run onboard Opportunity numerous times as part of AEGIS with exceptional performance. Sample results are available on the AEGIS website at http://aegis.jpl.nasa.gov.

Burl, Michael C.↗

A numerical study of three-dimensional separated flow past a hemisphere cylinder

Separated and vortical flow about a hemisphere-cylinder body has been investigated. An algorithm featuring two implicit factors, and partial flux splitting has been used to solve the thin-layer Navier-Stokes equations. In analyzing the complex flow patterns, experimental data and topological concepts are used to complement the numerical results in interpreting the surface-flow patterns as well as the flowfield structures. Basic issues concerning the three-dimensional separation characteristics and the leeward vortical structures are examined.

Ying, Susan X.↗

Reynolds stress closure in jet flows using wave models

A wave model was developed for the two dimensional shear layer. This configuration is being used as a test case for the closure schemes. Numerical methods are under development to solve the nonseparable Rayleigh equation. A model problem is being used to assist in the algorithm development. An analytic solution of the Rayleigh equation for a basic elliptic flow was obtained. This will be used to verify the stability codes developed for arbitrary geometries. Other numerical methods for solving the Rayleigh equation based on the boundary element technique are being examined.

Morris, P. J.↗

Convective Weather Forecast Quality Metrics for Air Traffic Management Decision-Making

Since numerical weather prediction models are unable to accurately forecast the severity and the location of the storm cells several hours into the future when compared with observation data, there has been a growing interest in probabilistic description of convective weather. The classical approach for generating uncertainty bounds consists of integrating the state equations and covariance propagation equations forward in time. This step is readily recognized as the process update step of the Kalman Filter algorithm. The second well known method, known as the Monte Carlo method, consists of generating output samples by driving the forecast algorithm with input samples selected from distributions. The statistical properties of the distributions of the output samples are then used for defining the uncertainty bounds of the output variables. This method is computationally expensive for a complex model compared to the covariance propagation method. The main advantage of the Monte Carlo method is that a complex non-linear model can be easily handled. Recently, a few different methods for probabilistic forecasting have appeared in the literature. A method for computing probability of convection in a region using forecast data is described in Ref. 5. Probability at a grid location is computed as the fraction of grid points, within a box of specified dimensions around the grid location, with forecast convection precipitation exceeding a specified threshold. The main limitation of this method is that the results are dependent on the chosen dimensions of the box. The examples presented Ref. 5 show that this process is equivalent to low-pass filtering of the forecast data with a finite support spatial filter. References 6 and 7 describe the technique for computing percentage coverage within a 92 x 92 square-kilometer box and assigning the value to the center 4 x 4 square-kilometer box. This technique is same as that described in Ref. 5. Characterizing the forecast, following the process described in Refs. 5 through 7, in terms of percentage coverage or confidence level is notionally sound compared to characterizing in terms of probabilities because the probability of the forecast being correct can only be determined using actual observations. References 5 through 7 only use the forecast data and not the observations. The method for computing the probability of detection, false alarm ratio and several forecast quality metrics (Skill Scores) using both the forecast and observation data are given in Ref. 2. This paper extends the statistical verification method in Ref. 2 to determine co-occurrence probabilities. The method consists of computing the probability that a severe weather cell (grid location) is detected in the observation data in the neighborhood of the severe weather cell in the forecast data. Probabilities of occurrence at the grid location and in its neighborhood with higher severity, and with lower severity in the observation data compared to that in the forecast data are examined. The method proposed in Refs. 5 through 7 is used for computing the probability that a certain number of cells in the neighborhood of severe weather cells in the forecast data are seen as severe weather cells in the observation data. Finally, the probability of existence of gaps in the observation data in the neighborhood of severe weather cells in forecast data is computed. Gaps are defined as openings between severe weather cells through which an aircraft can safely fly to its intended destination. The rest of the paper is organized as follows. Section II summarizes the statistical verification method described in Ref. 2. The extension of this method for computing the co-occurrence probabilities in discussed in Section HI. Numerical examples using NCWF forecast data and NCWD observation data are presented in Section III to elucidate the characteristics of the co-occurrence probabilities. This section also discusses the procedure for computing throbabilities that the severity of convection in the observation data will be higher or lower in the neighborhood of grid locations compared to that indicated at the grid locations in the forecast data. The probability of coverage of neighborhood grid cells is also described via examples in this section. Section IV discusses the gap detection algorithm and presents a numerical example to illustrate the method. The locations of the detected gaps in the observation data are used along with the locations of convective weather cells in the forecast data to determine the probability of existence of gaps in the neighborhood of these cells. Finally, the paper is concluded in Section V.

Chatterji, Gano B.↗

A new second-order integration algorithm for simulating mechanical dynamic systems

A new integration algorithm which has the simplicity of Euler integration but exhibits second-order accuracy is described. In fixed-step numerical integration of differential equations for mechanical dynamic systems the method represents displacement and acceleration variables at integer step times and velocity variables at half-integer step times. Asymptotic accuracy of the algorithm is twice that of trapezoidal integration and ten times that of second-order Adams-Bashforth integration. The algorithm is also compatible with real-time inputs when used for a real-time simulation. It can be used to produce simulation outputs at double the integration frame rate, i.e., at both half-integer and integer frame times, even though it requires only one evaluation of state-variable derivatives per integration step. The new algorithm is shown to be especially effective in the simulation of lightly-damped structural modes. Both time-domain and frequency-domain accuracy comparisons with traditional integration methods are presented. Stability of the new algorithm is also examined.

Howe, R. M.↗

A three-dimensional dual potential procedure with applications to wind tunnel inlets and interacting boundary layers

A dual potential decomposition of the velocity field into a scalar and a vector potential function is extended to three dimensions and used in the finite-difference simulation of steady three-dimensional inviscid rotational flows and viscous flow. The finite-difference procedure was used to simulate the flow through the 80 by 120 ft wind tunnel at NASA Ames Research Center. Rotational flow produced by the stagnation pressure drop across vanes and screens which are located at the entrance of the inlet is modeled using actuator disk theory. Results are presented for two different inlet vane and screen configurations. The numerical predictions are in good agreement with experimental data. The dual potential procedure was also applied to calculate the viscous flow along two and three dimensional troughs. Viscous effects are simulated by injecting vorticity which is computed from a boundary layer algorithm. For attached flow over a three dimensional trough, the present calculations are in good agreement with other numerical predictions. For separated flow, it is shown from a two dimensional analysis that the boundary layer approximation provides an accurate measure of the vorticity in regions close to the wall; whereas further away from the wall, caution has to be exercised in using the boundary-layer equations to supply vorticity to the dual potential formulation.

Rao, K. V.↗

Numerical studies of unsteady two dimensional subsonic flows using the ICE method

A numerical program was developed to compute transient compressible and incompressible laminar flows in two dimensions with multicomponent mixing and chemical reaction. The algorithm used the Los Alamos Scientific Laboratory ICE (Implicit Continuous-Fluid Eulerian) method as its base. The program can compute both high and low speed compressible flows. The numerical program incorporating the stabilization techniques was quite successful in treating both old and new problems. Detailed calculations of coaxial flow very close to the entry plane were possible. The program treated complex flows such as the formation and downstream growth of a recirculation cell. An implicit solution of the species equation predicted mixing and reaction rates which compared favorably with the literature.

Wieber, P. R.↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗

Stability analysis of numerical boundary conditions and implicit difference approximations for hyperbolic equations

Implicit, noniterative, finite difference schemes were recently developed by several authors for multidimensional systems of nonlinear hyperbolic partial differential equations. When applied to linear model equations with periodic boundary conditions those schemes are unconditionally stable (A-stable). As applied in practice the algorithms often face a severe time step restriction. A major source of the difficulty is the treatment of the numerical boundary conditions. One conjecture was that unconditional stability requires implicit numerical boundary conditions. An apparent counter example was the space time extrapolation considered by Gustafsson, Kreiss, and Sunstrom. Spatial (implicit) and space time (explicit) extrapolation using normal mode analysis for a finite and infinite number of spatial mesh intervals are examined. The results indicate that for unconditional stability with a finite number of spatial mesh intervals, the numerical boundary conditions must be implicit.

Beam, R. M.↗

Algorithms and software for solving finite element equations on serial and parallel architectures

Over the past 15 years numerous new techniques have been developed for solving systems of equations and eigenvalue problems arising in finite element computations. A package called SPARSPAK has been developed by the author and his co-workers which exploits these new methods. The broad objective of this research project is to incorporate some of this software in the Computational Structural Mechanics (CSM) testbed, and to extend the techniques for use on multiprocessor architectures.

George, Alan↗

Numerical simulation of three-dimensional transonic turbulent projectile aerodynamics by TVD schemes

The two-dimensional symmetric TVD scheme proposed by Yee has been extended to and investigated for three-dimensional thin-layer Navier-Stokes simulation of complex aerodynamic problems. An existing three-dimensional Navier-stokes code based on the beam and warming algorithm is modified to provide an option of using the TVD algorithm and the flow problem considered is a transonic turbulent flow past a projectile with sting at ten-degree angle of attack. Numerical experiments conducted for three flow cases, free-stream Mach numbers of 0.91, 0.96 and 1.20 show that the symmetric TVD algorithm can provide surface pressure distribution in excellent agreement with measured data; moreover, the rate of convergence to attain a steady state solution is about two times faster than the original beam and warming algorithm.

Shiau, Nae-Haur↗

Foundations for statistical-physical precipitation retrieval from passive microwave satellite measurements. II - Emission-source and generalized weighting-function properties of a time-dependent cloud-radiation model

The foremost physical aspects of microphysical-radiative interactions that control the formation and modulation of frequency-dependent passive microwave TB over a continental cold-rain precipitation system are explained within the framework of the essential ingredients of a physically based precipitation-retrieval algorithm. The analysis is based on a modeling study in which a 3D cloud model has provided the objective basis for generating an extensive set of microphysical profiles that describe numerous precipitation features in the course of the evolution of a continental hail storm. A summary of the various components of the algorithm, as well as the surface rain rates, is given. The algorithm employs the cloud model to provide a consistent and objectively generated source of detailed microphysical information as the underpinnings to an inversion-based perturbative retrieval scheme.

Mugnai, Alberto↗

The nondeterministic divide

The nondeterministic divide partitions a vector into two non-empty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-and-conquer sequential algorithm on one or more vectors of the same range, whose division point for a new pair of recursive calls is chosen nondeterministically before any computation is performed and whose recursive calls are made immediately after the choice of division point; also, access to vector components is only permitted during activations in which the vector parameters have unit length. The notion of diva algorithm is formulated precisely as a diva call, a restricted call on a sequential procedure. Diva calls are proven to be intimately related to associativity. Numerous applications of diva calls are given and strategies are described for translating a diva call into code for a variety of parallel computers. Thus diva algorithms separate logical correctness concerns from implementation concerns.

Charlesworth, Arthur↗

The Geostationary Lightning Mapper (GLM) for the GOES-R Series Next Generation Operational Environmental Satellite Constellation

The next generation Geostationary Operational Environmental Satellite (GOES-R) series with a planned launch in 2015 is a follow on to the existing GOES system currently operating over the Western Hemisphere. The system will aid in forecasting severe storms and tornado activity, and convective weather impacts on aviation safety and efficiency. The system provides products including lightning, cloud properties, rainfall rate, volcanic ash, air quality, hurricane intensity, and fire/hot spot characterization. Advancements over current GOES include a new capability for total lightning detection (cloud and cloud-to-ground flashes) from the Geostationary Lightning Mapper (GLM), and improved spectral, spatial, and temporal resolution for the 16-channel Advanced Baseline Imager (ABI). The Geostationary Lightning Mapper (GLM), an optical transient detector will map total (in-cloud and cloud-to-ground) lightning flashes continuously day and night with near-uniform spatial resolution of 8 km with a product refresh rate of less than 20 sec over the Americas and adjacent oceanic regions, from the west coast of Africa (GOES-E) to New Zealand (GOES-W) when the constellation is fully operational. In parallel with the instrument development, a GOES-R Risk Reduction Team and Algorithm Working Group Lightning Applications Team have begun to develop the higher level algorithms and applications using the GLM alone and decision aids incorporating information from the ABI, ground-based weather radar, and numerical models. Proxy total lightning data from the NASA Lightning Imaging Sensor on the Tropical Rainfall Measuring Mission (TRMM) satellite and regional lightning networks are being used to develop the pre-launch algorithms and applications, and also improve our knowledge of thunderstorm initiation and evolution. Real time total lightning mapping data are also being provided in an experimental mode to selected National Weather Service (NWS) national centers and forecast offices via the GOES-R Proving Ground to help improve our understanding of the application of these data in operational settings and facilitate early on-orbit user readiness for this new capability.

Goodman, Steven J.↗

A sparse matrix algorithm on the Boolean vector machine

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Wagner, Robert A.↗