Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Symplectic maps for approximating polynomial Hamiltonian systems.

Sergio Blanes1

  • 1Department of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, United Kingdom. sblanes@mat.uji.es

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|June 13, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Propagators for Quantum-Classical Models: Commutator-Free Magnus Methods.

Journal of chemical theory and computation·2020
Same author

Exponential propagators for the Schrödinger equation with a time-dependent potential.

The Journal of chemical physics·2018
Same author

Symplectic time-average propagators for the Schrödinger equation with a time-dependent Hamiltonian.

The Journal of chemical physics·2017
Same author

Solving the Schrödinger eigenvalue problem by the imaginary time propagation technique using splitting methods with complex coefficients.

The Journal of chemical physics·2013
Same author

Fourier methods for the perturbed harmonic oscillator in linear and nonlinear Schrödinger equations.

Physical review. E, Statistical, nonlinear, and soft matter physics·2011
Same author

Symplectic splitting operator methods for the time-dependent Schrodinger equation.

The Journal of chemical physics·2006

This study introduces efficient methods for approximating polynomial Hamiltonian systems using symplectic maps. We present a novel approach to find separable terms, enhancing accuracy without increasing computational cost.

Area of Science:

  • Numerical analysis
  • Computational physics
  • Symplectic geometry

Background:

  • Approximating polynomial Hamiltonian systems is crucial for computational physics.
  • Existing symplectic map composition methods are often computationally expensive or lack accuracy.
  • Polynomial Hamiltonians offer separability into exactly solvable components.

Purpose of the Study:

  • To develop computationally efficient and accurate methods for approximating polynomial Hamiltonian systems.
  • To identify optimal separations of polynomial Hamiltonians into easily computable terms.
  • To provide guidance on parameter selection for enhanced accuracy without increased computational cost.

Main Methods:

  • Composition of symplectic maps for approximation.

Related Experiment Videos

  • Identifying separable terms within polynomial Hamiltonians.
  • Parameter optimization for accuracy improvement.

    • Main Results:

    • A novel method for finding Hamiltonian separations into a minimal number of terms.
    • Demonstration of improved accuracy through strategic parameter selection.
    • Achieved balance between computational cost and accuracy.

    Conclusions:

    • The proposed methods offer a more efficient and accurate approach to approximating polynomial Hamiltonian systems.
    • The technique of finding specific Hamiltonian separations is key to improving numerical methods.
    • Parameter tuning provides a viable strategy for enhancing accuracy without compromising computational efficiency.