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 559 records · Page 31

Dynamic Forms. Part 1: Functions

The formalism of dynamic forms is developed as a means for organizing and systematizing the design control systems. The formalism allows the designer to easily compute derivatives to various orders of large composite functions that occur in flight-control design. Such functions involve many function-of-a-function calls that may be nested to many levels. The component functions may be multiaxis, nonlinear, and they may include rotation transformations. A dynamic form is defined as a variable together with its time derivatives up to some fixed but arbitrary order. The variable may be a scalar, a vector, a matrix, a direction cosine matrix, Euler angles, or Euler parameters. Algorithms for standard elementary functions and operations of scalar dynamic forms are developed first. Then vector and matrix operations and transformations between parameterization of rotations are developed in the next level in the hierarchy. Commonly occurring algorithms in control-system design, including inversion of pure feedback systems, are developed in the third level. A large-angle, three-axis attitude servo and other examples are included to illustrate the effectiveness of the developed formalism. All algorithms were implemented in FORTRAN code. Practical experience shows that the proposed formalism may significantly improve the productivity of the design and coding process.

Meyer, George↗

VECTOR TOMOGRAPHY FOR THE CORONAL MAGNETIC FIELD. II. HANLE EFFECT MEASUREMENTS

In this paper, we investigate the feasibility of saturated coronal Hanle effect vector tomography or the application of vector tomographic inversion techniques to reconstruct the three-dimensional magnetic field configuration of the solar corona using linear polarization measurements of coronal emission lines. We applied Hanle effect vector tomographic inversion to artificial data produced from analytical coronal magnetic field models with equatorial and meridional currents and global coronal magnetic field models constructed by extrapolation of real photospheric magnetic field measurements. We tested tomographic inversion with only Stokes Q, U, electron density, and temperature inputs to simulate observations over large limb distances where the Stokes I parameters are difficult to obtain with ground-based coronagraphs. We synthesized the coronal linear polarization maps by inputting realistic noise appropriate for ground-based observations over a period of two weeks into the inversion algorithm. We found that our Hanle effect vector tomographic inversion can partially recover the coronal field with a poloidal field configuration, but that it is insensitive to a corona with a toroidal field. This result demonstrates that Hanle effect vector tomography is an effective tool for studying the solar corona and that it is complementary to Zeeman effect vector tomography for the reconstruction of the coronal magnetic field.

79 ASTRONOMY AND ASTROPHYSICS↗

Using trees to compute approximate solutions to ordinary differential equations exactly

Some recent work is reviewed which relates families of trees to symbolic algorithms for the exact computation of series which approximate solutions of ordinary differential equations. It turns out that the vector space whose basis is the set of finite, rooted trees carries a natural multiplication related to the composition of differential operators, making the space of trees an algebra. This algebraic structure can be exploited to yield a variety of algorithms for manipulating vector fields and the series and algebras they generate.

Grossman, Robert↗

Symmetric normal mixtures

We consider mixture density estimation under the symmetry constraint x = Az for an orthogonal matrix A. This distributional constraint implies a corresponding constraint on the mixture parameters. Focusing on the gaussian case, we derive an expectation-maximization (EM) algorithm to enforce the constraint and show results for modeling of image feature vectors.

symmetry constraint↗

Simplified Syndrome Decoding of (n, 1) Convolutional Codes

A new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.

I. S. Reed↗

Flux-split algorithms for flows with non-equilibrium chemistry and vibrational relaxation

The present consideration of numerical computation methods for gas flows with nonequilibrium chemistry thermodynamics gives attention to an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Flux-splitting procedures are developed for the fully-coupled inviscid equations encompassing fluid dynamics and both chemical and internal energy-relaxation processes. A fully coupled and implicit large-block structure is presented which embodies novel forms of flux-vector split and flux-difference split algorithms valid for nonequilibrium flow; illustrative high-temperature shock tube and nozzle flow examples are given.

Grossman, B.↗

The vector classifier

A linear classifier is developed. The classifier algorithm derives, from the picture element (pixel) response values, the response values for a point (called footpoint) consisting of determined proportions of distinct and operator defined land surfaces. The algorithm decides whether the pixel contains the content of the defined surfaces by testing the footpoint to pixelpoint distance against an operator specified threshold value. The test can be either of statistical or geometric form. Those pixels which give a positive result to the test are subclassified according to the proportions of the distinct land surfaces. The practical characteristics of the classifier are discussed and the classification results achieved, in a number of test areas, are described. The artificial nature of the classifier assumptions relate to certain land surface conditions. Testing the suitability of the classifier for other conditions is discussed.

Mccloy, K. R.↗

The development of flux-split algorithms for flows with non-equilibrium thermodynamics and chemical reactions

A finite-volume method for the numerical computation of flows with nonequilibrium thermodynamics and chemistry is presented. A thermodynamic model is described which simplifies the coupling between the chemistry and thermodynamics and also results in the retention of the homogeneity property of the Euler equations (including all the species continuity and vibrational energy conservation equations). Flux-splitting procedures are developed for the fully coupled equations involving fluid dynamics, chemical production and thermodynamic relaxation processes. New forms of flux-vector split and flux-difference split algorithms are embodied in a fully coupled, implicit, large-block structure, including all the species conservation and energy production equations. Several numerical examples are presented, including high-temperature shock tube and nozzle flows. The methodology is compared to other existing techniques, including spectral and central-differenced procedures, and favorable comparisons are shown regarding accuracy, shock-capturing and convergence rates.

Grossman, B.↗

An adaptive algorithm for motion compensated color image coding

This paper presents an adaptive algorithm for motion compensated color image coding. The algorithm can be used for video teleconferencing or broadcast signals. Activity segmentation is used to reduce the bit rate and a variable stage search is conducted to save computations. The adaptive algorithm is compared with the nonadaptive algorithm and it is shown that with approximately 60 percent savings in computing the motion vector and 33 percent additional compression, the performance of the adaptive algorithm is similar to the nonadaptive algorithm. The adaptive algorithm results also show improvement of up to 1 bit/pel over interframe DPCM coding with nonuniform quantization. The test pictures used for this study were recorded directly from broadcast video in color.

Kwatra, Subhash C.↗

Note on unit tangent vector computation for homotopy curve tracking on a hypercube

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and subsequent tracking of some smooth curve in the zero set of the homotopy map. Tracking a homotopy curve involves finding the unit tangent vector at different points along the zero curve, which amounts to calculating the kernel of the n x (n + 1) Jacobian matrix. While computing the tangent vector is just one part of the curve tracking algorithm, it can require a significant percentage of the total tracking time. This note presents computational results showing the performance of several different parallel orthogonal factorization/triangular system solving algorithms for the tangent vector computation on a hypercube.

Chakraborty, A.↗

Forecasting Evaluation of WindSat in the Coastal Environment

WindSat has demonstrated that measurements from polarimetric space-based microwave radiometers can be used to retrieve global ocean surface vector winds. Since the date of launch in 2003, substantial incremental improvements have been made to WindSat data processing, calibration, and retrieval algorithms. The retrievals now have higher resolution, improved wind vector ambiguity removal, and enhanced capability to represent high winds. Utilization of WindSat retrievals (wind vectors, total precipitable water, rainrate and sea surface temperature) will be demonstrated in the context of operational weather forecasting applications, especially the monitoring of topographically-forced winds. Examples will be presented from various parts of the world, including inland seas, midlatitude oceans, the tropics, and the United States. We will illustrate retrievals in extreme high- and extreme low-wind regimes, both of which can be problematic. Rain contamination will be addressed. We will include a comparison of WindSat vector maps to corresponding maps from the QuikScat scatterometer. We will discuss how near-realtime data from WindSat is being transitioned to specific offices within the National Weather Service.

Lee, Thomas F.↗

Fast transformations between configuration state function and Slater determinant bases for direct configuration interaction

A hybrid configuration state function (CSF) and Slater determinant (SD) basis full configuration interaction (CI) program was developed to simultaneously take advantage of fast SD basis algorithms for σ = Hc formation and the smaller CI vector length and more robust convergence offered by a CSF basis. Graphical processing unit acceleration of the direct CSF-SD and SD-CSF basis transformation algorithms ensures that the combined transformation time per iteration relative to σ formation is small (~15%). In addition to the obvious benefits of reducing the memory footprint of the CI vector, additional computational savings are demonstrated that rely directly on the size of the CI basis, in one particular case reducing the CI time-to-solution of a HF-CAS-(16,16)-CI/6-31G calculation of ethylene from 1954.79 s to 956 s by using a CSF basis, a 2.0× speedup.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the computational solution of vector-density based continuum dislocation dynamics models: A comparison of two plastic distortion and stress update algorithms

