Structure of positive decompositions of exponential operators
- 12 January 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 71 (1), 016703
- https://doi.org/10.1103/physreve.71.016703
Abstract
The solution of many physical evolution equations can be expressed as an exponential of two or more operators acting on initial data. Accurate solutions can be systematically derived by decomposing the exponential in a product form. For time-reversible equations, such as the Hamilton or the Schrödinger equation, it is immaterial whether or not the decomposition coefficients are positive. In fact, most symplectic algorithms for solving classical dynamics contain some negative coefficients. For time-irreversible systems, such as the Fokker-Planck equation or the quantum statistical propagator, only positive-coefficient decompositions, which respect the time-irreversibility of the diffusion kernel, can yield practical algorithms. These positive time steps only, forward decompositions, are a highly effective class of factorization algorithms. This work presents a framework for understanding the structure of these algorithms. By a suitable representation of the factorization coefficients, we show that specific error terms and order conditions can be solved analytically. Using this framework, we can go beyond the Sheng-Suzuki theorem and derive a lower bound for the error coefficient . By generalizing the framework perturbatively, we can further prove that it is not possible to have a sixth-order forward algorithm by including only the commutator . The pattern of these higher-order forward algorithms is that in going from the to the order, one must include a different commutator in the decomposition process.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Quantum statistical calculations and symplectic corrector algorithmsPhysical Review E, 2004
- Short-time-evolved wave functions for solving quantum many-body problemsPhysical Review B, 2003
- Symplectic analytically integrable decomposition algorithms: classification, derivation, and application to molecular dynamics, quantum and celestial mechanics simulationsComputer Physics Communications, 2003
- Splitting methodsActa Numerica, 2002
- A fourth-order real-space algorithm for solving local Schrödinger equationsThe Journal of Chemical Physics, 2001
- A three-dimensional fourth-order finite-difference time-domain scheme using a symplectic integrator propagatorIEEE Transactions on Microwave Theory and Techniques, 2001
- Fourth-order diffusion Monte Carlo algorithms for solving quantum many-body problemsPhysical Review B, 2001
- Fourth-order algorithms for solving the multivariable Langevin equation and the Kramers equationPhysical Review E, 2000
- Hybrid exponential product formulas for unbounded operators with possible applications to Monte Carlo simulationsPhysics Letters A, 1995
- Solution of the Schrödinger equation by a spectral methodJournal of Computational Physics, 1982