Harald Hofstätter
Harald Hofstätter has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Othmar Koch
University of Vienna
16 shared publications - Winfried Auzinger
TU Wien
12 shared publications Othmar Koch
Universität Wien
3 shared publicationsWinfried Auzinger
3 shared publications- David I. Ketcheson
Computer, Electrical, and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
2 shared publications - Karolina Kropielnicka
Institute of Mathematics, Polish Academy of Sciences, Warsaw 81-825, Poland
2 shared publications
Latest Publications
- Open Access
A simple and efficient algorithm for computing the Baker-Campbell-Hausdorff series
A new algorithm for computing coefficients of the Baker--Campbell--Hausdorff series is presented, which can be straightforwardly implemented in any general-purpose programming language or computer algebra system. The algorithm avoids rational arithmetic and performs all its calculations in pure integer arithmetic, allowing for a very efficient implementation. An implementation in the Julia programming language is available.
Open AccessA simple and efficient algorithm for computing the Baker-Campbell-Hausdorff series
A new algorithm for computing coefficients of the Baker--Campbell--Hausdorff series is presented, which can be straightforwardly implemented in any general-purpose programming language or computer algebra system. The algorithm avoids rational arithmetic and performs all its calculations in pure integer arithmetic, allowing for a very efficient implementation. An implementation in the Julia programming language is available.
- Open Access
- 1 January 2022
- Published by Elsevier in Journal of Computational Mathematics and Data Science
- Vol. 2
Efficient Magnus-type integrators for solar energy conversion in Hubbard models
- 1 January 2022
- Published by Elsevier in Journal of Computational Mathematics and Data Science
- Vol. 2
Open AccessEfficient Magnus-type integrators for solar energy conversion in Hubbard models
- Open Access
User manual for bch, a program for the fast computation of the Baker-Campbell-Hausdorff and similar series
This manual describes bch, an efficient program written in the C programming language for the fast computation of the Baker-Campbell-Hausdorff (BCH) and similar Lie series. The Lie series can be represented in the Lyndon basis, in the classical Hall basis, or in the right-normed basis of E.S. Chibrikov. In the Lyndon basis, which proves to be particularly efficient for this purpose, the computation of 111013 coefficients for the BCH series up to terms of degree 20 takes less than half a second on an ordinary personal computer and requires negligible 11MB of memory. Up to terms of degree 30, which is the maximum degree the program can handle, the computation of 74248451 coefficients takes 55 hours but still requires only a modest 5.5GB of memory.
Open AccessUser manual for bch, a program for the fast computation of the Baker-Campbell-Hausdorff and similar series
This manual describes bch, an efficient program written in the C programming language for the fast computation of the Baker-Campbell-Hausdorff (BCH) and similar Lie series. The Lie series can be represented in the Lyndon basis, in the classical Hall basis, or in the right-normed basis of E.S. Chibrikov. In the Lyndon basis, which proves to be particularly efficient for this purpose, the computation of 111013 coefficients for the BCH series up to terms of degree 20 takes less than half a second on an ordinary personal computer and requires negligible 11MB of memory. Up to terms of degree 30, which is the maximum degree the program can handle, the computation of 74248451 coefficients takes 55 hours but still requires only a modest 5.5GB of memory.
- 1 March 2021
- Published by Elsevier in Expositiones Mathematicae
- Vol. 39 (1) , 143-148
A relatively short self-contained proof of the Baker–Campbell–Hausdorff theorem
- 1 March 2021
- Published by Elsevier in Expositiones Mathematicae
- Vol. 39 (1) , 143-148
A relatively short self-contained proof of the Baker–Campbell–Hausdorff theorem
- Open Access
- 19 December 2020
- Published by Springer Nature in International Journal of Applied and Computational Mathematics
- Vol. 7 (1) , 1-14
Adaptive Time Propagation for Time-dependent Schrödinger equations
We compare adaptive time integrators for the numerical solution of linear Schrödinger equations where the Hamiltonian explicitly depends on time. The approximation methods considered are splitting methods, where the time variable is split off and advanced separately, and commutator-free Magnus-type methods. The time-steps are chosen adaptively based on asymptotically correct estimators of the local error in both cases. It is found that splitting methods are more efficient when the Hamiltonian naturally suggests a separation into kinetic and potential part, whereas Magnus-type integrators excel when the structure of the problem only allows to advance the time variable separately.
- 19 December 2020
- Published by Springer Nature in International Journal of Applied and Computational Mathematics
- Vol. 7 (1) , 1-14
Open AccessAdaptive Time Propagation for Time-dependent Schrödinger equations
We compare adaptive time integrators for the numerical solution of linear Schrödinger equations where the Hamiltonian explicitly depends on time. The approximation methods considered are splitting methods, where the time variable is split off and advanced separately, and commutator-free Magnus-type methods. The time-steps are chosen adaptively based on asymptotically correct estimators of the local error in both cases. It is found that splitting methods are more efficient when the Hamiltonian naturally suggests a separation into kinetic and potential part, whereas Magnus-type integrators excel when the structure of the problem only allows to advance the time variable separately.
- Open Access
Denominators of coefficients of the Baker-Campbell-Hausdorff series
For the computation of terms of the Baker-Campbell-Hausdorff series $H = \log(e^Ae^B})$ some a priori knowledge about the denominators of the coefficients of the series can be beneficial. In this paper an explicit formula for the computation of common denominators for the rational coefficients of the homogeneous components of the series is derived. Explicit computations up to degree 30 show that the common denominators obtained by this formula are as small as possible, which suggests that the formula is in a sense optimal. The sequence of integers defined by the formula seems to be interesting also from a number-theoretic point of view. There is, e.g., a connection with the denominators of the Bernoulli numbers and the Bernoulli polynomials.Open AccessDenominators of coefficients of the Baker-Campbell-Hausdorff series
For the computation of terms of the Baker-Campbell-Hausdorff series $H = \log(e^Ae^B})$ some a priori knowledge about the denominators of the coefficients of the series can be beneficial. In this paper an explicit formula for the computation of common denominators for the rational coefficients of the homogeneous components of the series is derived. Explicit computations up to degree 30 show that the common denominators obtained by this formula are as small as possible, which suggests that the formula is in a sense optimal. The sequence of integers defined by the formula seems to be interesting also from a number-theoretic point of view. There is, e.g., a connection with the denominators of the Bernoulli numbers and the Bernoulli polynomials. - Open Access
A relatively short self-contained proof of the Baker-Campbell-Hausdorff theorem
We give a new purely algebraic proof of the Baker-Campbell-Hausdorff theorem, which states that the homogeneous components of the formal expansion of $\log(e^Ae^B)$ are Lie polynomials. Our proof is based on a recurrence formula for these components and a lemma that states that if under certain conditions a commutator of a non-commuting variable and a given polynomial is a Lie polynomial, then the given polynomial itself is a Lie polynomial.Open AccessA relatively short self-contained proof of the Baker-Campbell-Hausdorff theorem
We give a new purely algebraic proof of the Baker-Campbell-Hausdorff theorem, which states that the homogeneous components of the formal expansion of $\log(e^Ae^B)$ are Lie polynomials. Our proof is based on a recurrence formula for these components and a lemma that states that if under certain conditions a commutator of a non-commuting variable and a given polynomial is a Lie polynomial, then the given polynomial itself is a Lie polynomial. - Open Access
Time adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regime
Time dependent Schr\"odinger equations with conservative force field U commonly constitute a major challenge in the numerical approximation, especially when they are analysed in the semiclassical regime. Extremely high oscillations originate from the semiclassical parameter, and call for appropriate methods. We propose to employ a combination of asymptotic Zassenhaus splitting with time adaptivity. While the former turns the disadvantage of the semiclassical parameter into an advantage, leading to highly efficient methods with low error constants, the latter enables to choose an optimal time step and to speed up the calculations when the oscillations subside. We support the results with numerical examples.
Open AccessTime adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regime
Time dependent Schr\"odinger equations with conservative force field U commonly constitute a major challenge in the numerical approximation, especially when they are analysed in the semiclassical regime. Extremely high oscillations originate from the semiclassical parameter, and call for appropriate methods. We propose to employ a combination of asymptotic Zassenhaus splitting with time adaptivity. While the former turns the disadvantage of the semiclassical parameter into an advantage, leading to highly efficient methods with low error constants, the latter enables to choose an optimal time step and to speed up the calculations when the oscillations subside. We support the results with numerical examples.
- Open Access
- 1 December 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 362, 124550
Time adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regime
- 1 December 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 362, 124550
Open AccessTime adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regime