Julia sets in iterative KAM methods for eigenvalue problems (Q1125066)

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 1371613
Language Label Description Also known as
default for all languages
No label defined
    English
    Julia sets in iterative KAM methods for eigenvalue problems
    scientific article; zbMATH DE number 1371613

      Statements

      Julia sets in iterative KAM methods for eigenvalue problems (English)
      0 references
      0 references
      9 April 2000
      0 references
      The authors present two versions of the KAM algorithm for quantum mechanics, which is based on the two iterative KAM methods for eigenvalue problems. The authors discuss the convergence of these iterations for 2, 3 and \(n\)-dimensional symmetric matrices with arbitrarily large perturbations. Note that the proofs of convergence of KAM methods are based on proving the contractivity of the map with respect to some norm. The presence of Julia sets and non monotonic behaviour are obstacles for proving the convergence in all regions where the iteration converges. The Julia set, on which the iteration does not converge depends on the choice of unitary transformation. The authors observe different domains separated by Julia sets related to avoided crossings.
      0 references
      convergence
      0 references
      KAM algorithm
      0 references
      eigenvalue problems
      0 references
      Julia sets
      0 references

      Identifiers