714 research outputs found
A Scalable Two-Level Domain Decomposition Eigensolver for Periodic Schr\"odinger Eigenstates in Anisotropically Expanding Domains
Accelerating iterative eigenvalue algorithms is often achieved by employing a
spectral shifting strategy. Unfortunately, improved shifting typically leads to
a smaller eigenvalue for the resulting shifted operator, which in turn results
in a high condition number of the underlying solution matrix, posing a major
challenge for iterative linear solvers. This paper introduces a two-level
domain decomposition preconditioner that addresses this issue for the linear
Schr\"odinger eigenvalue problem, even in the presence of a vanishing
eigenvalue gap in non-uniform, expanding domains. Since the quasi-optimal
shift, which is already available as the solution to a spectral cell problem,
is required for the eigenvalue solver, it is logical to also use its associated
eigenfunction as a generator to construct a coarse space. We analyze the
resulting two-level additive Schwarz preconditioner and obtain a condition
number bound that is independent of the domain's anisotropy, despite the need
for only one basis function per subdomain for the coarse solver. Several
numerical examples are presented to illustrate its flexibility and efficiency.Comment: 30 pages, 7 figures, 2 table
Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
We first briefly report on the status and recent achievements of the ELPA-AEO
(Eigenvalue Solvers for Petaflop Applications - Algorithmic Extensions and
Optimizations) and ESSEX II (Equipping Sparse Solvers for Exascale) projects.
In both collaboratory efforts, scientists from the application areas,
mathematicians, and computer scientists work together to develop and make
available efficient highly parallel methods for the solution of eigenvalue
problems. Then we focus on a topic addressed in both projects, the use of mixed
precision computations to enhance efficiency. We give a more detailed
description of our approaches for benefiting from either lower or higher
precision in three selected contexts and of the results thus obtained
Numerical methods for computing Casimir interactions
We review several different approaches for computing Casimir forces and
related fluctuation-induced interactions between bodies of arbitrary shapes and
materials. The relationships between this problem and well known computational
techniques from classical electromagnetism are emphasized. We also review the
basic principles of standard computational methods, categorizing them according
to three criteria---choice of problem, basis, and solution technique---that can
be used to classify proposals for the Casimir problem as well. In this way,
mature classical methods can be exploited to model Casimir physics, with a few
important modifications.Comment: 46 pages, 142 references, 5 figures. To appear in upcoming Lecture
Notes in Physics book on Casimir Physic
- …