From Quantum to Classical Molecular Dynamics: Reduced Models and Numerical Analysis
The DOI matches its Crossref record; 68 of the 69 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For this type of differential equation consisting of a sum of integrable parts, it is very natural to use a Lie-Trotter splitting approach [16,29,30], where one evolves according to each integrable part for a small time t.”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [29]
In the citing paper
“As explained in Ref. [29], this source of error can be bound in terms of ( 1 -PT | [A] M MPS ) Ĥ | [A] , a quantity that can easily be evaluated [33] and monitored throughout the evolution.”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [29]
Citations
Cites
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Quantal phase factors accompanying adiabatic changes
Berry, M. V. (1984) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1984.0023 · Cited by 9,252
Methods of Modern Mathematical Physics
(1972) · Elsevier eBooks · doi:10.1016/b978-0-12-585001-8.x5001-6 · Cited by 8,883
The Principles of Quantum Mechanics
Dirac, P. A. M., & Polkinghorne, J. C. (1958) · Physics Today · doi:10.1063/1.3062610 · Cited by 5,409
Smoothed Particle Hydrodynamics
Monaghan, J. J. (1992) · Annual Review of Astronomy and Astrophysics · doi:10.1146/annurev.aa.30.090192.002551 · Cited by 4,957
Trefethen, L. N. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719598 · Cited by 4,458
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
On the Construction and Comparison of Difference Schemes
Strang, G. (1968) · SIAM Journal on Numerical Analysis · doi:10.1137/0705041 · Cited by 3,571
Note on Exchange Phenomena in the Thomas Atom
Dirac, P. A. M. (1930) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100016108 · Cited by 3,302
Cited by
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
“An efficient representation of a tensor (by tensor we mean only an array with d indices) by a small number of parameters may give us an opportunity and ability to work with d-dimensional problems, with d being as high as 10, 100, or even 1000 (such problems appear in quantum molecular dynamics [28, 40, 27], stochastic…”
BackgroundInverse problems: A Bayesian perspective
Stuart, A. M. (2010) · Acta Numerica · doi:10.1017/s0962492910000061 · Cited by 1,791
“A different area where tensor products are used to form approximations of functions of many variables is computational quantum mechanics and approximation of the Schrödinger equation (Lubich 2008); this work may also be seen in the more general context of tensor product approximations in linear algebra (Kolda and Bade…”
BackgroundHochbruck, M., & Ostermann, A. (2010) · Acta Numerica · doi:10.1017/s0962492910000048 · Cited by 1,061
Unifying time evolution and optimization with matrix product states
Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B., & Verstraete, F. (2016) · Physical Review B · doi:10.1103/physrevb.94.165116 · Cited by 804
“[29], this source of error can be bound in terms of”
BackgroundMethodSelf-citationA literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
“The efficient and robust numerical integration of (12) is crucial to the success of dynamical low-rank methods; apart from the references above, this aspect has been discussed in [184,185].”
Metadata
- Authors
- Lubich, C.
- Affiliations
- University of Tübingen (DE)
- Corresponding author
- Lubich, Christian
- ORCID
- Lubich, Christian
- Venue
- Zurich Lectures in Advanced Mathematics
- Publisher
- EMS Press
- Published
- 2008-09-24
- ISSN
- 2943-4963 (ISSN-L)
- 2943-4971
- DOI
- 10.4171/067
- OpenAlex
- W1515678755
- Cited by
- 366
- References
- 69
- Citations by year
- 2026: 8 · 2025: 29 · 2024: 19 · 2023: 15 · 2022: 14 · 2021: 28 · 2020: 32 · 2019: 19 · 2018: 25 · 2017: 15 · 2016: 20 · 2015: 25 · 2014: 26 · 2013: 23 · 2012: 15
- FWCI
- 1.93
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Zurich lectures in advanced mathematics (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Model Reduction and Neural Networks
- Physical Sciences › Mathematics › Applied Mathematics › Advanced Mathematical Modeling in Engineering
- Keywords
- quantum molecular dynamics, classical molecular dynamics, simplified model, semiclassical approximation, quantum-classical correspondence
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.