Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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,783 records · Page 99

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗

Color graphics techniques for shaded surface displays of aerodynamic flowfield parameters

A variety of algorithms are presented that are useful in the color graphics displays of large sets of three-dimensional aerodynamic data. These methods augment established techniques for rapidly and interactively reviewing an assortment of smooth-shaded, color-coded illustrations for experimental and computational distributions of both scalar and vector quantities.

Weston, Robert P.↗

A Study of Fluid Interface Configurations in Exploration Vehicle Propellant Tanks

The equilibrium shape and location of fluid interfaces in spacecraft propellant tanks while in low-gravity is of interest to system designers, but can be challenging to predict. The propellant position can affect many aspects of the spacecraft such as the spacecraft center of mass, response to thruster firing due to sloshing, liquid acquisition, propellant mass gauging, and thermal control systems. We use Surface Evolver, a fluid interface energy minimizing algorithm, to investigate theoretical equilibrium liquid-vapor interfaces for spacecraft propellant tanks similar to those that have been considered for NASA's new class of Exploration vehicles. The choice of tank design parameters we consider are derived from the NASA Exploration Systems Architecture Study report. The local acceleration vector employed in the computations is determined by estimating low-Earth orbit (LEO) atmospheric drag effects and centrifugal forces due to a fixed spacecraft orientation with respect to the Earth or Moon, and rotisserie-type spacecraft rotation. Propellant/vapor interface positions are computed for the Earth Departure Stage and Altair lunar lander descent and ascent stage tanks for propellant loads applicable to LEO and low-lunar orbit. In some of the cases investigated the vapor ullage bubble is located at the drain end of the tank, where propellant management device hardware is often located.

Zimmerli, Gregory A.↗

Data Access Performance Through Parallelization and Vectored Access: Some Results

High Energy Physics data processing and analysis applications typically deal with the problem of accessing and processing data at high speed. Recent studies, development and test work have shown that the latencies due to data access can often be hidden by parallelizing them with the data processing, thus giving the ability to have applications which process remote data with a high level of efficiency. Techniques and algorithms able to reach this result have been implemented in the client side of the Scalla/xrootd system, and in this contribution we describe the results of some tests done in order to compare their performance and characteristics. These techniques, if used together with multiple streams data access, can also be effective in allowing to efficiently and transparently deal with data repositories accessible via a Wide Area Network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametrization of textural patterns in {sup 123}I-ioflupane imaging for the automatic detection of Parkinsonism

Purpose: A novel approach to a computer aided diagnosis system for the Parkinson's disease is proposed. This tool is intended as a supporting tool for physicians, based on fully automated methods that lead to the classification of{sup 123}I-ioflupane SPECT images. Methods: {sup 123}I-ioflupane images from three different databases are used to train the system. The images are intensity and spatially normalized, then subimages are extracted and a 3D gray-level co-occurrence matrix is computed over these subimages, allowing the characterization of the texture using Haralick texture features. Finally, different discrimination estimation methods are used to select a feature vector that can be used to train and test the classifier. Results: Using the leave-one-out cross-validation technique over these three databases, the system achieves results up to a 97.4% of accuracy, and 99.1% of sensitivity, with positive likelihood ratios over 27. Conclusions: The system presents a robust feature extraction method that helps physicians in the diagnosis task by providing objective, operator-independent textural information about{sup 123}I-ioflupane images, commonly used in the diagnosis of the Parkinson's disease. Textural features computation has been optimized by using a subimage selection algorithm, and the discrimination estimation methods used here makes the system feature-independent, allowing us to extend it to other databases and diseases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Systematic Generation of Moment Invariant Bases for 2D and 3D Tensor Fields

Moment invariants have been successfully applied to pattern detection tasks in 2D and 3D scalar, vector, and matrix valued data. However so far no flexible basis of invariants exists, i.e., no set that is optimal in the sense that it is complete and independent for every input pattern. Here, we prove that a basis of moment invariants can be generated that consists of tensor contractions of not more than two different moment tensors each under the conjecture of the set of all possible tensor contractions to be complete. This result allows us to derive the first generator algorithm that produces flexible bases of moment invariants with respect to orthogonal transformations by selecting a single non-zero moment to pair with all others in these two-factor products. Since at least one non-zero moment can be found in every non-zero pattern, this approach always generates a complete set of descriptors.

97 MATHEMATICS AND COMPUTING↗

Geometrical analysis of Cys-Cys bridges in proteins and their prediction from incomplete structural information

