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 595 records · Page 33

Active regions

The following efforts were completed in support of the Solar Maximum Mission (SMM): (1) the evolution of solar vector photospheric magnetic fields in a flare-producing active region was studied; (2) an algorithm was developed to generate maps of force-free magnetic field strengths at varying heights in the solar atmosphere; and (3) the study of the physical state of the material confined along entire magnetic loops was advanced with the use of magnetic field extrapolation.

Wu, S. T.↗

Effect Of Noise In The Ideal State Reconstructor

More measurements yield better estimate. Report discusses effects of measurement noise on system including linear, time-invariant plant of measurable inputs and known parameters and deterministic digital control subsystem governed by algorithm called "ideal state reconstructor." So named because in absence of noise, it exactly reconstructs vector represting state of plant, even without knowledge of initial state. Ideal state reconstructor adds no new states or eigenvalues to system; affects measurement equation only.

Polites, Michael E.↗

Model reduction and control of flexible structures using Krylov subspaces

Krylov vectors and the concept of parameter-matching are combined to develop a model reduction algorithm for a damped structural dynamics system. The reduced-order model obtained matches a certain number of low-frequency moments of the full-order system. The major application of the present method is to the control of flexible structures. It is shown that, in the control of flexible structures, there generally exist three types of control energy spillover, namely, the control spillover, the observation spillover, and dynamic spillover. The formulation based on Krylov subspaces can eliminate the control and the observation spillover, while leaving only the dynamic spillover to be considered. Two examples are used to illustrate the efficacy of the Krylov method.

Craig, Roy R., Jr.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗

Krylov vector methods for model reduction and control of flexible structures

Krylov vectors and the concept of parameter matching are combined here to develop model-reduction algorithms for structural dynamics systems. The method is derived for a structural dynamics system described by a second-order matrix differential equation. The reduced models are shown to have a promising application in the control of flexible structures. It can eliminate control and observation spillovers while requiring only the dynamic spillover terms to be considered. A model-order reduction example and a flexible structure control example are provided to show the efficacy of the method.

Su, Tzu-Jeng↗

Massively Parallel Assimilation of TOGA/TAO and Topex/Poseidon Measurements into a Quasi Isopycnal Ocean General Circulation Model Using an Ensemble Kalman Filter

A massively parallel ensemble Kalman filter (EnKF)is used to assimilate temperature data from the TOGA/TAO array and altimetry from TOPEX/POSEIDON into a Pacific basin version of the NASA Seasonal to Interannual Prediction Project (NSIPP)ls quasi-isopycnal ocean general circulation model. The EnKF is an approximate Kalman filter in which the error-covariance propagation step is modeled by the integration of multiple instances of a numerical model. An estimate of the true error covariances is then inferred from the distribution of the ensemble of model state vectors. This inplementation of the filter takes advantage of the inherent parallelism in the EnKF algorithm by running all the model instances concurrently. The Kalman filter update step also occurs in parallel by having each processor process the observations that occur in the region of physical space for which it is responsible. The massively parallel data assimilation system is validated by withholding some of the data and then quantifying the extent to which the withheld information can be inferred from the assimilation of the remaining data. The distributions of the forecast and analysis error covariances predicted by the ENKF are also examined.

Keppenne, Christian L.↗

Background Error Covariance Estimation Using Information from a Single Model Trajectory with Application to Ocean Data Assimilation

An attractive property of ensemble data assimilation methods is that they provide flow dependent background error covariance estimates which can be used to update fields of observed variables as well as fields of unobserved model variables. Two methods to estimate background error covariances are introduced which share the above property with ensemble data assimilation methods but do not involve the integration of multiple model trajectories. Instead, all the necessary covariance information is obtained from a single model integration. The Space Adaptive Forecast error Estimation (SAFE) algorithm estimates error covariances from the spatial distribution of model variables within a single state vector. The Flow Adaptive error Statistics from a Time series (FAST) method constructs an ensemble sampled from a moving window along a model trajectory.SAFE and FAST are applied to the assimilation of Argo temperature profiles into version 4.1 of the Modular Ocean Model (MOM4.1) coupled to the GEOS-5 atmospheric model and to the CICE sea ice model. The results are validated against unassimilated Argo salinity data. They show that SAFE and FAST are competitive with the ensemble optimal interpolation (EnOI) used by the Global Modeling and Assimilation Office (GMAO) to produce its ocean analysis. Because of their reduced cost, SAFE and FAST hold promise for high-resolution data assimilation applications.

Error Covariance↗

Background Error Covariance Estimation using Information from a Single Model Trajectory with Application to Ocean Data Assimilation into the GEOS-5 Coupled Model

An attractive property of ensemble data assimilation methods is that they provide flow dependent background error covariance estimates which can be used to update fields of observed variables as well as fields of unobserved model variables. Two methods to estimate background error covariances are introduced which share the above property with ensemble data assimilation methods but do not involve the integration of multiple model trajectories. Instead, all the necessary covariance information is obtained from a single model integration. The Space Adaptive Forecast error Estimation (SAFE) algorithm estimates error covariances from the spatial distribution of model variables within a single state vector. The Flow Adaptive error Statistics from a Time series (FAST) method constructs an ensemble sampled from a moving window along a model trajectory. SAFE and FAST are applied to the assimilation of Argo temperature profiles into version 4.1 of the Modular Ocean Model (MOM4.1) coupled to the GEOS-5 atmospheric model and to the CICE sea ice model. The results are validated against unassimilated Argo salinity data. They show that SAFE and FAST are competitive with the ensemble optimal interpolation (EnOI) used by the Global Modeling and Assimilation Office (GMAO) to produce its ocean analysis. Because of their reduced cost, SAFE and FAST hold promise for high-resolution data assimilation applications.

Data Assimilation↗

Implementation and analysis of a Navier-Stokes algorithm on parallel computers

The results of the implementation of a Navier-Stokes algorithm on three parallel/vector computers are presented. The object of this research is to determine how well, or poorly, a single numerical algorithm would map onto three different architectures. The algorithm is a compact difference scheme for the solution of the incompressible, two-dimensional, time-dependent Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They are the following: the MPP, an SIMD machine with 16K bit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. The basic comparison is among SIMD instruction parallelism on the MPP, MIMD process parallelism on the Flex/32, and vectorization of a serial code on the Cray/2. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.

Fatoohi, Raad A.↗

Parallel processors and nonlinear structural dynamics algorithms and software

A nonlinear structural dynamics program with an element library that exploits parallel processing is under development. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program. As a byproduct an automatic scheme for assigning time steps was devised. A rudimentary form of the program is complete and has been tested; it shows substantial advantage can be taken of parallelism. In addition, a stability proof for the subcycling algorithm has been developed.

Belytschko, T.↗

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iterative. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗

Updating of ADAPT predictions of sunspot activity

An eigenvector analysis procedure was used to analyze and develop algorithms for predicting sunspot numbers. The predictors in these algorithms consist of sunspot numbers from the preceding two solar cycles and magnetic index data from the preceding cycle. Predictions are presented for cycles 21 and 22. The sunspot activity for cycle 21 is predicted to remain below 100 until early 1980 when it will rapidly reach a peak of approximately 120. The two sigma accuracy on these estimates is approximately 20 sunspot numbers in the region of the peak and 10 sunspot numbers early and late in the cycle. Algorithms were also developed for predicting the period of future sunspot cycles using the same predictor vector.

Hunter, H. C.↗

Survey of new vector computers: The CRAY 1S from CRAY research; the CYBER 205 from CDC and the parallel computer from ICL - architecture and programming

Problems which can arise with vector and parallel computers are discussed in a user oriented context. Emphasis is placed on the algorithms used and the programming techniques adopted. Three recently developed supercomputers are examined and typical application examples are given in CRAY FORTRAN, CYBER 205 FORTRAN and DAP (distributed array processor) FORTRAN. The systems performance is compared. The addition of parts of two N x N arrays is considered. The influence of the architecture on the algorithms and programming language is demonstrated. Numerical analysis of magnetohydrodynamic differential equations by an explicit difference method is illustrated, showing very good results for all three systems. The prognosis for supercomputer development is assessed.

Gentzsch, W.↗

Recent Developments in Nonlinear Normal Mode Initialization

The importance of a balanced initial condition upon GLAS GCM forecasts and assimilation cycles was assessed. An effort to combine previous work on normal mode initialization at GLA is underway to develop an initialization process for the production version of the GLAS 4th order GCM. The major aspects of this work fall into two parts: vectorization of the linear projector code and the insertion of the mode projector and Machenhauer iteration algorithm into the full GLAS GCM. Memory and paging constraints place restrictions on the number of horizontal modes stored for initialization purposes, and on the manner in which they are stored. Only the first five vertical structures of the gravity modes are used. Differing phase and normalization conventions provided many elusive coding errors. A Machenhauer nonlinear normal mode initialization technique is used. This method entails the insertion of a modified version of the mode projector into the full GCM, and the modification of the GCM to allow for iterative calls to the projector.

Bloom, S. C.↗

A fully-coupled implicit method for thermo-chemical nonequilibrium air at sub-orbital flight speeds

A CFD technique is described in which the finite-rate chemistry in thermal and chemical nonequilibrium air is fully and implicitly coupled with the fluid motion. Developed for use in the suborbital hypersonic flight speed range, the method accounts for nonequilibrium vibrational and electronic excitation and dissociation, but not ionization. The steady-state solution to the resulting system of equations is obtained by using a lower-upper factorization and symmetric Gauss-Seidel sweeping technique through Newton iteration. Inversion of the left-hand-side matrices is replaced by scalar multiplications through the use of the diagonal dominance algorithm. The code, named CENS2H (Compressible-Euler-Navier-Stokes Two-Dimensional Hypersonic), is fully vectorized and requires about 8.8 x 10 to the -5th sec per node point per iteration using a Cray X-MP computer. Converged solutions are obtained after about 2400 iterations. Sample calculations are made for a circular cylinder and a 10 percent airfoil at 5 deg angle of attack. The calculated cylinder flow field agrees with that obtained experimentally. The code predicts a 10 percent change in lift, drag, and pitching moment for the airfoil due to the thermochemical phenomena.

Park, Chul↗