Results for “eigenvalue method” — Page 12

NASA NTRS1978

Use of asymptotic methods in vibration analysis

The derivation of dynamic differential equations, suitable for studying the vibrations of rotating, curved, slender structures was examined, and the Hamiltonian procedure was advocated for this purpose. Various reductions of the full system are displayed, which govern the vibrating troposkien when various order of magnitude restrictions are placed on important parameters. Possible advantages of the WKB asymptotic method for solving these classes of problems are discussed. A special case of this method is used illustratively to calculate eigenvalues and eigenfunctions for a flat turbine blade with small flexural stiffness.

Ashley, H.↗

NASA NTRS1984

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, K.↗

NASA NTRS1987

A new PNS code for chemical nonequilibrium flows

A new parabolized Navier-Stokes (PNS) code has been developed to compute the hypersonic laminar flow of a multicomponent, chemically reacting mixture of thermally perfect gases over two-dimensional and axisymmetric bodies. The new PNS code solves the gas dynamic and species conservation equations in a coupled manner using a noniterative, implicit, space-marching finite-difference method. The conditions for well-posedness of the space-marching method have been derived from an eigenvalue analysis of the governing equations. The code has been used to compute hypersonic laminar flow of chemically reacting air over wedges and cones. The results of these computations are in good agreement with the results of reacting boundary-layer calculations.

Prabhu, D. K.↗

NASA NTRS1987

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, Kazufumi↗

NASA NTRS1988

On the eigenvalue and eigenvector derivatives of a non-defective matrix

A novel approach is introduced to address the problem of existence of differentiable eigenvectors for a nondefective matrix which may have repeated eigenvalues. The existence of eigenvector derivatives for a unique set of continuous eigenvectors corresponding to a repeated eigenvalue is rigorously established for nondefective and analytic matrices. A numerically implementable method is then developed to compute the differentiable eigenvectors associated with repeated eigenvalues. The solutions of eigenvalue and eigenvector derivatives for repeated eigenvalues are then derived. An example is given to illustrate the validity of formulations developed in this paper.

Juang, Jer-Nan↗

NASA NTRS1991

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗

NASA NTRS1990

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 1

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and is not restricted to steps of length 2, as earlier implementations are. Also, our implementation has the feature that it requires roughly the same number of inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗

NASA NTRS1993

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. 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 signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗

NASA NTRS1989

An optimal momentum management controller for the Space Station

This paper presents a new sequential design procedure for determining an optimal CMG (control moment gyro) momentum management and attitude control system for the Space Station Freedom. First, the Space Station equations of motion are linearized and uncoupled, and the associated state space equations are defined. Next, a new sequential procedure is used for the development of a continuous quadratic regulator with eigenvalue placement in a specified region of the complex plane. The regional pole assignment method is utilized since it is best suited for tradeoffs between eigenvalue locations and robustness with respect to parameter variations, sensor failures, implementation accuracies and gain reductions. The matrix sign function is used for solving the Riccati equations which appear in the design procedure. Simulation results are given which show that the resultant design provides desired system performance.

Sunkel, J. W.↗

NASA NTRS1989

Modified Chebyshev pseudospectral method with O(N exp -1) time step restriction

The extreme eigenvalues of the Chebyshev pseudospectral differentiation operator are O(N exp 2) where N is the number of grid points. As a result of this, the allowable time step in an explicit time marching algorithm is O(N exp -2) which, in many cases, is much below the time step dictated by the physics of the partial differential equation. A new set of interpolating points is introduced such that the eigenvalues of the differentiation operator are O(N) and the allowable time step is O(N exp -1). The properties of the new algorithm are similar to those of the Fourier method. The new algorithm also provides a highly accurate solution for non-periodic boundary value problems.

Kosloff, Dan↗

NASA NTRS1986

A combined integrating and differentiating matrix formulation for boundary value problems on rectangular domains

Integrating and differentiating matrices allow the numerical integration and differential of functions whose values are known at points of a discrete grid. Previous derivations of these matrices were restricted to one dimensional grids or to rectangular grids with uniform spacing in at least one direction. Integrating and differentiating matrices were developed for grids with nonuniform spacing in both directions. The use of these matrices as operators to reformulate boundary value problems on rectangular domains as matrix problems for a finite dimensional solution vector is considered. The method requires nonuniform grids which include near boundary points. An eigenvalue problem for the transverse vibrations of a simply supported rectangular plate is solved to illustrate the method.

Lakin, W. D.↗

NASA NTRS1986

A combined integrating- and differentiating-matrix formulation for boundary-value problems on rectangular domains

