One obstacle to running very large two- and three-dimensional codes on the Cray X-MP and Y-MP systems is to efficiently perform array transpositions using SSD storage. This article discusses how such transpositions can be performed by means of algorithms that feature exclusively unit stride, long vector transfers between main memory and SSD, and which only require a single pass through the data (provided sufficient main memory buffers are available).

Topics: NASA Technical Reports Server (NTRS), CRAY COMPUTERS, MEMORY (COMPUTERS), COMPUTER PROGRAMS,...

446
446

May 23, 2011
05/11

by
Faur, Mirce

texts

######
eye 446

######
favorite 0

######
comment 0

The main results of the theoretical and experimental research on electrodeposition of CuIn(x)Ga(l-x)Se2 thin layers for CdS/CIGS solar cell applications are outlined.

Topics: FORTRAN, FAST FOURIER TRANSFORMATIONS, CRAY COMPUTERS, CHECKOUT, COMPUTER PROGRAMS, ALGORITHMS,...

The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, ARCHITECTURE (COMPUTERS), FACTORIZATION, MATRICES...

246
246

May 23, 2011
05/11

by
Reuther, James; Alonso, Juan Jose; Rimlinger, Mark J.; Jameson, Anton

texts

######
eye 246

######
favorite 0

######
comment 0

This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous...

Topics: ALGORITHMS, CRAY COMPUTERS, SPACE EXPLORATION, NAVIER-STOKES EQUATION, MACH NUMBER, THREE...

118
118

May 28, 2011
05/11

by
Gorkavyi, Nick; Ozernoy, Leonid; Mather, John; Taidakova, Tany

texts

######
eye 118

######
favorite 0

######
comment 0

We develop a physical model of the zodiacal cloud incorporating the real dust sources of asteroidal, cometary, and kuiperoidal origin. Using the inferred distribution of the zodiacal dust, we compute its thermal emission and scattering at several wavelengths (1.25, 5, and 20 micron) as a function of NGST location assumed to be at 1 AU or 3 AU. Areas on the sky with a minimum of zodiacal light are determined.

Topics: AERODYNAMICS, CRAY COMPUTERS, COMPUTATIONAL FLUID DYNAMICS, HIGH RESOLUTION, ALGORITHMS, PARALLEL...

A few years ago, the class of Essentially Non-Oscillatory Schemes for the numerical simulation of hyperbolic equations and systems was constructed. Since then, some extensions have been made to multidimensional simulations of compressible flows, mainly in the context of very regular structured meshes. In this paper, we first recall and improve the results of an earlier paper about non-oscillatory reconstruction on unstructured meshes, emphasizing the effective calculation of the reconstruction....

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, ESSENTIALLY NON-OSCILLATORY SCHEMES, GRID...

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this...

Topics: NASA Technical Reports Server (NTRS), CONJUGATE GRADIENT METHOD, MEMORY (COMPUTERS), DISTRIBUTED...

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is highly efficient on parallel machines. It consists...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, FINITE DIFFERENCE THEORY, MATRICES (MATHEMATICS),...

We combine a high-order compact finite difference scheme to approximate spatial derivatives arid collocation techniques for the time component to numerically solve the two dimensional heat equation. We use two approaches to implement the collocation methods. The first one is based on an explicit computation of the coefficients of polynomials and the second one relies on differential quadrature. We compare them by studying their merits and analyzing their numerical performance. All our...

Topics: NASA Technical Reports Server (NTRS), FINITE DIFFERENCE THEORY, DIFFERENCE EQUATIONS, ITERATIVE...

The focus of this research is to implement a Lanczos algorithm for the Control-Structure Integration (CSI) code which can exploit both parallel and vector capabilities provided by modern, high performance computers. A partial restoring orthogonality scheme is also developed and incorporated into the basic Lanczos algorithm. The numerical performance of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of the Phase Zero CSI model. The...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, COMPUTER PROGRAMS, CONTROL SYSTEMS DESIGN,...

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is efficient on parallel machines. It consists of a...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, PARALLEL COMPUTERS, DECOMPOSITION, SIMD...

161
161

