Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalue 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

A generalized multiple-input, multiple-output modal parameter estimation algorithm

A new method for experimental determination of the modal parameters of a structure is presented. The method allows for multiple input forces to be applied simultaneously, and for an arbitrary number of acceleration response measurements to be employed. These data are used to form the equations of motion for a damped linear elastic structure. The modal parameters are then obtained through an eigenvalue technique. In conjunction with the development of the equations, an extensive computer simulation study was performed. The results of the study show a marked improvement in the mode shape identification for closely-spaced modes as the number of applied forces is increased. Also demonstrated is the influence of noise on the method's ability to identify accurate modal parameters. Here again, an increase in the number of exciters leads to a significant improvement in the identified parameters.

Craig, R. R., Jr.↗
NASA NTRS1992

Convexity property of the one-sided multivariable stability margin

In evaluating the stability robustness of multivariable control systems having one-sided parameter uncertainty, a problem that naturally arises is the minimization over diagonal matrices D of the greatest eigenvalue of (e sup D Ae sup -D + (e sup D Ae sup -D)*)/2. The minimization is proved to be convex, thus guaranteeing that every local minimum is also a global minimum and, in theory, guaranteeing the global convergence of generalized gradient nonlinear programming algorithms for computing the minimizing D.

Tekawy, Jonathan A.↗
NASA NTRS1993

Linear static structural and vibration analysis on high-performance computers

Parallel computers offer the oppurtunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on massively-parallel computers hereafter referred to as Scalable High-Performance Computers (SHPC), for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. models for High-Speed Civil Transport). The goal of this research is to develop a new, efficient technique which extends structural analysis to SHPC and makes large-scale structural analyses tractable.

Baddourah, M. A.↗
NASA NTRS1993

Linear Static Structural and Vibration Analysis on High-Performance Computers

Parallel computers offer the opportunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on a massively-parallel computers hereafter referred to as Scalable High Performance Computers (SHPC) for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. Models of high speed civil transport). The goal of this research is to develop new efficient technique which extend structural analysis to SHPC and make large-scale structural analyses tractable.

Baddourah, Majdi↗
NASA NTRS1988

Numerically stable algorithm for discrete-ordinate-method radiative transfer in multiple scattering and emitting layered media

The transfer of monochromatic radiation in a scattering, absorbing, and emitting plane-parallel medium with a specified bidirectional reflectivity at the lower boundary is considered. The equations and boundary conditions are summarized. The numerical implementation of the theory is discussed with attention given to the reliable and efficient computation of eigenvalues and eigenvectors. Ways of avoiding fatal overflows and ill-conditioning in the matrix inversion needed to determine the integration constants are also presented.

Stamnes, Knut↗
NASA NTRS1990

Improving stability and strength characteristics of framed structures with nonlinear behavior

In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.

Pezeshk, Shahram↗
NASA NTRS1984

Design of an optimal output feedback control system with modal insensitivity

This paper deals with the design of an output feedback controller which results in selected modal insensitivity, and at the same time optimizes a quadratic performance index representative of desired system performance for nominal plant parameter values. The approach taken here is to characterize the class of attainable eigenvectors for a given set of eigenvalues (distinct or non-distinct) which lie in a subspace called the 'Modal Insensitivity Subspace'. A constraint is established on the feedback matrix which results in modal insensitivity. Necessary conditions for optimality subject to the constraint on the feedback matrix are given. This forms the basis for a numerical algorithm to compute the optimal feedback gain which analyzed for convergence. To illustrate the procedure, a design is carried out using the lateral dynamics of an L-1011 aircraft.

Raman, K. V.↗
NASA NTRS1989

On polynomial preconditioning for indefinite Hermitian matrices

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Freund, Roland W.↗
NASA NTRS1992

Robust Assignment Of Eigensystems For Flexible Structures

Improved method for placement of eigenvalues and eigenvectors of closed-loop control system by use of either state or output feedback. Applied to reduced-order finite-element mathematical model of NASA's MAST truss beam structure. Model represents deployer/retractor assembly, inertial properties of Space Shuttle, and rigid platforms for allocation of sensors and actuators. Algorithm formulated in real arithmetic for efficient implementation. Choice of open-loop eigenvector matrix and its closest unitary matrix believed suitable for generating well-conditioned eigensystem with small control gains. Implication of this approach is that element of iterative search for "optimal" unitary matrix appears unnecessary in practice for many test problems.

Juang, Jer-Nan↗
NASA NTRS2003

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1979

Linear state feedback, quadratic weights, and closed loop eigenstructures

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Thompson, P. M.↗
NASA NTRS1983

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗
NASA NTRS1985

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗
NASA NTRS1992

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗
NASA NTRS1985

An Eigensystem Realization Algorithm for Application to Modal Testing

Important features of the Eigensystem Realization Algorithm (ERA) are summarized as follows: (1) from the computational standpoint, the algorithm is attractive, since only simple numerical operations are needed; (2) the computational procedure is numerically stable; (3) the structural dynamics requirements for modal parameter identification and the control design requirements for a reduced-state space model are satisfied; (4) data from more than one test can be used simultaneously to efficiently identify the closely spaced eigenvalues; and (5) no restrictions on number of measurements are imposed.

Juang, J. N.↗
NASA NTRS1988

Attitude determination and parameter estimation using vector observations

Procedures for attitude determination based on Wahba's loss function are generalized to include the estimation of parameters other than the attitude, such as sensor biases. Optimization with respect to the attitude requires either the singular value decomposition of a 3x3 matrix or finding the maximum eigenvalue and corresponding eigenvector of a 4x4 symmetric matrix, but does not require an a priori estimate of the attitude. Optimization with respect to the other parameters employs an iterative approach, which does require an a priori estimate of these parameters. Conventional state estimation methods require a priori estimates of both the parameters and the attitude, while the algorithms presented in this paper always compute the exact optimal attitude for given values of the parameters. The proposed method is shown to give the correct solution of an example problem. An expression for the covariance of the attitude and parameter estimates is derived.

Markley, F. Landis↗
NASA NTRS1987

Improvements to the fastex flutter analysis computer code

Modifications to the FASTEX flutter analysis computer code (UDFASTEX) are described. The objectives were to increase the problem size capacity of FASTEX, reduce run times by modification of the modal interpolation procedure, and to add new user features. All modifications to the program are operable on the VAX 11/700 series computers under the VAX operating system. Interfaces were provided to aid in the inclusion of alternate aerodynamic and flutter eigenvalue calculations. Plots can be made of the flutter velocity, display and frequency data. A preliminary capability was also developed to plot contours of unsteady pressure amplitude and phase. The relevant equations of motion, modal interpolation procedures, and control system considerations are described and software developments are summarized. Additional information documenting input instructions, procedures, and details of the plate spline algorithm is found in the appendices.

Taylor, Ronald F.↗