Thorsten Rohwedder
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Thorsten Rohwedder has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Reinhold Schneider
TU Berlin
4 shared publications - Andreas Zeiser
Fachbereich 1 Ingenieurwissenschaften – Energie und Information, HTW Berlin, Berlin, Germany
3 shared publications - Wolfgang Dahmen
Institut für Geometrie und Praktische Mathematik RWTH Aachen Templergraben 55 52056 Aachen Germany
1 shared publication
Latest Publications
- Open Access
- 11 January 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (2) , 421-447
The continuous Coupled Cluster formulation for the electronic Schrödinger equation
Nowadays, the Coupled Cluster (CC) method is the probably most widely used high precision method for the solution of the main equation of electronic structure calculation, the stationary electronic Schrödinger equation. Traditionally, the equations of CC are formulated as a nonlinear approximation of a Galerkin solution of the electronic Schrödinger equation, i.e. within a given discrete subspace. Unfortunately, this concept prohibits the direct application of concepts of nonlinear numerical analysis to obtain e.g. existence and uniqueness results or estimates on the convergence of discrete solutions to the full solution. Here, this shortcoming is approached by showing that based on the choice of an N-dimensional reference subspace R of H 1(ℝ3 × {± 1/2}), the original, continuous electronic Schrödinger equation can be reformulated equivalently as a root equation for an infinite-dimensional nonlinear Coupled Cluster operator. The canonical projected CC equations may then be understood as discretizations of this operator. As the main step, continuity properties of the cluster operator S and its adjoint S † as mappings on the antisymmetric energy space H1 are established.
- 11 January 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (2) , 421-447
Open AccessThe continuous Coupled Cluster formulation for the electronic Schrödinger equation
Nowadays, the Coupled Cluster (CC) method is the probably most widely used high precision method for the solution of the main equation of electronic structure calculation, the stationary electronic Schrödinger equation. Traditionally, the equations of CC are formulated as a nonlinear approximation of a Galerkin solution of the electronic Schrödinger equation, i.e. within a given discrete subspace. Unfortunately, this concept prohibits the direct application of concepts of nonlinear numerical analysis to obtain e.g. existence and uniqueness results or estimates on the convergence of discrete solutions to the full solution. Here, this shortcoming is approached by showing that based on the choice of an N-dimensional reference subspace R of H 1(ℝ3 × {± 1/2}), the original, continuous electronic Schrödinger equation can be reformulated equivalently as a root equation for an infinite-dimensional nonlinear Coupled Cluster operator. The canonical projected CC equations may then be understood as discretizations of this operator. As the main step, continuity properties of the cluster operator S and its adjoint S † as mappings on the antisymmetric energy space H1 are established.
- 20 August 2011
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 49 (9) , 1889-1914
An analysis for the DIIS acceleration method used in quantum chemistry calculations
- 20 August 2011
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 49 (9) , 1889-1914
An analysis for the DIIS acceleration method used in quantum chemistry calculations
- Open Access
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric proof based on the preconditioned inverse iteration (PINVIT) for matrices [Knyazev and Neymeyr, (2009)] is extended to the case of operators. We show that convergence is retained up to any tolerance if one only uses approximate applications of operators which leads to the perturbed preconditioned inverse iteration (PPINVIT). We then analyze the Besov regularity of the eigenfunctions of the Poisson eigenvalue problem on a polygonal domain, showing the advantage of an adaptive solver to uniform refinement when using a stable wavelet base. A numerical example for PPINVIT, applied to the model problem on the L-shaped domain, is shown to reproduce the predicted behaviour.
Open AccessPerturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric proof based on the preconditioned inverse iteration (PINVIT) for matrices [Knyazev and Neymeyr, (2009)] is extended to the case of operators. We show that convergence is retained up to any tolerance if one only uses approximate applications of operators which leads to the perturbed preconditioned inverse iteration (PPINVIT). We then analyze the Besov regularity of the eigenfunctions of the Poisson eigenvalue problem on a polygonal domain, showing the advantage of an adaptive solver to uniform refinement when using a stable wavelet base. A numerical example for PPINVIT, applied to the model problem on the L-shaped domain, is shown to reproduce the predicted behaviour.
- 6 October 2009
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 34 (1) , 43-66
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- 6 October 2009
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 34 (1) , 43-66
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- 16 July 2008
- Published by Springer Nature in Numerische Mathematik
- Vol. 110 (3) , 277-312
Adaptive eigenvalue computation: complexity estimates
- 16 July 2008
- Published by Springer Nature in Numerische Mathematik
- Vol. 110 (3) , 277-312
Adaptive eigenvalue computation: complexity estimates