Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear systems”

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,225 records · Page 68
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

A Multiblock Approach for Calculating Incompressible Fluid Flows on Unstructured Grids

A multiblock approach is presented for solving two-dimensional incompressible turbulent flows on unstructured grids. The artificial compressibility form of the governing equations is solved by a vertex-centered, finite-volume implicit scheme which uses a backward Euler time discretization. Point Gauss-Seidel relaxations are used to solve the linear system of equations at each time step. This work introduces a multiblock strategy to the solution procedure, which greatly improves the efficiency of the algorithm by significantly reducing the memory requirements while not increasing the CPU time. Results presented in this work shows that the current multiblock algorithm requires 70% less memory than the single block algorithm.

Sheng, Chunhua↗
NASA NTRS1997

CGRO Guest Investigator Program

The following are highlights from the research supported by this grant: (1) Theory of gamma-ray blazars: We studied the theory of gamma-ray blazars, being among the first investigators to propose that the GeV emission arises from Comptonization of diffuse radiation surrounding the jet, rather than from the synchrotron-self-Compton mechanism. In related work, we uncovered possible connections between the mechanisms of gamma-ray blazars and those of intraday radio variability, and have conducted a general study of the role of Compton radiation drag on the dynamics of relativistic jets. (2) A Nonlinear Monte Carlo code for gamma-ray spectrum formation: We developed, tested, and applied the first Nonlinear Monte Carlo (NLMC) code for simulating gamma-ray production and transfer under much more general (and realistic) conditions than are accessible with other techniques. The present version of the code is designed to simulate conditions thought to be present in active galactic nuclei and certain types of X-ray binaries, and includes the physics needed to model thermal and nonthermal electron-positron pair cascades. Unlike traditional Monte-Carlo techniques, our method can accurately handle highly non-linear systems in which the radiation and particle backgrounds must be determined self-consistently and in which the particle energies span many orders of magnitude. Unlike models based on kinetic equations, our code can handle arbitrary source geometries and relativistic kinematic effects In its first important application following testing, we showed that popular semi-analytic accretion disk corona models for Seyfert spectra are seriously in error, and demonstrated how the spectra can be simulated if the disk is sparsely covered by localized 'flares'.

Begelman, Mitchell C.↗
NASA NTRS1995

A Game Theoretic Fault Detection Filter

The fault detection process is modelled as a disturbance attenuation problem. The solution to this problem is found via differential game theory, leading to an H(sub infinity) filter which bounds the transmission of all exogenous signals save the fault to be detected. For a general class of linear systems which includes some time-varying systems, it is shown that this transmission bound can be taken to zero by simultaneously bringing the sensor noise weighting to zero. Thus, in the limit, a complete transmission block can he achieved, making the game filter into a fault detection filter. When we specialize this result to time-invariant system, it is found that the detection filter attained in the limit is identical to the well known Beard-Jones Fault Detection Filter. That is, all fault inputs other than the one to be detected (the "nuisance faults") are restricted to an invariant subspace which is unobservable to a projection on the output. For time-invariant systems, it is also shown that in the limit, the order of the state-space and the game filter can be reduced by factoring out the invariant subspace. The result is a lower dimensional filter which can observe only the fault to be detected. A reduced-order filter can also he generated for time-varying systems, though the computational overhead may be intensive. An example given at the end of the paper demonstrates the effectiveness of the filter as a tool for fault detection and identification.

Chung, Walter H.↗
NASA NTRS1999

The X-33 Flight Test Challenge

Low cost access to space has eluded present launch system technologies. Our objective is to reduce the cost of putting a payload into space from $10,000 per pound to $1000 per pound. In July 1996, a cooperative agreement was initiated between the Lockheed Martin Skunk Works and NASA to help accomplish this goal. The X-33 is the first step in the process to make low cost space access a reality. The X-33 is a suborbital, hypersonic lifting body, proof of concept of a reusable launch vehicle. The X-33 flight test program will validate technologies such as a metallic thermal protection system, Linear Aerospike Engines, use of tanks and struts as fundamental structural elements, as well as quick turnaround time. Flight testing will begin in July 2000, with launches originating from Edwards Air Force Base and initial landings at Michael Army Airfield in Utah. Data collected from these flight tests will aid in the decision to build an economically viable single stage to orbit reusable launch vehicle. This paper will explore the technical challenges facing the X-33 Flight Test Team.

Borden, David↗
NASA NTRS1989

A Computational Fluid Dynamics Algorithm on a Massively Parallel Computer

The discipline of computational fluid dynamics is demanding ever-increasing computational power to deal with complex fluid flow problems. We investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicit time-stepping algorithm; to obtain maximum performance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. We find that the Connection Machine ran achieve very high computation rates on both explicit and implicit algorithms. The performance of the Connection Machine puts it in the same class as today's most powerful conventional supercomputers.

