Search NASA⌕ Search

SEARCH · Search NASA

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 91 records · Page 5

Solution and sensitivity analysis of a complex transcendental eigenproblem with pairs of real eigenvalues

This paper considers complex transcendental eigenvalue problems where one is interested in pairs of eigenvalues that are restricted to take real values only. Such eigenvalue problems arise in dynamic stability analysis of nonconservative physical systems, i.e., flutter analysis of aeroelastic systems. Some available solution methods are discussed and a new method is presented. Two computational approaches are described for analytical evaluation of the sensitivities of these eigenvalues when they are dependent on other parameters. The algorithms presented are illustrated through examples.

Murthy, Durbha V.↗

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗

Elimination of spurious eigenvalues in the Chebyshev tau spectral method

Spectral methods have been used to great advantage in hydrodynamic stability calculations; the concepts are described in Orszag's seminal application of the Chebyshev tau method to the Orr-Sommerfeld equation for plane Poiseuille flow in 1971. Orszag discusses both the Chebyshev Galerkin and the Chebyshev tau methods, but presents results for the tau method, which is easier to implement than the Galerkin method. The tau method has the disadvantage that two unstable eigenvalues are produced that are artifacts of the discretization. An extremely simple modification to the Chebyshev tau method is presented which eliminates the spurious eigenvalues. First a simplified model of the Orr-Sommerfeld equation discussed by Gottlieb and Orszag was studied. Then the Chebyshev tau method is considered, which has two spurious eigenvalues, and then a modification which eliminates them is described. Finally, results for the Orr-Sommerfeld equation are considered where the modified tau method also eliminates the spurious eigenvalues. The simplicity of the modification makes it a convenient alternative to other approaches to the problem.

Mcfadden, G. B.↗

An Eigenvalue Analysis of finite-difference approximations for hyperbolic IBVPs

The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L(sub 2) stability on a finite domain.

Warming, Robert F.↗

Solution and sensitivity analysis of a complex transcendental eigenproblem with pairs of real eigenvalues

This paper considers complex transcendental eigenvalue problems where one is interested in pairs of eigenvalues that are restricted to take real values only. Such eigenvalue problems arise in dynamic stability analysis of nonconservative physical systems, i.e., flutter analysis of aeroelastic systems. Some available solution methods are discussed and a new method is presented. Two computational approaches are described for analytical evaluation of the sensitivities of these eigenvalues when they are dependent on other parameters. The algorithms presented are illustrated through examples.

Murthy, D. V.↗

An eigenvalue analysis of finite-difference approximations for hyperbolic IBVPs

The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L (sub 2) stability on a finite domain.

Warming, Robert F.↗

Improved procedures for eigenvalue approximation and sensitivities for active structures

The equations of motion of actively controlled structures are usually reduced to first order form, a procedure which obscures symmetries that are present in the second order form of these equations. The loss of symmetry requires the calculation of both left and right eigenvectors for obtaining derivatives of the stability eigenvalues of the system. The paper shows that, for some control laws, only right eigenvectors are required if derivatives are obtained from the second order form of the equations of motion. The paper also examines reduced basis approximations for the eigenvalues and their derivatives. It is shown that including Ritz vectors representing the effect of local actuation forces in the reduced basis improves the accuracy of the eigenvalues and eigenvalue derivatives. Two active truss examples are used for demonstrating the improved accuracy.

Ponslet, Eric↗

Eigenvalue error analysis of viscously damped structures using a Ritz reduction method

The efficient solution of the eigenvalue problem that results from inserting passive dampers with variable stiffness and damping coefficients into a structure is addressed. Eigenanalysis of reduced models obtained by retaining a number of normal modes augmented with Ritz vectors corresponding to the static solutions resulting from the load patterns introduced by the dampers has been empirically shown to yield excellent approximations to the full eigenvalue problem. An analysis of this technique in the case of a single damper is presented. A priori and a posteriori error estimates are generated and tested on numerical examples. Comparison theorems with modally truncated models and a Markov parameter matching reduced-order model are derived. These theorems corroborate the heuristic that residual flexibility methods improve low-frequency approximation of the system. The analysis leads to other techniques for eigenvalue approximation. Approximate closed-form solutions are derived that include a refinement to eigenvalue derivative methods for approximation. An efficient Newton scheme is also developed. A numerical example is presented demonstrating the effectiveness of each of these methods.

Chu, Cheng-Chih↗

The algebraic multigrid projection for eigenvalue problems; backrotations and multigrid fixed points

