Numerical solution of a quadratic eigenvalue problem (Q5916489)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2083522
Language Label Description Also known as
default for all languages
No label defined
    English
    Numerical solution of a quadratic eigenvalue problem
    scientific article; zbMATH DE number 2083522

      Statements

      Numerical solution of a quadratic eigenvalue problem (English)
      0 references
      0 references
      6 August 2004
      0 references
      The main purpose of the author is to identify a class of quadratic eigenvalue problems (QEP's), for which the use of solvent approach is really successful. The considered special case is \((\lambda ^{2}M+\lambda G+K)x=0\), where \(M=M^{T}\) is positive definite, \(K=K^{T}\) is negative definite and \(G=-G^{T}\). An algorithm is presented which preserves the Hamiltonian structure of the spectrum of the QEP. In the case when \(2(M-K)\) is not ill-conditioned, the algorithm reveals very efficient and exhibits a very good accuracy for all the eigenvalues, except those with very large modulus. Interesting numerical examples enlighten the features of the presented method.
      0 references
      quadratic eigenvalue problem
      0 references
      quadratic matrix equation
      0 references
      Solvent
      0 references
      cyclic reduction
      0 references
      algorithm
      0 references
      Hamiltonian structure
      0 references
      numerical example
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers