SEARCH · Search NASA

Results for “Sparsity”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

NASA NTRS1975

Sparse matrix techniques applied to modal analysis of multi-section duct liners

A simplified procedure is presented for analysis of ducts with discretely nonuniform properties. The analysis uses basis functions as the generalized coordinates. The duct eigenfunctions are approximated by finite series of these functions. The emphasis is on solution of the resulting large sparse set of linear equations. Characteristics of sparse matrix algorithms are outlined and some criteria for application are established. Analogies with structural methods are used to illustrate variations which can increase efficiency in generating values for design optimization routines. The effects of basis function selection, number of eigenfunctions and identification and ordering of equations on the sparsity and solution stability are included.

Arnold, W. R.↗

NASA NTRS1976

Evidence of Archaean life - A brief appraisal

Attention is called to the question of whether the meagerness of the Archaean fossil record is a function of a sparsity of preserved, cratonal, fossiliferous facies, or whether the abrupt break in the known fossil record near the Archaean-Proterozoic boundary reflects a major event in biological evolution. The paper then reviews the currently available geochemical and paleobiological data on Archaean biota. The occurrence of stromatolites in the Archaean, and the carbon isotopic composition of Archaean organic matter, both suggest strongly the existence of an Archaean biota. The presence of relatively abundant and morphologically complex microorganisms in deposits of early Proterozoic age seems to be certain evidence for a prior episode of Archaean evolution.

Schopf, J. W.↗

NASA NTRS1977

Numerical analysis of free vibrations of damped rotating structures

This paper is concerned with the efficient numerical solution of damped and undamped free vibration problems of rotating structures. While structural discretization is achieved by the finite element method, the associated eigenproblem solution is effected by a combined Sturm sequence and inverse iteration technique that enables the computation of a few required roots only without having to compute any other. For structures of complex configurations, a modal synthesis technique is also presented, which is based on appropriate combinations of eigenproblem solution of various structural components. Such numerical procedures are general in nature, which fully exploit matrix sparsity inherent in finite element discretizations, and prove to be most efficient for the vibration analysis of any damped rotating structure, such as rotating machineries, helicopter and turbine blades, spinning space stations, among others.

Gupta, K. K.↗

NASA NTRS1978

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗

NASA NTRS1978

Some recent advances in numerical methods in structural dynamics

The purpose of this paper is to present some recent developments in the area of numerical dynamic analysis of large structural systems. The first part of the paper is devoted to the finite dynamic element method, a new concept in the discretization of a continuum, the adoption of which effects considerable reduction in the number of degrees of freedom for a required solution accuracy, when compared with the usual finite element method. This is followed by a brief description of eigenproblem solution techniques, for the free vibration analysis of both rotating and nonrotating structures, that fully exploit the associated matrix sparsity. Together, these techniques constitute a powerful tool for the free vibration and subsequent dynamic response analysis of complex practical structures.

Gupta, K. K.↗

NASA NTRS1980

Plan of research for integrated soil moisture studies. Recommendations of the Soil Moisture Working Group

Soil moisture information is a potentially powerful tool for applications in agriculture, water resources, and climate. At present, it is difficult for users of this information to clearly define their needs in terms of accuracy, resolution and frequency because of the current sparsity of data. A plan is described for defining and conducting an integrated and coordinated research effort to develop and refine remote sensing techniques which will determine spatial and temporal variations of soil moisture and to utilize soil moisture information in support of agricultural, water resources, and climate applications. The soil moisture requirements of these three different application areas were reviewed in relation to each other so that one plan covering the three areas could be formulated. Four subgroups were established to write and compile the plan, namely models, ground-based studies, aircraft experiments, and spacecraft missions.

Source record↗

NASA NTRS1982

Minimization versus homotopy algorithms

The relative merits and demerits of the minimization techniques are assessed using globally convergent quasi-Newton algorithms on the one hand and the homotopy algorithms on the other hand for the solution of problems of nonlinear structural analysis. Like the homotopy algorithms, the globally convergent quasi-Newton algorithms are equally suited for the solution of the nonlinear equations of structural analysis directly without having to pose the problem as an equivalent minimization problem. In the close neighborhood of the limit and bifurcation points quasi-Newton algorithms experience difficulties. Homotopy algorithms are robust for practically all types of nonlinear problems but are computationally not as cost effective since they provide an extremely accurate prediction of the response by calculating it as a large number of points. Globally convergent algorithms can perform well with very approximate Hessians, while homotopy algorithms require extremely accurate Hessians. While quasi-Newton algorithms can be very easily structured to exploit sparsity and symmetry, homotopy algorithms are not presently so structured and would require special modifications for exploitation of such features without sacrificing robustness and global convergence.

Kamat, M. P.↗

NASA NTRS1984

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

NASA NTRS1985

Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

Reed, D. A.↗

NASA NTRS1985

Parallel, iterative solution of sparse linear systems - Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problem in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

NASA NTRS1986

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗

NASA NTRS1987

Survey of methods for calculating sensitivity of general eigenproblems

A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.

Murthy, Durbha V.↗

NASA NTRS1987

Implementation of a block Lanczos algorithm for Eigenproblem solution of gyroscopic systems

The details of implementation of a general numerical procedure developed for the accurate and economical computation of natural frequencies and associated modes of any elastic structure rotating along an arbitrary axis are described. A block version of the Lanczos algorithm is derived for the solution that fully exploits associated matrix sparsity and employs only real numbers in all relevant computations. It is also capable of determining multiple roots and proves to be most efficient when compared to other, similar, exisiting techniques.

Gupta, Kajal K.↗

NASA NTRS1987

Implementation of a block Lanczos algorithm for eigenproblem solution of gyroscopic systems

This paper describes the details of implementation of a general numerical procedure developed for the accurate and economical computation of natural frequencies and associated modes of any elastic structure rotating along an arbitrary axis. A block version of the Lanczos algorithm is derived for the solution that fully exploits associated matrix sparsity and employs only real numbers in all relevant computations. It is also capable of determining multiple roots and proves to be most efficient when compared to other, similar, existing techniques.

Gupta, K. K.↗

NASA NTRS1988

Derivatives of eigenvalues and eigenvectors of a general complex matrix

Murthy, Durbha V.↗

NASA NTRS1988

Development of a block Lanczos algorithm for free vibration analysis of spinning structures

This paper is concerned with the development of an efficient eigenproblem solution algorithm and an associated computer program for the economical solution of the free vibration problem of complex practical spinning structural systems. Thus, a detailed description of a newly developed block Lanczos procedure is presented in this paper that employs only real numbers in all relevant computations and also fully exploits sparsity of associated matrices. The procedure is capable of computing multiple roots and proves to be most efficient compared to other existing similar techniques.

Gupta, K. K.↗

NASA NTRS1989

Jet stream winds - Enhanced aircraft data acquisition and analysis over Southwest Asia

A project is described for providing the accurate initial and verification analyses for the jet stream in regions where general circulation models are known to have large systematic errors, either due to the extreme sparsity of data or to incorrect physical parameterizations. For this purpose, finely spaced aircraft-based meteorological data for the Southwest Asian regions collected for three 10-day periods in the winter of 1988-1989 will be used, together with corresponding data for the North American regions used as a control, to rerun the assimilation cycles and forecast models of the NMC and the NASA Goddard Laboratory for Atmospheres. Data for Southeast Asia will be collected by three carriers with extensive wide-body routes crossing the total region, while data for the North American region will be obtained from the archives of ACARS and GTS.

Tenenbaum, J.↗

NASA NTRS1989

Harmonic analysis of spacecraft power systems using a personal computer

The effects that nonlinear devices such as ac/dc converters, HVDC transmission links, and motor drives have on spacecraft power systems are discussed. The nonsinusoidal currents, along with the corresponding voltages, are calculated by a harmonic power flow which decouples and solves for each harmonic component individually using an iterative Newton-Raphson algorithm. The sparsity of the harmonic equations and the overall Jacobian matrix is used to an advantage in terms of saving computer memory space and in terms of reducing computation time. The algorithm could also be modified to analyze each harmonic separately instead of all at the same time.

Williamson, Frank↗