✦ LIBER ✦

A general reduction scheme for the time-dependent Born–Oppenheimer approximation

✍ Scribed by André Martinez; Vania Sordoni

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 61 KB
Volume: 334
Category: Article
ISSN: 1631-073X
DOI: 10.1016/s1631-073x(02)02212-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The infinite time limit for the time-dep

The infinite time limit for the time-dependent Born-Oppenheimer approximation

✍ Armin Kargol 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 833 KB

The breakdown of the Born-Oppenheimer ap

The breakdown of the Born-Oppenheimer approximation for a diatomic molecule: The dipole moment and nuclear quadrupole coupling constants

✍ P.R. Bunker 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 494 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views

An approximate method for scattering in

An approximate method for scattering in elastodynamics — The born approximation I: the general formulation

✍ L.L. Chu; A. Askar; A.S. Cakmak 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 664 KB

The effect of the breakdown of the Born-

The effect of the breakdown of the Born-Oppenheimer approximation on the determination of Be and ωe for a diatomic molecule

✍ P.R. Bunker 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 474 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| • |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves