Strong semismoothness of eigenvalues of symmetric matrices and its application to inverse eigenvalue problems

10.1137/S0036142901393814SIAM Journal on Numerical Analysis4062352-2367SJNA

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

An improved Newton iteration for the generalized inverse of a matrix, with applications

The purpose here is to clarify and illustrate the potential for the use of variants of Newton's method of solving problems of practical interest on highly personal computers. The authors show how to accelerate the method substantially and how to modify it successfully to cope with ill-conditioned matrices. The authors conclude that Newton's method can be of value for some interesting computations, especially in parallel and other computing environments in which matrix products are especially easy to work with

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

Stability analysis for laminar flow control, part 1

The basic equations for the stability analysis of flow over three dimensional swept wings are developed and numerical methods for their solution are surveyed. The equations for nonlinear stability analysis of three dimensional disturbances in compressible, three dimensional, nonparallel flows are given. Efficient and accurate numerical methods for the solution of the equations of stability theory were surveyed and analyzed

Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems : part I

In this paper we will show how the Jacobi-Davidson iterative method can be used to solve generalized eigenproblems. Similar ideas as for the standard eigenproblem are used, but the projections, that are required to reduce the given problem to a small manageable size, need more attention. We show that by proper choices for the projection operators quadratic convergence can be achieved. The advantage of our approach is that none of the involved operators needs to be inverted. It turns out that similar projections can be used for the iterative approximation of selected eigenvalues and eigenvectors of polynomial eigenvalue equations. This approach has already been used with great success for the solution of quadratic eigenproblems associated with acoustic problems

Methods of applied dynamics

The monograph was prepared to give the practicing engineer a clear understanding of dynamics with special consideration given to the dynamic analysis of aerospace systems. It is conceived to be both a desk-top reference and a refresher for aerospace engineers in government and industry. It could also be used as a supplement to standard texts for in-house training courses on the subject. Beginning with the basic concepts of kinematics and dynamics, the discussion proceeds to treat the dynamics of a system of particles. Both classical and modern formulations of the Lagrange equations, including constraints, are discussed and applied to the dynamic modeling of aerospace structures using the modal synthesis technique

On acceleration of Krylov-subspace-based Newton and Arnoldi iterations for incompressible CFD: replacing time steppers and generation of initial guess

We propose two techniques aimed at improving the convergence rate of steady state and eigenvalue solvers preconditioned by the inverse Stokes operator and realized via time-stepping. First, we suggest a generalization of the Stokes operator so that the resulting preconditioner operator depends on several parameters and whose action preserves zero divergence and boundary conditions. The parameters can be tuned for each problem to speed up the convergence of a Krylov-subspace-based linear algebra solver. This operator can be inverted by the Uzawa-like algorithm, and does not need a time-stepping. Second, we propose to generate an initial guess of steady flow, leading eigenvalue and eigenvector using orthogonal projection on a divergence-free basis satisfying all boundary conditions. The approach, including the two proposed techniques, is illustrated on the solution of the linear stability problem for laterally heated square and cubic cavities