Julia sets in iterative KAM methods for eigenvalue problems
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.
- An approximate renormalization for the break-up of invariant tori with three frequencies
- Anderson localization for one-dimensional difference Schrödinger operator with quasiperiodic potential
- Floquet solutions for the 1-dimensional quasi-periodic Schrödinger equation
- Floquet spectrum for two-level systems in quasiperiodic time-dependent fields
- scientific article; zbMATH DE number 3601149 (Why is no real title available?)
- scientific article; zbMATH DE number 522122 (Why is no real title available?)
- scientific article; zbMATH DE number 967388 (Why is no real title available?)
- scientific article; zbMATH DE number 3090395 (Why is no real title available?)
- Stable and Random Motions in Dynamical Systems
- The quantum stability problem for some class of time-dependent Hamiltonians
This page was built for publication: Julia sets in iterative KAM methods for eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125066)