Continuum dislocation dynamics models of mesoscale plasticity consist of dislocation transport-reaction equations coupled with crystal mechanics equations. The coupling between these two sets of equations is such that dislocation transport gives rise to the evolution of plastic distortion (strain), while the evolution of the latter fixes the stress from which the dislocation velocity field is found via a mobility law. Earlier solutions of these equations employed a staggered solution scheme for the two sets of equations in which the plastic distortion was updated via time integration of its rate, as found from Orowan's law. In this work, we show that such a direct time integration scheme can suffer from accumulation of numerical errors. We introduce an alternative scheme based on field dislocation mechanics that ensures consistency between the plastic distortion and the dislocation content in the crystal. The new scheme is based on calculating the compatible and incompatible parts of the plastic distortion separately, and the incompatible part is calculated from the current dislocation density field. Stress field and dislocation transport calculations were implemented within a finite element based discretization of the governing equations, with the crystal mechanics part solved by a conventional Galerkin method and the dislocation transport equations by the least squares method. A simple test was first performed to show the accuracy of the two schemes for updating the plastic distortion, which shows that the solution method based on field dislocation mechanics is more accurate. This method then was used to simulate an austenitic steel crystal under uniaxial loading and multiple slip conditions. By considering dislocation interactions caused by junctions, a hardening rate similar to discrete dislocation dynamics simulation results was obtained. Finally, the simulations show that dislocations exhibit some self-organized structures as the strain is increased.

36 MATERIALS SCIENCE↗

Vector Observation-Aided/Attitude-Rate Estimation Using Global Positioning System Signals

A sequential filtering algorithm is presented for attitude and attitude-rate estimation from Global Positioning System (GPS) differential carrier phase measurements. A third-order, minimal-parameter method for solving the attitude matrix kinematic equation is used to parameterize the filter's state, which renders the resulting estimator computationally efficient. Borrowing from tracking theory concepts, the angular acceleration is modeled as an exponentially autocorrelated stochastic process, thus avoiding the use of the uncertain spacecraft dynamic model. The new formulation facilitates the use of aiding vector observations in a unified filtering algorithm, which can enhance the method's robustness and accuracy. Numerical examples are used to demonstrate the performance of the method.

Oshman, Yaakov↗

A fast directional algorithm for high-frequency electromagnetic scattering

This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.

97 MATHEMATICS AND COMPUTING↗

Comparison of Fault Detection Algorithms for Real-time Diagnosis in Large-Scale System

In this paper, we present a review of different real-time capable algorithms to detect and isolate component failures in large-scale systems in the presence of inaccurate test results. A sequence of imperfect test results (as a row vector of I's and O's) are available to the algorithms. In this case, the problem is to recover the uncorrupted test result vector and match it to one of the rows in the test dictionary, which in turn will isolate the faults. In order to recover the uncorrupted test result vector, one needs the accuracy of each test. That is, its detection and false alarm probabilities are required. In this problem, their true values are not known and, therefore, have to be estimated online. Other major aspects in this problem are the large-scale nature and the real-time capability requirement. Test dictionaries of sizes up to 1000 x 1000 are to be handled. That is, results from 1000 tests measuring the state of 1000 components are available. However, at any time, only 10-20% of the test results are available. Then, the objective becomes the real-time fault diagnosis using incomplete and inaccurate test results with online estimation of test accuracies. It should also be noted that the test accuracies can vary with time --- one needs a mechanism to update them after processing each test result vector. Using Qualtech's TEAMS-RT (system simulation and real-time diagnosis tool), we test the performances of 1) TEAMSAT's built-in diagnosis algorithm, 2) Hamming distance based diagnosis, 3) Maximum Likelihood based diagnosis, and 4) HidderMarkov Model based diagnosis.

Kirubarajan, Thiagalingam↗

Analysis of error floor of LDPC codes under LP decoding over the BSC

We consider linear programming (LP) decoding of a fixed low-density parity-check (LDPC) code over the binary symmetric channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We propose an efficient algorithm termed the instanton search algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton and prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in the input. We obtain the number of unique instantons of different sizes by running the ISA sufficient number of times. We then use the instanton statistics to predict the performance of the LP decoding over the BSC in the error floor region. We also propose an efficient semi-analytical method to predict the performance of LP decoding over a large range of transition probabilities of the BSC.

97 MATHEMATICS AND COMPUTING↗