A practical algorithm for the efficient computation of eigenvector sensitivities (Q2564567)

From MaRDI portal





scientific article; zbMATH DE number 966782
Language Label Description Also known as
default for all languages
No label defined
    English
    A practical algorithm for the efficient computation of eigenvector sensitivities
    scientific article; zbMATH DE number 966782

      Statements

      A practical algorithm for the efficient computation of eigenvector sensitivities (English)
      0 references
      0 references
      0 references
      0 references
      26 May 1997
      0 references
      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.
      0 references
      generalized symmetric eigenvalue problems
      0 references
      inverse iteration technique
      0 references
      singular value decomposition theory
      0 references

      Identifiers