The periods of the theorem for the algebraic multigrid projection (MGP) for eigenvalue problems, and of the multigrid fixed point theorem for multigrid cycles combining MGP with backrotations, are presented. The MGP and the backrotations are central eigenvector separation techniques for multigrid eigenvalue algorithms. They allow computation on coarse levels of eigenvalues of a given eigenvalue problem, and are efficient tools in the computation of eigenvectors.

Costiner, Sorin↗

Efficient eigenvalue assignment by state and output feedback with applications for large space structures

The erection and deployment of large flexible structures having thousands of degrees of freedom requires controllers based on new techniques of eigenvalue assignment that are computationally stable and more efficient. Scientists at NASA Langley Research Center have developed a novel and efficient algorithm for the eigenvalue assignment of large, time-invariant systems using full-state and output feedback. The objectives of this research were to improve upon the output feedback version of this algorithm, to produce a toolbox of MATLAB functions based on the efficient eigenvalue assignment algorithm, and to experimentally verify the algorithm and software by implementing controllers designed using the MATLAB toolbox on the phase 2 configuration of NASA Langley's controls-structures interaction evolutionary model, a laboratory model used to study space structures. Results from laboratory tests and computer simulations show that effective controllers can be designed using software based on the efficient eigenvalue assignment algorithm.

Vannell, Eric C.↗

Subspace Iteration Method for Complex Eigenvalue Problems with Nonsymmetric Matrices in Aeroelastic System

Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability known as flutter. ATW was a small-scale airplane wing comprised of an airfoil and wing tip boom. This wing was formulated based on a NACA-65A004 airfoil shape with a 3.28 aspect ratio. The wing had a span of 18 inch with root chord length of 13.2 inch and tip chord length of 8.7 inch. The total area of this wing was 197 square inch. The wing tip boom was a 1 inch diameter hollow tube of length 21.5 inch. The total weight of the wing was 2.66 lbs.

Pak, Chan-gi↗

Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

43 PARTICLE ACCELERATORS↗

Determining Importance Weighting Functions for Contributon Theory Eigenvalue Sensitivity Coefficient Methodologies

This study introduced three approaches for calculating the importance weighting function for Contributon and CLUTCH eigenvalue sensitivity coefficient calculations, and compared them in terms of accuracy and applicability. The necessary levels of mesh refinement and mesh convergence for obtaining accurate eigenvalue sensitivity coefficients were determined through two parametric studies, and the results of these studies suggest that a sufficiently-accurate mesh for calculating eigenvalue sensitivity coefficients can be obtained for the Contributon and CLUTCH methods with only a small increase in problem runtime.

99 GENERAL AND MISCELLANEOUS↗

A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems

We consider the nonlinear eigenvalue problem M ( λ ) x = 0, where M ( λ ) is a large parameter-dependent matrix. In several applications, M ( λ ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi-based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi's method applied to an operator whose reciprocal eigenvalues are solutions to the nonlinear eigenvalue problem. The iterates in the algorithm are functions represented in a particular structured vector-valued polynomial basis similar to the construction in the infinite Arnoldi method [Jarlebring, Michiels, and Meerbergen, Numer. Math., 122 (2012), pp. 169–195]. In this paper, the low-rank structure is exploited by applying an additional operator and by using a more compact representation of the functions. This reduces the computational cost associated with orthogonalization, as well as the required memory resources. The structure exploitation also provides a natural way in carrying out implicit restarting and locking without the need to impose structure in every restart. In conclusion, the efficiency and properties of the algorithm are illustrated with two large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Asymptotic Representation for the Eigenvalues of a Non-selfadjoint Operator Governing the Dynamics of an Energy Harvesting Model

We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations are coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On optimizing Jacobi–Davidson method for calculating eigenvalues in low dimensional structures using eight band k · p model

The paper presents two ways of improving the Jacobi–Davidson method for calculating the eigenvalues and eigenvectors described by eight-band k · p model for quantum dots and other low dimensional structures. First, the method is extended by the application of time reversal symmetry operator. This extension allows efficient calculations of the twofold degeneracy present in the multiband k · p model and other interior eigenvalues. Second, the preconditioner for the indefinite matrix which comes from the discretization of the eight band k · p Hamiltonian is presented. The construction of this preconditioner is based on physical considerations about energy band structure in the k · p model. On the basis of two real examples, it is shown that the preconditioner can significantly shorten the time needed to calculate the interior eigenvalues, despite the fact that the memory usage of the preconditioner and Hamiltionian is comparable. Finally, some technical details for implementing the eight band k · p Hamiltonian and the eigensolver are provided.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The nonconforming Virtual Element Method for eigenvalue problems

In this work, we analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allows to treat in the same formulation the two- and three-dimensional case. We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the $L^2$-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problem. The proposed schemes provide a correct approximation of the spectrum, in particular we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