May 24, 2011
05/11

by
Malphrus, Benjamin K.; Simpson, Caroline E.; Gottesman, S. T.; Hawarden, Timothy G

texts

######
eye 161

######
favorite 0

######
comment 0

The possible formation and evolution of dwarf irregular galaxies from material derived from perturbed evolved galaxies is addressed via an H I study of a likely example, the peculiar system NGC 5291. This system, located in the western outskirts of the cluster Abell 3574, contains the lenticular galaxy NGC 5291 which is in close proximity to a disturbed companion and is flanked by an extensive complex of numerous knots extending roughly 4 min north and 4 min south of the galaxy. In an initial...

Topics: FLEXIBLE BODIES, SYNTHESIS, FEEDBACK CONTROL, TRANSFORMATIONS (MATHEMATICS), CONTROLLERS,...

The theory and practice of implementing Tanemura's algorithm for 3D Delaunay triangulation on Intel's Gamma prototype, a 128 processor MIMD computer, is described. Efficient implementation of Tanemura's algorithm on a conventional, vector processing supercomputer is problematic. It does not vectorize to any significant degree and requires indirect addressing. Efficient implementation on a parallel architecture is possible, however. Speeds in excess of 20 times a single processor Cray Y-MP are...

Topics: NASA Technical Reports Server (NTRS), GRID GENERATION (MATHEMATICS), MIMD (COMPUTERS), PARALLEL...

With the present availability of parallel processors of vastly different architectures, there is a need for a common language interface to multiple types of machines. The parallel C compiler, currently under development, is intended to be such a language. This language is based on the belief that an algorithm designed around fine-grained parallelism can be mapped relatively easily to different parallel architectures, since a large percentage of the parallelism has been identified. The compiler...

Topics: NASA Technical Reports Server (NTRS), COMPILERS, INTERFACES, MASSIVELY PARALLEL PROCESSORS,...

The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast...

Topics: NASA Technical Reports Server (NTRS), COMPUTER SYSTEMS PERFORMANCE, FAST FOURIER TRANSFORMATIONS,...

Program EAGLE (Eglin Arbitrary Geometry Implicit Euler) is a multiblock grid generation and steady-state flow solver system. This system combines a boundary conforming surface generation, a composite block structure grid generation scheme, and a multiblock implicit Euler flow solver algorithm. The three codes are intended to be used sequentially from the definition of the configuration under study to the flow solution about the configuration. EAGLE was specifically designed to aid in the...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, COMPILERS, COMPOSITE STRUCTURES, COMPUTATIONAL...

The issues involved in modifying an existing code for multitasking is explored. They include Cray extensions to FORTRAN, an examination of the application code under study, designing workable modifications, specific code modifications to the VAX and Cray versions, performance, and efficiency results. The finished product is a faster, fully synchronous, parallel version of the original program. A production program is partitioned by hand to run on two CPUs. Loop splitting multitasks three key...

Topics: NASA Technical Reports Server (NTRS), APPLICATIONS PROGRAMS (COMPUTERS), COMPUTER PROGRAMS,...

This paper reports the performance of a parallel volume rendering algorithm for visualizing a large-scale, unstructured-grid dataset produced by a three-dimensional aerodynamics simulation. This dataset, containing over 18 million tetrahedra, allows us to extend our performance results to a problem which is more than 30 times larger than the one we examined previously. This high resolution dataset also allows us to see fine, three-dimensional features in the flow field. All our tests were...

Topics: NASA Technical Reports Server (NTRS), AERODYNAMICS, ALGORITHMS, PARALLEL PROCESSING (COMPUTERS),...

The recovery of a high resolution geopotential from satellite gradiometer observations motivates the examination of high performance computational techniques. The primary subject matter addresses specifically the use of satellite gradiometer and GPS observations to form and invert the normal matrix associated with a large degree and order geopotential solution. Memory resident and out-of-core parallel linear algebra techniques along with data parallel batch algorithms form the foundation of the...

Topics: NASA Technical Reports Server (NTRS), GEOPOTENTIAL, HIGH RESOLUTION, SATELLITE OBSERVATION,...

