| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Kieri, Emil, et al.
(author)
-
Coupling of Gaussian Beam and Finite Difference Solvers for Semiclassical Schrodinger Equations
- 2015
-
In: Advances in Applied Mathematics and Mechanics. - : Global Science Press. - 2070-0733 .- 2075-1354. ; 7:6, s. 687-714
-
Journal article (peer-reviewed)abstract
- In the semiclassical regime, solutions to the time-dependent Schrodinger equation for molecular dynamics are highly oscillatory. The number of grid points required for resolving the oscillations may become very large even for simple model problems, making solution on a grid intractable. Asymptotic methods like Gaussian beams can resolve the oscillations with little effort and yield good approximations when the atomic nuclei are heavy and the potential is smooth. However, when the potential has variations on a small length-scale, quantum phenomena become important. Then asymptotic methods are less accurate. The two classes of methods perform well in different parameter regimes. This opens for hybrid methods, using Gaussian beams where we can and finite differences where we have to. We propose a new method for treating the coupling between the finite difference method and Gaussian beams. The new method reduces the needed amount of overlap regions considerably compared to previous methods, which improves the efficiency.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Kieri, Emil, 1987-
(author)
-
Numerical Methods for Wave Propagation : Analysis and Applications in Quantum Dynamics
- 2016
-
Doctoral thesis (other academic/artistic)abstract
- We study numerical methods for time-dependent partial differential equations describing wave propagation, primarily applied to problems in quantum dynamics governed by the time-dependent Schrödinger equation (TDSE). We consider both methods for spatial approximation and for time stepping. In most settings, numerical solution of the TDSE is more challenging than solving a hyperbolic wave equation. This is mainly because the dispersion relation of the TDSE makes it very sensitive to dispersion error, and infers a stringent time step restriction for standard explicit time stepping schemes. The TDSE is also often posed in high dimensions, where standard methods are intractable.The sensitivity to dispersion error makes spectral methods advantageous for the TDSE. We use spectral or pseudospectral methods in all except one of the included papers. In Paper III we improve and analyse the accuracy of the Fourier pseudospectral method applied to a problem with limited regularity, and in Paper V we construct a matrix-free spectral method for problems with non-trivial boundary conditions. Due to its stiffness, the TDSE is most often solved using exponential time integration. In this thesis we use exponential operator splitting and Krylov subspace methods. We rigorously prove convergence for force-gradient operator splitting methods in Paper IV. One way of making high-dimensional problems computationally tractable is low-rank approximation. In Paper VI we prove that a splitting method for dynamical low-rank approximation is robust to singular values in the approximation approaching zero, a situation which is difficult to handle since it implies strong curvature of the approximation space.
|
|
| 10. |
- Kieri, Emil
(author)
-
Numerical Quantum Dynamics
- 2013
-
Licentiate thesis (other academic/artistic)abstract
- We consider computational methods for simulating the dynamics of molecular systems governed by the time-dependent Schrödinger equation. Solving the Schrödinger equation numerically poses a challenge due to its often highly oscillatory solutions, and to the exponential growth of work and memory with the number of particles in the system.Two different classes of problems are studied: the dynamics of the nuclei in a molecule and the dynamics of an electron in orbit around a nucleus. For the first class of problems we present new computational methods which exploit the relation between quantum and classical dynamics in order to make the computations more efficient. For the second class of problems, the lack of regularity in the solution poses a computational challenge. Using knowledge of the non-smooth features of the solution we construct a new method with two orders higher accuracy than what is achieved by direct application of a difference stencil.
|
|
