1 September 2021 in Mathematical Biosciences
1 October 2016 in International Journal of Parallel Programming
16 May 2022 in PLOS Computational Biology
We analyze the relaxation of non-pharmaceutical interventions (NPIs) under an increasing number of vaccinations in Germany. For the spread of SARS-CoV-2 we employ a SIR-type model that accounts for age-dependence and includes realistic contact patterns between age groups. The implementation of NPIs occurs on changed contact patterns, improved isolation, or reduced infectiousness when, e.g., wearing masks. We account for spatial heterogeneity and commuting activities in between regions in Germany, and the testing of commuters is considered as a further NPI. We include the ongoing vaccination process and analyze the effect of the B.1.617.2 (Delta) variant, which is considered to be 40%–60% more infectious then the currently dominant B.1.1.7 (Alpha) variant. We explore different opening scenarios under the ongoing vaccination process by assuming that local restrictions are either lifted in early July or August with or without continued wearing of masks and testing. Our results indicate that we can counteract the resurgence of SARS-CoV-2 despite the Delta variant with appropriate timing for the relaxation of NPIs. In all cases, however, school children are hit the hardest.
1 December 2000 in Applied Mathematical Modelling
1 January 2015 in SIAM Journal on Scientific Computing
Block variants of the Jacobi--Davidson method for computing a few eigenpairs of a large sparse matrix are known to improve the robustness of the standard algorithm when it comes to computing multiple or clustered eigenvalues. In practice, however, they are typically avoided because the total number of matrix-vector operations increases. In this paper we present the implementation of a block Jacobi--Davidson solver. By detailed performance engineering and numerical experiments we demonstrate that the increase in operations is typically more than compensated by performance gains through better cache usage on modern CPUs, resulting in a method that is both more efficient and robust than its single vector counterpart. The steps to be taken to achieve a block speedup involve both kernel optimizations for sparse matrix and block vector operations, and algorithmic choices to allow using blocked operations in most parts of the computation. We discuss the aspect of avoiding synchronization in the algorithm and sho...