This paper considers an algorithm for synthesis of optimal controllers for full information feedback. The synthesis procedure reduces to a single linear matrix inequality which may be solved via established convex optimization algorithms. The computational cost of the optimization is investigated. It is demonstrated the problem dimension and corresponding matrices can become large for practical engineering problems. This algorithm represents a process that is impractical for standard...

Topics: NASA Technical Reports Server (NTRS), FLEXIBLE BODIES, CONTROLLERS, ALGORITHMS, CONTROL SYSTEMS...

In this paper, efficient dynamic simulation algorithms for a system of m manipulators, cooperating to manipulate a large load, are developed; their performance, using two possible forms of parallelism on a general-purpose parallel computer, is investigated. One form, temporal parallelism, is obtained with the use of parallel numerical integration methods. A speedup of 3.78 on four processors of CRAY Y-MP8 was achieved with a parallel four-point block predictor-corrector method for the...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, BODY KINEMATICS, COMPUTERIZED SIMULATION, DYNAMIC...

The thin-layer Navier-Stokes equations are coupled with a zonal scheme (or domain-decomposition method) to develop the Transonic Navier-Stokes (TNS) wing-alone code. The TNS has a total of 4 zones and is extended to a total of 16 zones for the wing-fuselage version of the code. Results are compared on the Cray X-MP-48 and compared with experimental data.

Topics: NASA Technical Reports Server (NTRS), BODY-WING CONFIGURATIONS, COMPUTATIONAL FLUID DYNAMICS,...

240
240

May 23, 2011
05/11

by
Hsu, K.-J.; DeMore, W. B

texts

######
eye 240

######
favorite 0

######
comment 0

Rate constants and temperature dependencies for the reactions of OH with CF3OCH3 (HFOC-143a), CF2HOCF2H (HFOC-134), and CF3OCF2H (HFOC-125) were studied using a relative rate technique in the temperature range 298-393 K. The following absolute rate constants were derived: HFOC-143a, 1.9E-12 exp(-1555/T); HFOC-134, 1.9E-12 exp(-2006/T); HFOC-125, 4.7E-13 exp(-2095/T). Units are cm(exp 3)molecule(exp -1) s(exp -1). Substituent effects on OH abstraction rate constants are discussed, and it is...

Topics: MULTIPROCESSING (COMPUTERS), PARTIAL DIFFERENTIAL EQUATIONS, NONLINEAR EQUATIONS, TAYLOR SERIES,...

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...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, ARCHITECTURE (COMPUTERS), NAVIER-STOKES EQUATION,...

The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI...

Topics: NASA Technical Reports Server (NTRS), COMPUTATIONAL FLUID DYNAMICS, NAVIER-STOKES EQUATION,...

Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, DESCENT TRAJECTORIES, HYPERSONIC FLOW,...

Demands in computational power, particularly in the area of computational fluid dynamics (CFD), led NASA Ames Research Center to study advanced computer architectures. One architecture being studied is the static data flow architecture based on research done by Jack B. Dennis at MIT. To improve understanding of this architecture, a static data flow simulator, written in Pascal, has been implemented for use on a Cray X-MP/48. A matrix multiply and a two-dimensional fast Fourier transform (FFT),...

Topics: NASA Technical Reports Server (NTRS), ADDRESSING, ARCHITECTURE (COMPUTERS), ARRAYS, DATA FLOW...

A parallel algorithm for the solution of the generalized eigenproblem in linear elastic finite element analysis, (K)(phi)=(M)(phi)(omega), where (K) and (M) are of order N, and (omega) is of order q is presented. The parallel algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm has been successfully implemented on a tightly coupled multiple-instruction-multiple-data (MIMD) parallel...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, ARCHITECTURE (COMPUTERS), FINITE ELEMENT METHOD,...

A fast diagonalized Beam-Warming algorithm is coupled with a zonal approach to solve the three-dimensional Euler/Navier-Stokes equations. The computer code, called Transonic Navier-Stokes (TNS), uses a total of four zones for wing configurations (or can be extended to complete aircraft configurations by adding zones). In the inner blocks near the wing surface, the thin-layer Navier-Stokes equations are solved, while in the outer two blocks the Euler equations are solved. The diagonal algorithm...