Analysis of C-alpha atom positions from cysteines involved in disulphide bridges in protein crystals shows that their geometric characteristics are unique with respect to other Cys-Cys, non-bridging pairs. They may be used for predicting disulphide connections in incompletely determined protein structures, such as low resolution crystallography or theoretical folding experiments. The basic unit for analysis and prediction is the 3 x 3 distance matrix for Cx positions of residues (i - 1), Cys(i), (i +1) with (j - 1), Cys(j), (j + 1). In each of its columns, row and diagonal vector--outer distances are larger than the central distance. This analysis is compared with some analytical models.

NASA Discipline Exobiology↗

A gyro-gauge independent minimal guiding-center reduction by Lie-transforming the velocity vector field

We introduce a gyro-gauge independent formulation of a simplified guiding-center reduction, which removes the fast time-scale from particle dynamics by Lie-transforming the velocity vector field. This is close to Krylov-Bogoliubov method of averaging the equations of motion, although more geometric. At leading order, the Lie-transform consists in the generator of Larmor gyration, which can be explicitly inverted, while working with gauge-independent coordinates and operators, by using the physical gyro-angle as a (constrained) coordinate. This brings both the change of coordinates and the reduced dynamics of the minimal guiding-center reduction order by order in a Larmor radius expansion. The procedure is algorithmic and the reduction is systematically derived up to full second order, in a more straightforward way than when Lie-transforming the phase-space Lagrangian or averaging the equations of motion. The results write up some structures in the guiding-center expansion. Extensions and limitations of the method are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of jointly sparse vectors via manifold optimization

In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This result reveals a reduction in the computational complexity of the original problem and enables a simple implementation of joint sparse recovery algorithms for full-rank setting. Secondly, we propose a new method for joint sparse recovery in the form of a non-convex optimization problem on a non-compact Stiefel manifold. In our numerical experiments our method outperforms the commonly used l 2,1 minimization in the sense that much fewer measurements are required for accurate sparse reconstructions. Here, we postulate this approach possesses the desirable rank aware property, that is, being able to take advantage of the rank of the unknown matrix to improve the recovery.

97 MATHEMATICS AND COMPUTING↗

Spin-wave multiple excitations in nanoscale classical Heisenberg antiferromagnets

Monte Carlo and spin dynamics techniques have been used to perform large-scale simulations of the dynamic behavior of a nanoscale, classical, Heisenberg antiferromagnet on a simple-cubic lattice with linear sizes L≤ 40 at a temperature below the Neel temperature. In this study, nanoparticles are modeled with completely free boundary conditions, i.e., six free surfaces, and nanofilms are modeled with two free surfaces in the spatial z direction and periodic boundaries parallel to the surfaces in the xy direction, which are compared to the infinite system with periodic boundary conditions. The temporal evolutions of spin configurations were determined numerically from coupled equations of motion for individual spins using a fast spin dynamics algorithm with the fourth-order Suzuki-Trotter decomposition of exponential operators, with initial spin configurations generated by Monte Carlo simulations. The local dynamic structure factor S(q,ω) was calculated from the local space- and time-displaced spin-spin correlation function. Multiple excitation peaks for wave vectors within the first Brillouin zone appear in the spin-wave spectra of the transverse component of dynamic structure factor S T (q,ω) in the nanoscale classical Heisenberg antiferromagnet, which are lacking if periodic boundary conditions are used. With the assumption of q-space spin-wave reflections with broken momentum conservation due to free-surface confinements, we successfully explained those spectra quantitatively in the linear dispersion region. Meanwhile, we also observed two unexpected quantized spin-wave excitation modes in the spatial z direction in nanofilms for S T (q,ω) not expected in bulk systems. In conclusion, the results of this study indicate the presence of unexpected forms of spin-wave excitation behavior that have yet to be observed experimentally but could be directly tested through neutron scattering experiments on nanoscale RbMnF 3 particles or films.

36 MATERIALS SCIENCE↗

Automated thematic mapping and change detection of ERTS-1 images

Results of an automated thematic mapping investigation using ERTS-1 MSS images are presented. A diffraction pattern analysis of MSS images led to the development of spatial signatures for farm land, urban areas, and mountains. Four spatial features are employed to describe the spatial characteristics of image cells in the digital data. Three spectral features are combined with the spatial features to form a seven dimensional vector describing each cell. Then, the classification of the feature vectors is accomplished by using the maximum likelihood criterion. Three ERTS-1 images from the Phoenix, Arizona area were processed, and recognition rates between 85% and 100% were obtained for the terrain classes of desert, farms, mountains and urban areas. To eliminate the need for training data, a new clustering algorithm has also been developed.

Gramenopoulos, N.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure distributions and drag-to-lift ration minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure disributions and drag-to-lift ratio minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

Comparison of Seasat scatterometer winds with tropical Pacific observations

The Seasat-A satellite scatterometer (SASS) observed near-surface vector winds over the world ocean from an 800-km orbit by measuring radar backscatter from the wind-roughened surface. To increase the geographical range of SASS and in situ comparison experiments, data from nine islands in the tropical Pacific and contemporaneous scatterometer winds were compared. The SASS-2 algorithm due to Wentz provides clearly better agreement in wind speed than the earlier SASS-1 algorithm. SASS-1 speeds tend to be higher than the island measurements by about 1 m/s, while daily mean SASS-2 minus island wind speed differences average -0.07 m/s. The rms differences between SASS-2 and the daily mean island data average 1.7 m/s, the SASS-1 rms differences average 2.2 m/s.

Davison, Jerry↗

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗

Comments regarding two upwind methods for solving two-dimensional external flows using unstructured grids

Steady flow over the leading portion of a multicomponent airfoil section is studied using computational fluid dynamics (CFD) employing an unstructured grid. To simplify the problem, only the inviscid terms are retained from the Reynolds-averaged Navier-Stokes equations - leaving the Euler equations. The algorithm is derived using the finite-volume approach, incorporating explicit time-marching of the unsteady Euler equations to a time-asymptotic, steady-state solution. The inviscid fluxes are obtained through either of two approximate Riemann solvers: Roe's flux difference splitting or van Leer's flux vector splitting. Results are presented which contrast the solutions given by the two flux functions as a function of Mach number and grid resolution. Additional information is presented concerning code verification techniques, flow recirculation regions, convergence histories, and computational resources.

Kleb, W. L.↗

Adjoint Methods for Adjusting Three-Dimensional Atmosphere and Surface Properties to Fit Multi-Angle/Multi-Pixel Polarimetric Measurements

This paper derives an efficient procedure for using the three-dimensional (3D) vector radiative transfer equation (VRTE) to adjust atmosphere and surface properties and improve their fit with multi-angle/multi-pixel radiometric and polarimetric measurements of scattered sunlight. The proposed adjoint method uses the 3D VRTE to compute the measurement misfit function and the adjoint 3D VRTE to compute its gradient with respect to all unknown parameters. In the remote sensing problems of interest, the scalar-valued misfit function quantifies agreement with data as a function of atmosphere and surface properties, and its gradient guides the search through this parameter space. Remote sensing of the atmosphere and surface in a three-dimensional region may require thousands of unknown parameters and millions of data points. Many approaches would require calls to the 3D VRTE solver in proportion to the number of unknown parameters or measurements. To avoid this issue of scale, we focus on computing the gradient of the misfit function as an alternative to the Jacobian of the measurement operator. The resulting adjoint method provides a way to adjust 3D atmosphere and surface properties with only two calls to the 3D VRTE solver for each spectral channel, regardless of the number of retrieval parameters, measurement view angles or pixels. This gives a procedure for adjusting atmosphere and surface parameters that will scale to the large problems of 3D remote sensing. For certain types of multi-angle/multi-pixel polarimetric measurements, this encourages the development of a new class of three-dimensional retrieval algorithms with more flexible parametrizations of spatial heterogeneity, less reliance on data screening procedures, and improved coverage in terms of the resolved physical processes in the Earth's atmosphere.

linearization↗

Adjoint Methods for Adjusting Three-Dimensional Atmosphere and Surface Properties to Fit Multi-Angle Multi-Pixel Polarimetric Measurements

This paper derives an efficient procedure for using the three-dimensional (3D) vector radiative transfer equation (VRTE) to adjust atmosphere and surface properties and improve their fit with multi-angle/multi-pixel radiometric and polarimetric measurements of scattered sunlight. The proposed adjoint method uses the 3D VRTE to compute the measurement misfit function and the adjoint 3D VRTE to compute its gradient with respect to all unknown parameters. In the remote sensing problems of interest, the scalar-valued misfit function quantifies agreement with data as a function of atmosphere and surface properties, and its gradient guides the search through this parameter space. Remote sensing of the atmosphere and surface in a three-dimensional region may require thousands of unknown parameters and millions of data points. Many approaches would require calls to the 3D VRTE solver in proportion to the number of unknown parameters or measurements. To avoid this issue of scale, we focus on computing the gradient of the misfit function as an alternative to the Jacobian of the measurement operator. The resulting adjoint method provides a way to adjust 3D atmosphere and surface properties with only two calls to the 3D VRTE solver for each spectral channel, regardless of the number of retrieval parameters, measurement view angles or pixels. This gives a procedure for adjusting atmosphere and surface parameters that will scale to the large problems of 3D remote sensing. For certain types of multi-angle/multi-pixel polarimetric measurements, this encourages the development of a new class of three-dimensional retrieval algorithms with more flexible parametrizations of spatial heterogeneity, less reliance on data screening procedures, and improved coverage in terms of the resolved physical processes in the Earth׳s atmosphere.

adjoint methods↗