Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices (Q1614973)

From MaRDI portal





scientific article; zbMATH DE number 1798912
Language Label Description Also known as
default for all languages
No label defined
    English
    Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
    scientific article; zbMATH DE number 1798912

      Statements

      Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices (English)
      0 references
      0 references
      0 references
      10 September 2002
      0 references
      The paper is devoted to the study of two descent iterative methods, the generalized damped Newton method and the generalized damped Gauss-Newton method, both based on line search and designed to improve an approximate eigenvalue and the corresponding approximate eigenvector of polynomial eigenvalue problems with general complex matrices. To this end, it is supposed that an approximate eigenpair, obtained by a certain method, is available. Convergence theorems, without rate of convergence results, as well as numerical examples, are given. Finally, some empirical rate of convergence results are also mentioned.
      0 references
      polynomial eigenvalue problem
      0 references
      descent iteration
      0 references
      generalized damped Newton method
      0 references
      generalized damped Gauss-Newton method
      0 references
      convergence
      0 references
      numerical examples
      0 references

      Identifiers