1,915 research outputs found
Adaptive Mesh Refinement for Coupled Elliptic-Hyperbolic Systems
We present a modification to the Berger and Oliger adaptive mesh refinement
algorithm designed to solve systems of coupled, non-linear, hyperbolic and
elliptic partial differential equations. Such systems typically arise during
constrained evolution of the field equations of general relativity. The novel
aspect of this algorithm is a technique of "extrapolation and delayed solution"
used to deal with the non-local nature of the solution of the elliptic
equations, driven by dynamical sources, within the usual Berger and Oliger
time-stepping framework. We show empirical results demonstrating the
effectiveness of this technique in axisymmetric gravitational collapse
simulations. We also describe several other details of the code, including
truncation error estimation using a self-shadow hierarchy, and the
refinement-boundary interpolation operators that are used to help suppress
spurious high-frequency solution components ("noise").Comment: 31 pages, 15 figures; replaced with published versio
An efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal
variant of Gaussian elimination, and exploits low-rank approximation of the
resulting dense frontal matrices. We use hierarchically semiseparable (HSS)
matrices, which have low-rank off-diagonal blocks, to approximate the frontal
matrices. For HSS matrix construction, a randomized sampling algorithm is used
together with interpolative decompositions. The combination of the randomized
compression with a fast ULV HSS factorization leads to a solver with lower
computational complexity than the standard multifrontal method for many
applications, resulting in speedups up to 7 fold for problems in our test
suite. The implementation targets many-core systems by using task parallelism
with dynamic runtime scheduling. Numerical experiments show performance
improvements over state-of-the-art sparse direct solvers. The implementation
achieves high performance and good scalability on a range of modern shared
memory parallel systems, including the Intel Xeon Phi (MIC). The code is part
of a software package called STRUMPACK -- STRUctured Matrices PACKage, which
also has a distributed memory component for dense rank-structured matrices
- …