127 research outputs found

    A short note on the nested-sweep polarized traces method for the 2D Helmholtz equation

    Full text link
    We present a variant of the solver in Zepeda-N\'u\~nez and Demanet (2014), for the 2D high-frequency Helmholtz equation in heterogeneous acoustic media. By changing the domain decomposition from a layered to a grid-like partition, this variant yields improved asymptotic online and offline runtimes and a lower memory footprint. The solver has online parallel complexity that scales \emph{sub linearly} as O(NP)\mathcal{O} \left( \frac{N}{P} \right), where NN is the number of volume unknowns, and PP is the number of processors, provided that P=O(N1/5)P = \mathcal{O}(N^{1/5}). The variant in Zepeda-N\'u\~nez and Demanet (2014) only afforded P=O(N1/8)P = \mathcal{O}(N^{1/8}). Algorithmic scalability is a prime requirement for wave simulation in regimes of interest for geophysical imaging.Comment: 5 pages, 5 figure

    Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

    Full text link
    We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.Comment: 24 pages, Elsevier Journal of Computational and Applied Mathematics, Dec 201

    Shifted Laplacian multigrid for the elastic Helmholtz equation

    Full text link
    The shifted Laplacian multigrid method is a well known approach for preconditioning the indefinite linear system arising from the discretization of the acoustic Helmholtz equation. This equation is used to model wave propagation in the frequency domain. However, in some cases the acoustic equation is not sufficient for modeling the physics of the wave propagation, and one has to consider the elastic Helmholtz equation. Such a case arises in geophysical seismic imaging applications, where the earth's subsurface is the elastic medium. The elastic Helmholtz equation is much harder to solve than its acoustic counterpart, partially because it is three times larger, and partially because it models more complicated physics. Despite this, there are very few solvers available for the elastic equation compared to the array of solvers that are available for the acoustic one. In this work we extend the shifted Laplacian approach to the elastic Helmholtz equation, by combining the complex shift idea with approaches for linear elasticity. We demonstrate the efficiency and properties of our solver using numerical experiments for problems with heterogeneous media in two and three dimensions
    • …
    corecore