Topics: NASA Technical Reports Server (NTRS), AERODYNAMIC CONFIGURATIONS, ALGORITHMS, COMPUTERIZED...

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, BOEING 747 AIRCRAFT, COMPUTATIONAL FLUID...

A finite difference code was implemented for the compressible Navier-Stokes equations on the Connection Machine, a massively parallel computer. The code is based on the ARC2D/ARC3D program and uses the implicit factored algorithm of Beam and Warming. The codes uses odd-even elimination to solve linear systems. Timings and computation rates are given for the code, and a comparison is made with a Cray XMP.

Topics: NASA Technical Reports Server (NTRS), COMPUTATIONAL FLUID DYNAMICS, COMPUTER PROGRAMS, FINITE...

Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be...

Topics: NASA Technical Reports Server (NTRS), DISTRIBUTED MEMORY, PARALLEL COMPUTERS, PARALLEL PROCESSING...

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...

Topics: NASA Technical Reports Server (NTRS), ARCHITECTURE (COMPUTERS), CDC COMPUTERS, COMPUTATION,...

The experiment was designed to assist the Numerical Aerodynamic Simulation (NAS) Project Office in the testing and evaluation of long haul communications for remote users. The objectives of this work were to: (1) use foreign workstations to remotely access the NAS system; (2) provide NAS with a link to a large university-based computing facility which can serve as a model for a regional node of the Long-Haul Communications Subsystem (LHCS); and (3) provide a tail circuit to the University of...

Topics: NASA Technical Reports Server (NTRS), COMPUTATIONAL FLUID DYNAMICS, COMPUTER GRAPHICS, COMPUTER...

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method...

Topics: NASA Technical Reports Server (NTRS), CRAY COMPUTERS, EIGENVALUES, EIGENVECTORS, MULTIPLICATION,...

Parallel algorithms for the solution of linear parabolic problems are proposed. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Pade and Chebyshev approximations to the matrix exponential. The parallelization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers...

Topics: NASA Technical Reports Server (NTRS), APPROXIMATION, CHEBYSHEV APPROXIMATION, COMPUTATION, LINEAR...

We consider the performance of the finite element method on a vector supercomputer. The computationally intensive parts of the finite element method are typically the individual element forms and the solution of the global stiffness matrix both of which are vectorized in high performance codes. To further increase throughput, new algorithms are needed. We compare a multifrontal sparse solver to a traditional skyline solver in a finite element code on a vector supercomputer. The multifrontal...

Topics: NASA Technical Reports Server (NTRS), COMPUTER PROGRAMS, CRAY COMPUTERS, FINITE ELEMENT METHOD,...

The massively parallel processor is compared to the CRAY X-MP and the CYBER-205 for LANDSAT data processing. The maximum likelihood classification algorithm is the basis for comparison since this algorithm is simple to implement and vectorizes very well. The algorithm was implemented on all three machines and tested by classifying the same full scene of LANDSAT multispectral scan data. Timings are compared as well as features of the machines and available software.

Topics: NASA Technical Reports Server (NTRS), CDC CYBER 205 COMPUTER, COMPUTER SYSTEMS PERFORMANCE, CRAY...

We studied several algorithms for computing the Chebyshev spectral derivative and compare their roundoff error. For a large number of collocation points, the elements of the Chebyshev differentiation matrix, if constructed in the usual way, are not computed accurately. A subtle cause is is found to account for the poor accuracy when computing the derivative by the matrix-vector multiplication method. Methods for accurately computing the elements of the matrix are presented, and we find that if...

Topics: NASA Technical Reports Server (NTRS), ACCURACY, ALGORITHMS, CHEBYSHEV APPROXIMATION, COLLOCATION,...

The implementation of an ADI method for solving the diffusion equation on three parallel/vector computers is discussed. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, an SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The Gaussian elimination algorithm is used to solve a set of tridiagonal systems on the FLEX/32 and CRAY/2 while the cyclic elimination...

Topics: NASA Technical Reports Server (NTRS), ALTERNATING DIRECTION IMPLICIT METHODS, ARCHITECTURE...

The success of parallel computing in solving real-life computationally-intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important applications are both unstructured and dynamic in nature, making their efficient parallel implementation a daunting task. This paper presents the parallelization of a dynamic unstructured mesh adaptation algorithm using three popular programming paradigms on three leading supercomputers. We examine...

Topics: NASA Technical Reports Server (NTRS), PARALLEL PROCESSING (COMPUTERS), MULTIPROCESSING (COMPUTERS),...

During this research period, we have effectively transferred existing computer codes from CRAY supercomputer to work station based systems. The work station based version of our code preserved the accuracy of the numerical computations while giving a much better turn-around time than the CRAY supercomputer. Such a task relieved us of the heavy dependence of the supercomputer account budget and made codes developed in this research project more feasible for applications. The analysis of...

Topics: NASA Technical Reports Server (NTRS), ANTENNA RADIATION PATTERNS, COATINGS, COMPUTER PROGRAMS,...

The development of aerospace vehicles, over the years, was an evolutionary process in which engineering progress in the aerospace community was based, generally, on prior experience and data bases obtained through wind tunnel and flight testing. Advances in the fundamental understanding of flow physics, wind tunnel and flight test capability, and mathematical insights into the governing flow equations were translated into improved air vehicle design. The modern day field of Computational Fluid...

Topics: NASA Technical Reports Server (NTRS), AERODYNAMIC CONFIGURATIONS, AIRCRAFT DESIGN, COMPUTATIONAL...

A review is given of the recent advances in computer technology that are likely to impact structural analysis and design. The computational needs for future structures technology are described. The characteristics of new and projected computing systems are summarized. Advances in programming environments, numerical algorithms, and computational strategies for new computing systems are reviewed, and a novel partitioning strategy is outlined for maximizing the degree of parallelism. The strategy...

Topics: NASA Technical Reports Server (NTRS), ARCHITECTURE (COMPUTERS), CRAY COMPUTERS, MEMORY (COMPUTERS),...

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D...

Topics: NASA Technical Reports Server (NTRS), RESEARCH AND DEVELOPMENT, PARALLEL PROCESSING (COMPUTERS),...

A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring...

Topics: NASA Technical Reports Server (NTRS), THREE DIMENSIONAL MODELS, ALGORITHMS, COMPUTATIONAL FLUID...

Our MSAD-funded research project is to provide numerical modeling support for the VIBES (Vibration Isolation Box Experiment System) which is an IML2 flight experiment being built by the Japanese research team of Dr. H. Azuma of the Japanese National Aerospace Laboratory. During this reporting period, the following have been accomplished: A semi-consistent mass finite element projection algorithm for 2D and 3D Boussinesq flows has been implemented on Sun, HP And Cray Platforms. The algorithm has...

Topics: NASA Technical Reports Server (NTRS), BOUSSINESQ APPROXIMATION, COMPUTERIZED SIMULATION, FLIGHT...

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as...

Topics: NASA Technical Reports Server (NTRS), NAVIER-STOKES EQUATION, UNSTRUCTURED GRIDS (MATHEMATICS),...

The adaptation of a finite element program with explicit time integration to a massively parallel SIMD (single instruction multiple data) computer, the CONNECTION Machine is described. The adaptation required the development of a new algorithm, called the exchange algorithm, in which all nodal variables are allocated to the element with an exchange of nodal forces at each time step. The architectural and C* programming language features of the CONNECTION Machine are also summarized. Various...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, ARCHITECTURE (COMPUTERS), COMPUTATION, COMPUTER...

With the increasing importance of multiple platform/multiple remote sensing missions, fast and automatic integration of digital data from disparate sources has become critical to the success of these endeavors. Our work utilizes maxima of wavelet coefficients to form the basic features of a correlation-based automatic registration algorithm. Our wavelet-based registration algorithm is tested successfully with data from the National Oceanic and Atmospheric Administration (NOAA) Advanced Very...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, IMAGE PROCESSING, LANDSAT SATELLITES, REMOTE...