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 181 records · Page 10

Reducing the Volume of NASA Earth-Science Data

A computer program reduces data generated by NASA Earth-science missions into representative clusters characterized by centroids and membership information, thereby reducing the large volume of data to a level more amenable to analysis. The program effects an autonomous data-reduction/clustering process to produce a representative distribution and joint relationships of the data, without assuming a specific type of distribution and relationship and without resorting to domain-specific knowledge about the data. The program implements a combination of a data-reduction algorithm known as the entropy-constrained vector quantization (ECVQ) and an optimization algorithm known as the differential evolution (DE). The combination of algorithms generates the Pareto front of clustering solutions that presents the compromise between the quality of the reduced data and the degree of reduction. Similar prior data-reduction computer programs utilize only a clustering algorithm, the parameters of which are tuned manually by users. In the present program, autonomous optimization of the parameters by means of the DE supplants the manual tuning of the parameters. Thus, the program determines the best set of clustering solutions without human intervention.

Lee, Seungwon↗

A multistage time-stepping scheme for the thin-layer Navier-Stokes equations

A finite-volume scheme for numerical integration of the Euler equations was extended to allow solution of the thin-layer Navier-Stokes equations in two and three dimensions. The extended algorithm, which is based on a class of four-stage Runge-Kutta time-stepping schemes, was made numerically efficient through the following convergence acceleration technique: (1) local time stepping, (2) enthalpy damping, and (3) residual smoothing. Also, the high degree of vectorization possible with the algorithm has yielded an efficient program for vector processors. The scheme was evaluated by solving laminar and turbulent flows. Numerical results have compared well with either theoretical or other numerical solutions and/or experimental data.

Swanson, R. C., Jr.↗

Preliminary study of the use of the STAR-100 computer for transonic flow calculations

A description is presented for a new explicit algorithm for solving the transonic small-disturbance potential equation on the STAR-100 computer. The STAR computer has a 'pipeline' type of processor which is very efficient in doing arithmetic operations on long vectors. Unfortunately, the successive line over-relaxation method, which represents the best method for solving the considered equation, is not suitable for vector-arithmetic procedures. The described algorithm, however, can be vectorized to make an employment of the STAR-100 possible. It is found that a use of the new algorithm for solving the equation on the STAR-100 computer can almost halve the computer time required for this type of computation when compared to successive line over-relaxation on the CYBER 175 computer.

Keller, J. D.↗

Determination of the coronal magnetic field from vector magnetograph data

A new algorithm was developed, tested, and applied to determine coronal magnetic fields above solar active regions. The coronal field above NOAA active region AR5747 was successfully estimated on 20 Oct. 1989 from data taken at the Mees Solar Observatory of the Univ. of Hawaii. It was shown that observational data can be used to obtain realistic estimates of coronal magnetic fields. The model has significantly extended the realism with which the coronal magnetic field can be inferred from observations. The understanding of coronal phenomena will be greatly advanced by a reliable technique, such as the one presented, for deducing the detailed spatial structure of the coronal field. The payoff from major current and proposed NASA observational efforts is heavily dependent on the success with which the coronal field can be inferred from vector magnetograms. In particular, the present inability to reliably obtain the coronal field has been a major obstacle to the theoretical advancement of solar flare theory and prediction. The results have shown that the evolutional algorithm can be used to estimate coronal magnetic fields.

Mikic, Zoran↗

Explicit-implicit staggered procedure for multibody dynamics analysis

An explicit-implicit staggered time-integration procedure is presented for the solution of multibody dynamical equations involving large rotations and constraints. The algorithms adopts a two-stage modification of the central difference algorithm for integrating the translational coordinates and the angular velocity vector, and the midpoint implicit algorithm to solve the kinematical relation in terms of the Euler parameters for updating the angular orientations. The Lagrange multipliers to enforce the system constraints are obtained by implicitly integrating a parabolically regularized differential equation for the multipliers. The performance of the present procedure has been evaluated to applying the procedure to solve several sample problems. The results indicate that the procedure is robust in dealing with a variety of constraints and spatial kinematic motions, hence it is recommended for applications to general multibody dynamics analyses.

Park, K. C.↗

Boundary element analysis on vector and parallel computers

Boundary element analysis (BEA) can be characterized as a numerical technique that generally shifts the computational burden in the analysis toward numerical integration and the solution of nonsymmetric and either dense or blocked sparse systems of algebraic equations. Researchers have explored the concept that the fundamental characteristics of BEA can be exploited to generate effective implementations on vector and parallel computers. In this paper, the results of some of these investigations are discussed. The performance of overall algorithms for BEA on vector supercomputers, massively data parallel single instruction multiple data (SIMD), and relatively fine grained distributed memory multiple instruction multiple data (MIMD) computer systems is described. Some general trends and conclusions are discussed, along with indications of future developments that may prove fruitful in this regard.

Kane, J. H.↗

Algorithms versus architectures for computational chemistry

The algorithms employed are computationally intensive and, as a result, increased performance (both algorithmic and architectural) is required to improve accuracy and to treat larger molecular systems. Several benchmark quantum chemistry codes are examined on a variety of architectures. While these codes are only a small portion of a typical quantum chemistry library, they illustrate many of the computationally intensive kernels and data manipulation requirements of some applications. Furthermore, understanding the performance of the existing algorithm on present and proposed supercomputers serves as a guide for future programs and algorithm development. The algorithms investigated are: (1) a sparse symmetric matrix vector product; (2) a four index integral transformation; and (3) the calculation of diatomic two electron Slater integrals. The vectorization strategies are examined for these algorithms for both the Cyber 205 and Cray XMP. In addition, multiprocessor implementations of the algorithms are looked at on the Cray XMP and on the MIT static data flow machine proposed by DENNIS.

Partridge, H.↗

VECTAN II - A computer program for the spatial analysis of the vectorcardiogram

This paper presents the operation of a digital computer program, VECTAN II, for the spatial analysis of the vectorcardiogram (VCG). The program incorporates a unique waveform recognition algorithm based on the spatial vector length which has been shown to perform better than previous algorithms. The waveform analysis employed by the program considers the vectorcardiogram as a three dimensional entity rather than as scalar or planar representations. VECTAN II is designed chiefly to measure and quantify the VCG response of normal subjects to a controlled stress by analyzing one VCG complex every five seconds throughout a long experiment. The program has been used to analyze data from the NASA Johnson Space Center Cardiovascular Laboratory, from the pre- and postflight medical examinations of the Apollo 15, 16 and 17 crewmen, and from onboard Skylab experiments.

Golden, D. P., Jr.↗

A study of real-time computer graphic display technology for aeronautical applications

The development, simulation, and testing of an algorithm for anti-aliasing vector drawings is discussed. The pseudo anti-aliasing line drawing algorithm is an extension to Bresenham's algorithm for computer control of a digital plotter. The algorithm produces a series of overlapping line segments where the display intensity shifts from one segment to the other in this overlap (transition region). In this algorithm the length of the overlap and the intensity shift are essentially constants because the transition region is an aid to the eye in integrating the segments into a single smooth line.

Rajala, S. A.↗

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗

Study of a homotopy continuation method for early orbit determination with the Tracking and Data Relay Satellite System (TDRSS)

A recent mathematical technique for solving systems of equations is applied in a very general way to the orbit determination problem. The study of this technique, the homotopy continuation method, was motivated by the possible need to perform early orbit determination with the Tracking and Data Relay Satellite System (TDRSS), using range and Doppler tracking alone. Basically, a set of six tracking observations is continuously transformed from a set with known solution to the given set of observations with unknown solutions, and the corresponding orbit state vector is followed from the a priori estimate to the solutions. A numerical algorithm for following the state vector is developed and described in detail. Numerical examples using both real and simulated TDRSS tracking are given. A prototype early orbit determination algorithm for possible use in TDRSS orbit operations was extensively tested, and the results are described. Preliminary studies of two extensions of the method are discussed: generalization to a least-squares formulation and generalization to an exhaustive global method.

