A practical algorithm for the efficient computation of eigenvector sensitivities

DOI10.1016/0045-7825(95)00929-9MaRDI QIDQ2564567zbMATH OpenOpenAlexFDO

Authors R. M. Lin, Z. Wang, M. K. Lim

Publication date 26 May 1997

Published in Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7825(95)00929-9

zbMATH Keywords

generalized symmetric eigenvalue problemsinverse iteration techniquesingular value decomposition theory

Mathematics Subject Classification ID

Vibrations in dynamical problems in solid mechanics (74H45) Finite element methods applied to problems in solid mechanics (74S05)

Review text

A practical algorithm has been developed for efficiently computing eigenvector derivatives of generalized symmetric eigenvalue problems. For eigenvector derivative of a separate mode, the computation only requires the knowledge of eigenvalue and eigenvector of the mode itself and an inverse of system matrix accounts for most computation cost involved. In the case of two close modes, the modal information of both modes is required and the eigenvector derivatives can be accurately determined simultaneously at minor additional computational cost. By combining the proposed algorithm together with the proposed inverse iteration technique and singular value decomposition theory, eigenproperties and their derivatives can be very efficiently computed. Numerical results from a practical finite element model have demonstrated the practicality of the proposed method.

Recommendations

• A method for selective computation of eigenvectors of matrices and its practical applications
• On sensitivity of eigenvalues and eigendecompositions of matrices
• Sensitivity analysis for the multivariate eigenvalue problem
• Robust eigenspace assignment using singular value sensitivities
• The sensitivity of eigenvalues under elementary matrix perturbations
• A rank-1 matrix formula applied to eigenvalue sensitivities
• Eigenvector sensitivity under general and structured perturbations of tridiagonal Toeplitz-type matrices.
• Stochastic sensitivity analysis of eigenvalues and eigenvectors
• Fast eigenvalue sensitivity calculations for special structures of system matrix derivatives
• scientific article; zbMATH DE number 1329145

Cites work

• Calculation of Eigenvalue and Eigenvector Derivatives for Algebraic Flutter and Divergence Eigenproblems
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
• On eigenvalues of matrices dependent on a parameter
• On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
• Rates of change of eigenvalues and eigenvectors.
• Re-examination of eigenvector derivatives
• Reanalysis procedure for large structural systems
• Simplified calculation of eigenvector derivatives

Cited in

(6)

• Sensitivity eigenanalysis for single shift-invariant subspace-based methods.
• Review of options for structural design sensitivity analysis. I: Linear systems
• An efficient algebraic method for the computation of natural frequency and mode shape sensitivities—Part I. Distinct natural frequencies
• Highly efficient general method for sensitivity analysis of eigenvectors with repeated eigenvalues without passing through adjacent eigenvectors
• An Efficient Eigen-Solver and Some of Its Applications
• Optimal design of piezoelectric modal transducers

This page was built for publication: A practical algorithm for the efficient computation of eigenvector sensitivities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564567)