Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “structured 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.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Highly parallel sparse Cholesky factorization

Several fine grained parallel algorithms were developed and compared to compute the Cholesky factorization of a sparse matrix. The experimental implementations are on the Connection Machine, a distributed memory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special purpose algorithms in which the matrix structure conforms to the connection structure of the machine, the focus is on matrices with arbitrary sparsity structure. The most promising algorithm is one whose inner loop performs several dense factorizations simultaneously on a 2-D grid of processors. Virtually any massively parallel dense factorization algorithm can be used as the key subroutine. The sparse code attains execution rates comparable to those of the dense subroutine. Although at present architectural limitations prevent the dense factorization from realizing its potential efficiency, it is concluded that a regular data parallel architecture can be used efficiently to solve arbitrarily structured sparse problems. A performance model is also presented and it is used to analyze the algorithms.

Gilbert, John R.↗
NASA NTRS1998

Algorithms for Efficient Computation of Transfer Functions for Large Order Flexible Systems

An efficient and robust computational scheme is given for the calculation of the frequency response function of a large order, flexible system implemented with a linear, time invariant control system. Advantage is taken of the highly structured sparsity of the system matrix of the plant based on a model of the structure using normal mode coordinates. The computational time per frequency point of the new computational scheme is a linear function of system size, a significant improvement over traditional, still-matrix techniques whose computational times per frequency point range from quadratic to cubic functions of system size. This permits the practical frequency domain analysis of systems of much larger order than by traditional, full-matrix techniques. Formulations are given for both open- and closed-loop systems. Numerical examples are presented showing the advantages of the present formulation over traditional approaches, both in speed and in accuracy. Using a model with 703 structural modes, the present method was up to two orders of magnitude faster than a traditional method. The present method generally showed good to excellent accuracy throughout the range of test frequencies, while traditional methods gave adequate accuracy for lower frequencies, but generally deteriorated in performance at higher frequencies with worst case errors being many orders of magnitude times the correct values.

Maghami, Peiman G.↗
NASA NTRS1997

Efficient Computation of Closed-loop Frequency Response for Large Order Flexible Systems

An efficient and robust computational scheme is given for the calculation of the frequency response function of a large order, flexible system implemented with a linear, time invariant control system. Advantage is taken of the highly structured sparsity of the system matrix of the plant based on a model of the structure using normal mode coordinates. The computational time per frequency point of the new computational scheme is a linear function of system size, a significant improvement over traditional, full-matrix techniques whose computational times per frequency point range from quadratic to cubic functions of system size. This permits the practical frequency domain analysis of systems of much larger order than by traditional, full-matrix techniques. Formulations are given for both open and closed loop loop systems. Numerical examples are presented showing the advantages of the present formulation over traditional approaches, both in speed and in accuracy. Using a model with 703 structural modes, a speed-up of almost two orders of magnitude was observed while accuracy improved by up to 5 decimal places.

Maghami, Peiman G.↗
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 NTRS1994

Tensor-GMRES method for large sparse systems of nonlinear equations

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Feng, Dan↗
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 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 NTRS2024

Piezoelectric impedance-based high-accuracy damage identification using sparsity conscious multi-objective optimization inverse analysis

Two elements are essential in structural health monitoring utilizing dynamic responses: response measurement with high-frequency contents, i.e., small characteristic wavelengths, that can adequately reflect damage features, and effective inverse identification analysis that is however oftentimes under-determined. The advancement of smart structure integration has led to active interrogation through frequency-sweeping piezoelectric impedance measurement at high frequency range. In this research we develop a multi-objective optimization formulation for the identification of damage location and severity utilizing piezoelectric impedance. While one optimization objective is to match the response measurement with finite element model prediction in the damage parametric space, the other is the number of locations of damage, i.e., the sparsity of damage index as the solution vector, since damage usually occurs within a small number of locations. This multi-objective formulation fits well the under-determined nature of damage identification, as it naturally provides multiple solutions as basis for further elucidation. The challenge remaining is how to find a small solution set that can include the actual damage scenario. Here we develop a novel inverse identification framework utilizing the intelligent swarm optimizer which possesses flexibility for enhancement. We first embed a sparsity enforcement process into the population generation of the optimizer, which yields a solution repository intrinsically possessing sparsity. We then apply reinforcement learning so the agents can adaptively opt for local strategies with the aim of enriching the searching patterns to diversify the solutions. Through the incorporation of a Q-table, searching toward more promising directions will be rewarded. Our case analyses employing experimental data indicate that this sparsity-conscious multi-objective particle swarm optimization technique can lead to a small solution set which generally encompasses the true damage scenario. This effectively solves the structural damage identification problem with piezoelectric impedance measurement.

Yang Zhang↗
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 NTRS1992

Eigenstructure assignment approach for structural damage detection

In this work, a methodology for incorporating measured modal data into an existing refined finite element model is examined with the objective of detecting and locating structural damage. The algorithm is based on the partial inverse problem, in that only partial spectral information is required. The technique utilizes a symmetric eigenstructure assignment algorithm to perform the partial spectral assignment. Algorithms to enhance mode shape assignability and to preserve sparsity in the damaged FEM are developed. The sparsity preservation is of particular importance when considering damage detection in trusslike structures. Several examples are presented to highlight the key points made within the paper.

Zimmerman, David C.↗
NASA NTRS1992

An inverse problem approach for structural damage detection - Finite element model refinement

In this work, a methodology for incorporating measured modal data into an existing refined finite element model is examined with the objective of detecting and locating structural damage. This same algorithm is also useful in terms of finite element model refinement. The algorithm is based on the partial inverse problem, in that only partial spectral information is required. The technique utilizes a symmetric eigenstructure assignment algorithm to perform the partial spectral assignment. Algorithms to enhance mode shape assignability and to preserve sparsity in the updated model are developed. The sparsity preservation is of particular importance when considering damage detection in truss-like structures. Several examples are presented which highlight the key points made within the paper.

Zimmerman, D. C.↗
NASA NTRS1972

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗
NASA NTRSDate not supplied

Spatiotemporal Analysis of High-Resolution Pressure-Sensitive Paint Measurements on a Launch Vehicle Wind Tunnel Model

An accurate understanding of unsteady aerodynamic loads is critical for launch vehicle structural design and for development of the vibro-acoustic environment for payload components. Analysts commonly use point-wise surface pressure measurements from wind tunnel testing to build statistical models of the in-flight turbulent boundary layer flow structures, often extrapolating over large swaths of the surface due to measurement sparsity. We present novel results from a transonic wind tunnel test using fast-response pressure-sensitive paint (PSP) and show how it can be used to visualize and quantify localized turbulent boundary layer wall pressure statistics with unprecedented spatial resolution. The wind tunnel model is a scaled model of the Space Launch System (SLS) rocket Block 1B Crew configuration and analysis focused on the compression corner between the Service Module fairing and the Universal Stage Adapter.

Corcos Model↗
NASA NTRS1989

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗
NASA NTRS1992

Finite element solution of optimal control problems with state-control inequality constraints

It is demonstrated that the weak Hamiltonian finite-element formulation is amenable to the solution of optimal control problems with inequality constraints which are functions of both state and control variables. Difficult problems can be treated on account of the ease with which algebraic equations can be generated before having to specify the problem. These equations yield very accurate solutions. Owing to the sparse structure of the resulting Jacobian, computer solutions can be obtained quickly when the sparsity is exploited.

Bless, Robert R.↗
NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, R.↗
NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on the system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, Ralph↗
NASA NTRS2000

Model Refinement Using Eigensystem Assignment

IA novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices with appropriate sparsity that reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one conjugate pair of eigenvalues at each step using symmetric output feedback gain matrices, and the eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley Research Center (Controls-Structures-Interaction Evolutionary model) is presented to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