Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

The method of Ritz applied to the equation of Hamilton

Without any reference to the theory of differential equations, the initial value problem of the nonlinear, nonconservative double pendulum system is solved by the application of the method of Ritz to the equation of Hamilton. Also shown is an example of the reduction of the traditional eigenvalue problem of linear, homogeneous, differential equations of motion to the solution of a set of nonhomogeneous algebraic equations. No theory of differential equations is used. Solution of the time-space path of the linear oscillator is demonstrated and compared to the exact solution.

Bailey, C. D.↗
NASA NTRS1986

Inclusion of elastically connected members in exact buckling and frequency calculations

A standard stiffness matrix procedure which permits any combination of rigid, elastic, pinned or sliding connections of the degrees of freedom at the ends of a member to the nodes of its parent structure is described, in order to show how easily it can be extended to allow an existing algorithm to be used to ensure that no eigenvalues of the parent structure can be missed even when 'exact' member theory is used. The eigenvalues are the natural frequencies of undamped free vibration analyses or the critical load factors of buckling problems. The method preserves the exactness of the member theory and an efficient method for computer application is indicated. The theory also permits any combination of rigid, elastic, pinned or sliding connections between the freedoms of a substructure and those of its parent structure.

Williams, F. W.↗
NASA NTRS1988

Generalized Eigenvalues for pairs on heritian matrices

A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.

Rublein, George↗
NASA NTRS1990

Quasinormal modes of Reissner-Nordstrom black holes

A matrix-eigenvalue algorithm is presented for accurately computing the quasi-normal frequencies and modes of charged static blackholes. The method is then refined through the introduction of a continued-fraction step. The approach should generalize to a variety of nonseparable wave equations, including the Kerr-Newman case of charged rotating blackholes.

Leaver, Edward W.↗
NASA NTRS1989

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Swarztrauber, Paul N.↗
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 NTRS1998

Development of a Probabilistic Dynamic Synthesis Method for the Analysis of Nondeterministic Structures

Accounting for the statistical geometric and material variability of structures in analysis has been a topic of considerable research for the last 30 years. The determination of quantifiable measures of statistical probability of a desired response variable, such as natural frequency, maximum displacement, or stress, to replace experience-based "safety factors" has been a primary goal of these studies. There are, however, several problems associated with their satisfactory application to realistic structures, such as bladed disks in turbomachinery. These include the accurate definition of the input random variables (rv's), the large size of the finite element models frequently used to simulate these structures, which makes even a single deterministic analysis expensive, and accurate generation of the cumulative distribution function (CDF) necessary to obtain the probability of the desired response variables. The research presented here applies a methodology called probabilistic dynamic synthesis (PDS) to solve these problems. The PDS method uses dynamic characteristics of substructures measured from modal test as the input rv's, rather than "primitive" rv's such as material or geometric uncertainties. These dynamic characteristics, which are the free-free eigenvalues, eigenvectors, and residual flexibility (RF), are readily measured and for many substructures, a reasonable sample set of these measurements can be obtained. The statistics for these rv's accurately account for the entire random character of the substructure. Using the RF method of component mode synthesis, these dynamic characteristics are used to generate reduced-size sample models of the substructures, which are then coupled to form system models. These sample models are used to obtain the CDF of the response variable by either applying Monte Carlo simulation or by generating data points for use in the response surface reliability method, which can perform the probabilistic analysis with an order of magnitude less computational effort. Both free- and forced-response analyses have been performed, and the results indicate that, while there is considerable room for improvement, the method produces usable and more representative solutions for the design of realistic structures with a substantial savings in computer time.

Brown, A. M.↗
DOE OSTI2025

Bounds on spectral gaps of Hyperbolic spin surfaces

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral identities follow from the consistency between 1) the spectral decomposition of functions on the spin bundle into irreducible representations of SL(2,R) and 2) associativity of pointwise multiplication of functions. Applying semidefinite programming methods to our identities produces rigorous upper bounds on the Laplacian spectral gap as well as on the Dirac spectral gap conditioned on the former. In several examples, our bounds are nearly sharp; a numerical algorithm based on the Selberg trace formula shows that the [0;3,3,5] orbifold, a particular surface with signature [1;3], and the Bolza surface nearly saturate the bounds at genus 0, 1 and 2 respectively. Under additional assumptions on the number of harmonic spinors carried by the spin-surface, we obtain more restrictive bounds on the Laplacian spectral gap. In particular, these bounds apply to hyperelliptic surfaces. We also determine the set of Laplacian spectral gaps attained by all compact orientable two-dimensional hyperbolic spin orbifolds. We show that this set is upper bounded by 12.13798; this bound is nearly saturated by the [0;3,3,5] orbifold, whose first non-zero Laplacian eigenvalue is λ^(0)_1 ≈ 12.13623.

Spectral theory↗
NASA NTRS1996

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗
NASA NTRS1973

A simplified modal plotting technique for the representation of complex structural models

A plotting method has been developed that has proven to be useful in rapidly defining the mode shapes of a complex spacecraft. The reduction of the complex model to a simple stick plot is accomplished by augmenting the existing NASTRAN plot package with constrained plot elements. Both the existing NASTRAN modal plot package and the stick plots of a representative mode are presented for comparison. The NASTRAN plot package provides the capability of generating modal deformations (mode shapes) resulting from real eigenvalue analysis. These modal deformations of the structural model may be displayed in the deformed shape either alone or superimposed on the undeformed shape. Another available method of displaying the modal deformations is by means of displacement vectors at the grid points

Hanlein, S. L.↗
NASA NTRS1989

An integrating matrix formulation for buckling of rotating beams including the effects of concentrated masses

The integrating matrix technique of computational mechanics is extended to include the effects of concentrated masses. The stability of a flexible rotating beam with discrete masses is analyzed to determine the critical rotational speeds for buckling in the inplane and out-of-plane directions. In this problem, the beam is subjected to compressive centrifugal forces arising from steady rotation about an axis which does not pass through the clamped end of the beam. To determine the eigenvalues from which stability is assessed, the differential equations of motion are solved numerically by combining the extended integrating matrix method with an eigenanalysis. Stability boundaries for a discrete mass representation of a uniform beam are shown to asymptotically approach the stability boundaries for the corresponding continuous mass beam as the number of concentrated masses is increased. An error in the literature is also noted for the discrete mass problem concerning the behavior of the critical rotational speed for inplane buckling as the radius of rotation of the clamped end of the beam is reduced.

Lakin, William D.↗
NASA NTRS1960

Comparison of Turbulent Heat-Transfer Results for Uniform Wall Heat Flux and Uniform Wall Temperature

The purpose of this note is to examine in a more precise way how the Nusselt numbers for turbulent heat transfer in both the fully developed and thermal entrance regions of a circular tube are affected by two different wall boundary conditions. The comparisons are made for: (a) Uniform wall temperature (UWT); and (b) uniform wall heat flux (UHF). Several papers which have been concerned with the turbulent thermal entrance region problem are given. 1 Although these analyses have all utilized an eigenvalue formulation for the thermal entrance region there were differences in the choices of eddy diffusivity expressions, velocity distributions, and methods for carrying out the numerical solutions. These differences were also found in the fully developed analyses. Hence when making a comparison of the analytical results for uniform wall temperature and uniform wall heat flux, it was not known if differences in the Nusselt numbers could be wholly attributed to the difference in wall boundary conditions, since all the analytical results were not obtained in a consistent way. To have results which could be directly compared, computations were carried out for the uniform wall temperature case, using the same eddy diffusivity, velocity distribution, and digital computer program employed for uniform wall heat flux. In addition, the previous work was extended to a lower Reynolds number range so that comparisons could be made over a wide range of both Reynolds and Prandtl numbers.

Siegel, R.↗
NASA NTRS1993

Structural/control system optimization with variable actuator masses

A method is presented to integrate the design space for structural/control system optimization problems in the case of linear state feedback control. Nonstructural lumped masses and control system design variables as well as structural sizing variables are all treated equally as independent design variables in the optimization process. Structural and control design variable linking schemes are used in order to avoid a prohibitively large increase in the total number of independent design variables. When actuator masses are treated as nonstructural lumped mass design variables, special consideration is given to the relation between the transient peak responses and the required actuator masses which is formulated as a behavior constraint form. The original nonlinear mathematical programming problem based on a finite element formulation and linear state feedback is replaced by a sequence of explicit approximate problems exploiting various approximation concepts such as design variable linkings, temporary constraint deletion and first order Taylor series expansion of nonlinear behavior constraints in terms of intermediate design variables. Examples which involve a variety of dynamic behavior constraints (including constraints on closed-loop eigenvalues, peak transient displacements, peak actuator forces, and relations between the peak responses and the actuator masses) are effectively solved by using the method presented.

Jin, Ik M.↗
NASA NTRS1988

Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors

Symmetric tridiagonal eigenvalue problems may arise indirectly in structural dynamic analysis. An algorithm for eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors to meet the challenge of the new emerging computer hardware technology is presented. A standard bisection method in conjunction with Sylvester's Theorem is chosen to be converted into a parallel N-section algorithm. This parallel algorithm takes advantage of the multi-processor environment by carrying out N (number of processors) triangular factorizations of chosen shifted matrices in all processors concurrently and by minimizing communication between processors. The algorithm is designed for local-memory concurrent processors, i.e. message passing type processors. The efficiency and speed-up are given in terms of problem and machine parameters. The algorithm is very efficient when both the number of processors and the number of eigenvalues to be extracted are much smaller than the order of the tridiagonal matrix.

Chang, H. Y.↗
NASA NTRS1976

Nonlinear Equations of Motion for Cantilever Rotor Blades in Hover with Pitch Link Flexibility, Twist, Precone, Droop, Sweep, Torque Offset, and Blade Root Offset

Nonlinear equations of motion for a cantilever rotor blade are derived for the hovering flight condition. The blade is assumed to have twist, precone, droop, sweep, torque offset and blade root offset, and the elastic axis and the axes of center of mass, tension, and aerodynamic center coincident at the quarter chord. The blade is cantilevered in bending, but has a torsional root spring to simulate pitch link flexibility. Aerodynamic forces acting on the blade are derived from strip theory based on quasi-steady two-dimensional airfoil theory. The equations are hybrid, consisting of one integro-differential equation for root torsion and three integro-partial differential equations for flatwise and chordwise bending and elastic torsion. The equations are specialized for a uniform blade and reduced to nonlinear ordinary differential equations by Galerkin's method. They are linearized for small perturbation motions about the equilibrium operating condition. Modal analysis leads to formulation of a standard eigenvalue problem where the elements of the stability matrix depend on the solution of the equilibrium equations. Two different forms of the root torsion equation are derived that yield virtually identical numerical results. This provides a reasonable check for the accuracy of the equations.

Hodges, D. H.↗
NASA NTRS1990

Minimum-size design of regulation systems and the application to Space Station

A method is proposed to determine the sizes of the regulator and observer and to design the feedback and Kalman gain matrices for the reduced system. The sizes determined are minimum in the sense of satisfying the specified eigenvalue limits when the interaction between the regulator and the observer can be neglected. The resulting sizes will depend on the properties of the original system and the desired response. If the interaction between the regulator and the observer becomes substantial, more modes in the observer should be included, or other methods should be used for reducing the observation spillover or control spillover.

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

Sequential design of linear quadratic state regulators with prescribed eigenvalues and specified relative stability

This paper considers the problem of optimal regulator design of linear multivariable systems with prescribed pole locations and/or poles corresponding to specified relative stability. A sequential method based on the frequency-domain optimality condition is proposed for achieving the desired pole assignment and determination of the corresponding quadratic performance index. This design method enables the retention of some stable open-loop poles and the associated eigenvectors in the closed-loop system. An illustrative example is provided to demonstrate the effectiveness of the proposed method.

Ganesan, Sekar↗
NASA NTRS1980

Modal methods in optimal control synthesis

Efficient algorithms for solving linear smoother-follower problems with quadratic criteria are presented. For time-invariant systems, the algorithm consists of one backward integration of a linear vector equation and one forward integration of another linear vector equation. Furthermore, the backward and forward Riccati matrices can be expressed in terms of the eigenvalues and eigenvectors of the Euler-Lagrange equations. Hence, the gains of the forward and backward Kalman-Bucy filters and of the optimal state-feedback regulator can be determined without integration of matrix Riccati equations. A computer program has been developed, based on this method of determining the gains, to synthesize the optimal time-invariant compensator in the presence of random disturbance inputs and random measurement errors. The program also computes the rms state and control variables of the optimal closed-loop system.

Bryson, A. E., Jr.↗