Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalue”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Palmieri, J. V.↗
NASA NTRS1979

A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems

An algorithm is proposed for a scheme of simultaneous coordinate relaxation. A variant of root-shifting coordinate relaxation, this procedure consists of iterating several vectors at the same time, instead of one at a time. Results of application of the algorithm to test matrices are discussed. For many matrix eigenvalue problems for which coordinate relaxation is a viable approach, the present algorithm is more effective than previous implementations of coordinate relaxation. Total central processor operations should be decreased due to significantly improved convergence.

Raffenetti, R. C.↗
NASA NTRS1981

Graph theory approach to the eigenvalue problem of large space structures

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Reddy, A. S. S. R.↗
NASA NTRS1984

Legendre-Tau approximation for functional differential equations. Part 3: Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗
NASA NTRS1985

The eigenvalues of the pseudospectral Fourier approximation to the operator sin (2x) d/dx

It is shown that the eigenvalues Z sub i of the pseudospectral Fourier approximation to the operator sin(2x) curly d/curly dx satisfy (R sub e) (Z sub i) = + or - 1 or (R sub e)(Z sub I) = 0. Whereas this does not prove stability for the Fourier method, applied to the hyperbolic equation U sub t = sin (2x)(U sub x) - pi x pi; it indicates that the growth in time of the numerical solution is essentially the same as that of the solution to the differential equation.

Tal-Ezer, H.↗
NASA NTRS1985

Eigenvalues and stability problems of rotors

The essential theoretical results of the application of a developed transfer matrix method to the free transverse vibration of a rotor are shown. Gyroscopic and shear effects, rotary inertia, and external and internal damping as well as the influence of sleeve bearings and rotor supports are taken into consideration. The eigenvalues of the motion equations of the rotor are searched by using a modified determinant method.

Walczyk, Z.↗
NASA NTRS1985

Control of large flexible systems via eigenvalue relocation

For the vibration control of large flexible systems, a control scheme by which the eigenvalues of the closed-loop systems are assigned to predetermined locations within the feasible region through velocity-only feedback is presented. Owing to the properties of second-order lambda-matrices and an efficient model decoupling technique, the control scheme makes it possible that selected modes are damped with the rest of the modes unchanged.

Denman, E. D.↗
NASA NTRS1985

Legendre-tau approximation for functional differential equations. III - Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗
NASA NTRS1986

Eigenvalue assignment strategies in rotor systems

The work done to establish the control and direction of effective eigenvalue excursions of lightly damped, speed dependent rotor systems using passive control is discussed. Both second order and sixth order bi-axis, quasi-linear, speed dependent generic models were investigated. In every case a single, bi-directional control bearing was used in a passive feedback stabilization loop to resist modal destabilization above the rotor critical speed. Assuming incomplete state measurement, sub-optimal control strategies were used to define the preferred location of the control bearing, the most effective measurement locations, and the best set of control gains to extend the speed range of stable operation. Speed dependent control gains were found by Powell's method to maximize the minimum modal damping ratio for the speed dependent linear model. An increase of 300 percent in stable speed operation was obtained for the sixth order linear system using passive control. Simulations were run to examine the effectiveness of the linear control law on nonlinear rotor models with bearing deadband. The maximum level of control effort (force) required by the control bearing to stabilize the rotor at speeds above the critical was determined for the models with bearing deadband.

Youngblood, J. N.↗
NASA NTRS1987

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency for the Lanczos method was good for a moderate number of processors for the test problem, the greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗
NASA NTRS1987

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency is problem and computer dependent, the efficiency for the Lanczos method was good for a moderate number of processors for the test problem. The greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗
NASA NTRS1987

Simultaneous analysis and design for eigenvalue maximization

A simultaneous analysis and design approach to the maximization of buckling or vibration eigenvalues is presented. Both unimodal and bimodal optimum solutions are considered. A discretization of the structure and response is used to obtain sets of nonlinear algebraic equations which are solved numerically. The formulation is applied to the solution of the optimum design of a beam-column supported by an elastic foundation for maximum buckling load. Two cases are considered: the optimum design of the column for a given foundation and the optimum design of the foundation for a given column. Results are compared to published solutions when possible.

Plaut, Raymond H.↗
NASA NTRS1986

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗
NASA NTRS1986

Numerical pole assignment by eigenvalue Jacobian inversion

A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.

Sevaston, George E.↗
NASA NTRS1989

On the calculation of derivatives of eigenvalues and eigenvectors in the simultaneous design and control of structures

Independent Modal Space Control (IMSC) is a technique that is often used for the control of large order structural systems. The pertinent optimization problem in the simultaneous design and control of structures is a min - min problem that minimizes with respect to the structural design variables, the minimum value of the performance index with respect to the control forces obtained using the IMSC technique. The minimization process requires derivatives of eigenvalues and eigenvectors with respect to the design variables. These derivatives can be computed by a rather involved analytical procedure or a relatively simple finite difference procedure. The computer cost effectiveness of these two procedures for the derivative calculations is examined.

Mesquita, Luis↗
NASA NTRS1988

Solving large sparse eigenvalue problems on supercomputers

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 and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.

Philippe, Bernard↗
NASA NTRS1988

Linear quadratic regulators with eigenvalue placement in a specified region

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at + or - pi/2k (k = 2 or 3) from the negative real axis with a sector angle of pi/2 or less, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane. The design method is mainly based on the solution of a linear matrix Liapunov equation, and the resultant closed-loop system with its eigenvalues in the desired region is optimal with respect to a quadratic performance index.

Shieh, Leang S.↗
NASA NTRS1989

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