Jespersen, Dennis C.↗
NASA NTRS1999

Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm

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 Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.

Mavriplis, Dimitri J.↗
NASA NTRS1999

Finite Differences and Collocation Methods for the Solution of the Two Dimensional Heat Equation

In this paper we combine finite difference approximations (for spatial derivatives) and collocation techniques (for the time component) to numerically solve the two dimensional heat equation. We employ respectively a second-order and a fourth-order schemes for the spatial derivatives and the discretization method gives rise to a linear system of equations. We show that the matrix of the system is non-singular. Numerical experiments carried out on serial computers, show the unconditional stability of the proposed method and the high accuracy achieved by the fourth-order scheme.

Kouatchou, Jules↗
NASA NTRS2000

Three-Dimensional Nacelle Aeroacoustics Code With Application to Impedance Education

A three-dimensional nacelle acoustics code that accounts for uniform mean flow and variable surface impedance liners is developed. The code is linked to a commercial version of the NASA-developed General Purpose Solver (for solution of linear systems of equations) in order to obtain the capability to study high frequency waves that may require millions of grid points for resolution. Detailed, single-processor statistics for the performance of the solver in rigid and soft-wall ducts are presented. Over the range of frequencies of current interest in nacelle liner research, noise attenuation levels predicted from the code were in excellent agreement with those predicted from mode theory. The equation solver is memory efficient, requiring only a small fraction of the memory available on modern computers. As an application, the code is combined with an optimization algorithm and used to reduce the impedance spectrum of a ceramic liner. The primary problem with using the code to perform optimization studies at frequencies above I1kHz is the excessive CPU time (a major portion of which is matrix assembly). The research recommends that research be directed toward development of a rapid sparse assembler and exploitation of the multiprocessor capability of the solver to further reduce CPU time.

Watson, Willie R.↗
NASA NTRS2000

Three-Dimensional Incompressible Navier-Stokes Flow Computations about Complete Configurations Using a Multiblock Unstructured Grid Approach

A multiblock unstructured grid approach is presented for solving three-dimensional incompressible inviscid and viscous turbulent flows about complete configurations. The artificial compressibility form of the governing equations is solved by a node-based, finite volume implicit scheme which uses a backward Euler time discretization. Point Gauss-Seidel relaxations are used to solve the linear system of equations at each time step. This work employs a multiblock strategy to the solution procedure, which greatly improves the efficiency of the algorithm by significantly reducing the memory requirements by a factor of 5 over the single-grid algorithm while maintaining a similar convergence behavior. The numerical accuracy of solutions is assessed by comparing with the experimental data for a submarine with stem appendages and a high-lift configuration.

Sheng, Chunhua↗
NASA NTRS1999

Reducing Conservatism of Analytic Transient Response Bounds via Shaping Filters

Recent results show that the peak transient response of a linear system to bounded energy inputs can be computed using the energy-to-peak gain of the system. However, analytically computed peak response bound can be conservative for a class of class bounded energy signals, specifically pulse trains generated from jet firings encountered in space vehicles. In this paper, shaping filters are proposed as a Methodology to reduce the conservatism of peak response analytic bounds. This Methodology was applied to a realistic Space Station assembly operation subject to jet firings. The results indicate that shaping filters indeed reduce the predicted peak response bounds.

Kwan, Aiyueh↗
NASA NTRS2000

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Oliker, Leonid↗
NASA NTRS2000

Electrophoretic Porosimetry of Sol-Gels

It has been hypothesized that gravity has an effect on the formation and resulting microstructure of sol-gels. In order to more clearly resolve the effect of gravity, pores may be non-destructively analyzed in the wet gel, circumventing the shrinkage and coarsening associated with the drying procedure. We discuss the development of an electrophoretic technique, analogous to affinity chromatography, for the determination of pore size distribution and its application to silica gels. Specifically a monodisperse charged dye is monitored by an optical densitometer as it moves through the wet gel under the influence of an electric field. The transmittance data (output) represents the convolution of the dye concentration profile at the beginning of the run (input) with the pore size distribution (transfer function), i.e. linear systems theory applies. Because of the practical difficulty in producing a delta function input dye profile we prefer instead to use a step function. Average pore size is then related to the velocity of this dye front, while the pore size distribution is related to the spreading of the front. Preliminary results of this electrophoretic porosimetry and its application to ground and space-grown samples will be discussed.

Snow, L. A.↗
NASA NTRS2002

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

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 class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.

Oliker, Leonid↗
NASA NTRS2002

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗
NASA NTRS2002

High-Order Spectral Volume Method for 2D Euler Equations

The Spectral Volume (SV) method is extended to the 2D Euler equations. The focus of this paper is to study the performance of the SV method on multidimensional non-linear systems. Implementation details including total variation diminishing (TVD) and total variation bounded (TVB) limiters are presented. Solutions with both smooth features and discontinuities are utilized to demonstrate the overall capability of the SV method.

Wang, Z. J.↗
NASA NTRS1956

On the Contribution of Turbulent Boundary Layers to the Noise Inside a Fuselage

The following report deals in preliminary fashion with the transmission through a fuselage of random noise generated on the fuselage skin by a turbulent boundary layer. The concept of attenuation is abandoned and instead the problem is formulated as a sequence of two linear couplings: the turbulent boundary layer fluctuations excite the fuselage skin in lateral vibrations and the skin vibrations induce sound inside the fuselage. The techniques used are those required to determine the response of linear systems to random forcing functions of several variables. A certain degree of idealization has been resorted to. Thus the boundary layer is assumed locally homogeneous, the fuselage skin is assumed flat, unlined and free from axial loads and the 'cabin' air is bounded only by the vibrating plate so that only outgoing waves are considered. Some of the details of the statistical description have been simplified in order to reveal the basic features of the problem. The results, strictly applicable only to the limiting case of thin boundary layers, show that the sound pressure intensity is proportional to the square of the free stream density, the square of cabin air density and inversely proportional to the first power of the damping constant and to the second power of the plate density. The dependence on free stream velocity and boundary layer thickness cannot be given in general without a detailed knowledge of the characteristics of the pressure fluctuations in the boundary layer (in particular the frequency spectrum). For a flat spectrum the noise intensity depends on the fifth power of the velocity and the first power of the boundary layer thickness. This suggests that boundary layer removal is probably not an economical means for decreasing cabin noise. In general, the analysis presented here only reduces the determination of cabin noise intensity to the measurement of the effect of any one of our variables (free stream velocity, boundary layer thickness, plate thickness or the characteristic velocity of propagation in the plate). The plate generates noise by vibrating in resonance over a wide range of frequencies and increasing the damping constant is consequently an effective method of decreasing noise generation. One of the main features of the results is that the relevant quantities upon which noise intensity depends are non-dimensional numbers in which boundary layer and plate properties enter as ratios. This is taken as an indication that in testing models of structures for boundary layer noise it is not sufficient to duplicate in the model the structural characteristics of the fuselage. One must match properly the characteristics of the exicitng pressure fluctuations to that of the structure.

Corcos, G. M.↗
NASA NTRS2004

A Deconvolution Approach for the Mapping of Acoustic Sources (DAMAS) Determined from Phased Microphone Arrays

Current processing of acoustic array data is burdened with considerable uncertainty. This study reports an original methodology that serves to demystify array results, reduce misinterpretation, and accurately quantify position and strength of acoustic sources. Traditional array results represent noise sources that are convolved with array beamform response functions, which depend on array geometry, size (with respect to source position and distributions), and frequency. The Deconvolution Approach for the Mapping of Acoustic Sources (DAMAS) method removes beamforming characteristics from output presentations. A unique linear system of equations accounts for reciprocal influence at different locations over the array survey region. It makes no assumption beyond the traditional processing assumption of statistically independent noise sources. The full rank equations are solved with a new robust iterative method. DAMAS is quantitatively validated using archival data from a variety of prior high-lift airframe component noise studies, including flap edge/cove, trailing edge, leading edge, slat, and calibration sources. Presentations are explicit and straightforward, as the noise radiated from a region of interest is determined by simply summing the mean-squared values over that region. DAMAS can fully replace existing array processing and presentations methodology in most applications. It appears to dramatically increase the value of arrays to the field of experimental acoustics.

Brooks, Thomas F.↗
NASA NTRS1997

Implicit/Multigrid Algorithms for Incompressible Turbulent Flows on Unstructured Grids

An implicit code for computing inviscid and viscous incompressible flows on unstructured grids is described. The foundation of the code is a backward Euler time discretization for which the linear system is approximately solved at each time step with either a point implicit method or a preconditioned Generalized Minimal Residual (GMRES) technique. For the GMRES calculations, several techniques are investigated for forming the matrix-vector product. Convergence acceleration is achieved through a multigrid scheme that uses non-nested coarse grids that are generated using a technique described in the present paper. Convergence characteristics are investigated and results are compared with an exact solution for the inviscid flow over a four-element airfoil. Viscous results, which are compared with experimental data, include the turbulent flow over a NACA 4412 airfoil, a three-element airfoil for which Mach number effects are investigated, and three-dimensional flow over a wing with a partial-span flap.

Anderson, W. Kyle↗