Smith, R. L.↗

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Barnard, Stephen T.↗

An initial feasibility stage for Stoer's constrained least squares algorithm

A procedure is described for computing an initial feasible vector, x sub 0, for Stoer's algorithm for solving the linear least squares problem subject to linear equality and inequality constraints. The procedure described fits well with Stoer's algorithm since much of the computation performed to determine x sub 0 accomplishes initializing transformations of the problem data, which would otherwise be done in Stoer's algorithm after being given an x sub 0.

Lawson, C. L.↗

A vectorized solution for incompressible flow

An algorithm is developed to obtain solutions to the unsteady Reynolds-averaged incompressible Navier-Stokes equations in general curvilinear coordinates on a vector processor. The governing equations are in nonconservative form with the velocity and pressure as dependent variables. Two momentum equations and the Poisson equation for pressure form a set of three governing equations for three flow field unknowns: u, v, and p. The governing equations and boundary conditions are expressed in terms of boundary-conforming curvilinear coordinates, and a checkerboard SOR iteration is used to solve the governing equations. Several possible sequences for a checkerboard SOR iteration are investigated for finding the best overall convergence rate. The efficiency and capability of the present algorithm was assessed using the example of an 18 percent thick NACA 66(3)018 airfoil at zero degree angle of attack for chord Reynolds number range 1000-40,000.

Patel, N. R.↗

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗

Real-time dynamics simulation of the Cassini spacecraft using DARTS. Part 1: Functional capabilities and the spatial algebra algorithm

This paper describes the Dynamics Algorithms for Real-Time Simulation (DARTS) real-time hardware-in-the-loop dynamics simulator for the National Aeronautics and Space Administration's Cassini spacecraft. The spacecraft model consists of a central flexible body with a number of articulated rigid-body appendages. The demanding performance requirements from the spacecraft control system require the use of a high fidelity simulator for control system design and testing. The DARTS algorithm provides a new algorithmic and hardware approach to the solution of this hardware-in-the-loop simulation problem. It is based upon the efficient spatial algebra dynamics for flexible multibody systems. A parallel and vectorized version of this algorithm is implemented on a low-cost, multiprocessor computer to meet the simulation timing requirements.

Jain, A.↗

An implementation of the QMR method based on coupled two-term recurrences

The authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on three-term recursions are usually less robust than mathematically equivalent coupled two-term vector recurrences. This paper presents a look-ahead algorithm that constructs the Lanczos basis vectors by means of coupled two-term recursions. Implementation details are given, and the look-ahead strategy is described. A new implementation of the QMR method, based on this coupled two-term algorithm, is described. A simplified version of the QMR algorithm without look-ahead is also presented, and the special case of QMR for complex symmetric linear systems is considered. Results of numerical experiments comparing the original and the new implementations of the QMR method are reported.

Freund, Roland W.↗

Geometric Representations of Condition Queries on Three-Dimensional Vector Fields

Condition queries on distributed data ask where particular conditions are satisfied. It is possible to represent condition queries as geometric objects by plotting field data in various spaces derived from the data, and by selecting loci within these derived spaces which signify the desired conditions. Rather simple geometric partitions of derived spaces can represent complex condition queries because much complexity can be encapsulated in the derived space mapping itself A geometric view of condition queries provides a useful conceptual unification, allowing one to intuitively understand many existing vector field feature detection algorithms -- and to design new ones -- as variations on a common theme. A geometric representation of condition queries also provides a simple and coherent basis for computer implementation, reducing a wide variety of existing and potential vector field feature detection techniques to a few simple geometric operations.

Henze, Chris↗