Refine
Year of publication
Document Type
- ZIB-Report (24)
- Article (8)
- Book (3)
- In Proceedings (2)
- Habilitation (1)
Language
- English (38)
Is part of the Bibliography
- no (38)
Keywords
Institute
- ZIB Allgemein (25)
- Numerical Mathematics (5)
The Car-Parrinello (CP) approach to ab initio molecular dynamics serves as an approximation to time-dependent Born-Oppenheimer (BO) calculations. It replaces the explicit minimization of the energy functional by a fictitious Newtonian dynamics and therefore introduces an artificial mass parameter $\mu$ which controls the electronic motion. A recent theoretical investigation shows that the CP-error, i.e., the deviation of the CP--solution from the BO-solution {\em decreases} like $\mu^{1/2}$ asymptotically. Since the computational effort {\em increases} like $\mu^{-1/2}$, the choice of $\mu$ has to find a compromise between efficiency and accuracy. The asymptotical result is used in this paper to construct an easily implemented algorithm which automatically controls $\mu$: the parameter $\mu$ is repeatedly adapted during the simulation by choosing $\mu$ as large as possible while pushing an error measure below a user-given tolerance. The performance and reliability of the algorithm is illustrated by a typical example.
Using the full multigrid method {\em without} any coarse grid correction steps but with an a posteriori control of the number of smoothing iterations was shown by Bornemann and Deuflhard [1996] to be an optimal iteration method with respect to the energy norm. They named this new kind of multigrid iteration the {\em cascadic multigrid method}. However, numerical examples with {\em linear} finite elements raised serious doubts whether the cascadic multigrid method can be made optimal with respect to the {\em $L^2$-norm}. In this paper we prove that the cascadic multigrid method cannot be optimal for linear finite elements and show that the case might be different for higher order elements. We present a careful analysis of the two grid variant of the cascadic multigrid method providing a setting where one can understand the methodical difference between the cascadic multigrid method and the classical multigrid $V$-cycle almost immediately. As a rule of thumb we get that whenever the cascadic multigrid works the classical multigrid will work too but not vice versa.