Integrating and differentiating matrices allow the numerical integration and differential of functions whose values are known at points of a discrete grid. Previous derivations of these matrices were restricted to one dimensional grids or to rectangular grids with uniform spacing in at least one direction. Integrating and differentiating matrices were developed for grids with nonuniform spacing in both directions. The use of these matrices as operators to reformulate boundary value problems on rectangular domains as matrix problems for a finite dimensional solution vector is considered. The method requires nonuniform grids which include near boundary points. An eigenvalue problem for the transverse vibrations of a simply supported rectangular plate is solved to illustrate the method.

Lakin, W. D.↗

NASA NTRS1978

A method of weighted residuals with trigonometric basis functions for sound transmission in circular ducts

The method of weighted residuals (MWR) in the form of a modified Galerkin method with trigonometric basis functions is used to compute the transmission of sound in an axisymmetric duct. The method is used to generate the axial wave number for uniform ducts. These are compared with exact solutions generated by a formal eigenvalue routine in the hard-wall case and a Runge-Kutta integration eigenvalue scheme in the soft-wall case. The method is applicable to both flow and no-flow cases.

Vo, P. T.↗

NASA NTRS1967

Integrating Matrix Method for Determining the Natural Vibrations of a Rotating, Unsymmetrical Beam with Application to Twisted Propeller Blades

A numerical method is Presented for determining the natural vibration frequencies, and the corresponding mode shapes, of a rotating cantilever beam which has a nonuniform, unsymmetrical cross section. Two coupled fourth-order differential equations of motion with variable coefficients are derived which govern the motion of such a beam having deformations in two directions. Through the development and utilization of the integrating matrix, the solution of the differential equations is obtained in the form of an eigenvalue problem. The solutions to the eigenvalue problem are determined by an iteration method based upon a special orthogonality relationship which is derived. Numerical examples, including an application to a twisted propeller blade, are presented with the results of the integrating matrix solutions being compared to exact solutions and experimental data.

Hunter, William F.↗

NASA NTRS2024

A Systematic Methodology for Modeling and Attitude Control of Multi-body Space Telescopes

This paper derives a symbolic multi-body rigid nonlinear model for a space telescope using Stoneking’s implementation of Kane’s method. This symbolic nonlinear model is linearized using Matlab symbolic functions diff and inv because the analytic linearization is intractable for manual derivation. The linearized system model is then used to design the controllers using both linear quadratic regulator (LQR) and robust pole assignment methods. The closed-loop systems for the two designs are simulated using both the rigid model as well as a second model containing flexible modes. The performances of the two designs are compared based on the simulation testing results. Our conclusion is that the robust pole assignment design offers better performance than that of the LQR system in terms of actuator usage and pointing accuracy. However, the LQR approach remains an effective first design step that can inform the selection of real eigenvalues for robust pole assignment. The proposed method may be used for the modeling and controller designs for various multi-body systems.

Modeling↗

NASA NTRS1985

Convergence acceleration of iterative solutions of Euler equations for transonic flow computations

In this paper, two acceleration techniques for Euler calculations are investigated. The first technique is an extrapolation procedure based on the Power Method; it is applicable when the iterative matrix has dominant eigenvalues. Both real and complex conjugate roots are allowed. The second technique is a generalization of the Minimal Residual Method, where the extrapolation step consists of a weighted combination of the corrections at different iteration levels and the weights are chosen to minimize the Lz norm of the residual. Numerical results, using Jameson's Runge-Kutta Multigrid Code, are presented. The extra computational work to apply either technique is negligible and the extra storage is not a problem on current supercomputers.

Hafez, M.↗

NASA NTRS1990

Numerical simulation of spatially-evolving instability

A computational study of the spatial stability of plane Poiseuille flow is presented. The numerical scheme employs a time-splitting method to integrate the full Navier-Stokes equations using spectral collocation/finite-difference discretization on a non-staggered mesh. The eigenvalue decomposition procedure is applied for the solution of the Poisson equations using the capacitance matrix technique. The buffer domain method is incorporated for the outflow boundary conditions. The input perturbation velocities are obtained by solving the Orr-Sommerfeld equation for the nonlinear eigenvalue problem employing the companion matrix method. Computational results are compared with the linear theory for two-dimensional disturbances.

Danabasoglu, G.↗

NASA NTRS1993

A modified Chebyshev pseudospectral method with an O(N exp -1) time step restriction

The extreme eigenvalues of the Chebyshev pseudospectral differentiation operator are O(N exp 2) where N is the number of grid points. As a result of this, the allowable time step in an explicit time marching algorithm is O(N exp -2) which, in many cases, is much below the time step dictated by the physics of the partial differential equation. A new set of interpolating points is introduced such that the eigenvalues of the differentiation operator are O(N) and the allowable time step is O(N exp -1). The properties of the new algorithm are similar to those of the Fourier method. The new algorithm also provides a highly accurate solution for non-periodic boundary value problems.

Kosloff, Dan↗