A comparison of algorithms for the normalization and quantization of polynomial Hamiltonians
DOI10.1023/B:PACS.0000021264.38623.52zbMATH Open1124.81300OpenAlexW2032595104MaRDI QIDQ557516FDOQ557516
Yoshio Uwano, N. A. Chekanov, S. I. Vinitsky, V. A. Rostovtsev, A. A. Gusev
Publication date: 30 June 2005
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:pacs.0000021264.38623.52
Symbolic computation and algebraic computation (68W30) Computational methods for problems pertaining to quantum theory (81-08) General mathematical topics and methods in quantum theory (81Q99) Software, source code, etc. for problems pertaining to quantum theory (81-04)
Cited In (8)
- Title not available (Why is that?)
- Symbolic algorithm for factorization of the evolution operator of the time-dependent Schrödinger equation
- Nikolai Yegorovich Zhukovskii
- A Universal Procedure for Normalizingn-Degree-of-Freedom Polynomial Hamiltonian Systems
- Comparison of polynomial approximations to speed up planewave-based quantum Monte Carlo calculations
- A symbolic-numerical algorithm for the computation of matrix elements in the parametric eigenvalue problem
- Computer normalization of Hamiltonian systems in analytic form
- A REDUCE program for the normalization of polynomial Hamiltonians
Uses Software
Recommendations
- Algorithms for normalization of Hamiltonian systems by means of computer algebra 👍 👎
- Computer normalization of Hamiltonian systems in analytic form 👍 👎
- A Universal Procedure for Normalizingn-Degree-of-Freedom Polynomial Hamiltonian Systems 👍 👎
- Title not available (Why is that?) 👍 👎
- A new algorithm for Birkhoff normalization of Hamiltonian systems 👍 👎
This page was built for publication: A comparison of algorithms for the normalization and quantization of polynomial Hamiltonians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557516)
