output
20142022
most citedExploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

109 citations

22 papers

math.OC2022★ 1 cited

Does 3D frequency-domain FWI of full-azimuth/long-offset OBN data feasible? The Gorgon case study

S. Operto, P. Amestoy, H. S. Aghamiry +13

Frequency-domain Full Waveform Inversion (FWI) is potentially amenable to efficient processing of full-azimuth long-offset stationary-recording seabed acquisition carried out with…

physics.comp-ph2022★ 2 cited

A PIC method with Forward-Backward Lagrangian reconstructions

Martin Campos Pinto, Merlin Pelz, Pierre-Henri Tournier

In this work we describe a particle simulation method where the bulk density is periodically remapped on a coarse spline grid using a Forward-Backward Lagrangian (FBL) approac…

math.NA2022★ 10 cited

Stable approximation of Helmholtz solutions in the disk by evanescent plane waves

Emile Parolin, Daan Huybrechs, Andrea Moiola

Superpositions of plane waves are known to approximate well the solutions of the Helmholtz equation. Their use in discretizations is typical of Trefftz methods for Helmholtz proble…

math.NA2021★ 7 cited

Randomized block Gram-Schmidt process for solution of linear systems and eigenvalue problems

Oleg Balabanov, Laura Grigori

This article introduces randomized block Gram-Schmidt process (RBGS) for QR decomposition. RBGS extends the single-vector randomized Gram-Schmidt (RGS) algorithm and inherits its k…

math.NA2020★ 3 cited

Two-level DDM preconditioners for positive Maxwell equations

Niall Bootland, Victorita Dolean, Frédéric Nataf +1

In this paper we develop and analyse domain decomposition methods for linear systems of equations arising from conforming finite element discretisations of positive Maxwell-type eq…

math.NA2020★ 1 cited

Analysis of the SORAS domain decomposition preconditioner for non-self-adjoint or indefinite problems

Marcella Bonazzoli, Xavier Claeys, Frédéric Nataf +1

We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a generic linear sy…

math.NA2020★ 2 cited

Robust treatment of cross points in Optimized Schwarz Methods

Xavier Claeys, Emile Parolin

In the field of Domain Decomposition (DD), Optimized Schwarz Method (OSM) appears to be one of the prominent techniques to solve large scale time-harmonic wave propagation problems…

math.NA2020★ 3 cited

Accelerating linear system solvers for time domain component separation of cosmic microwave background data

J. Papež, L. Grigori, R. Stompor

Component separation is one of the key stages of any modern, cosmic microwave background (CMB) data analysis pipeline. It is an inherently non-linear procedure and typically involv…

math.NA2019★ 7 cited

Mathematical Analysis of Robustness of Two-Level Domain Decomposition Methods with respect to Inexact Coarse Solves

Frédéric Nataf

Convergence of domain decomposition methods rely heavily on the efficiency of the coarse space used in the second level. The GenEO coarse space has been shown to lead to a fully ro…

cs.DC2019

A GenEO Domain Decomposition method for Saddle Point problems

Frédéric Nataf, Pierre-Henri Tournier

We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any k…

math.NA2019★ 17 cited

Parallel Controllability Methods For the Helmholtz Equation

Marcus J. Grote, Frédéric Nataf, Jet Hoe Tang +1

The Helmholtz equation is notoriously difficult to solve with standard numerical methods, increasingly so, in fact, at higher frequencies. Controllability methods instead transform…

cs.DC2018★ 1 cited

A 3D Parallel Algorithm for QR Decomposition

Grey Ballard, James Demmel, Laura Grigori +2

Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communi…

astro-ph.CO2018★ 7 cited

Solving linear equations with messenger-field and conjugate gradients techniques - an application to CMB data analysis

J. Papez, L. Grigori, R. Stompor

We discuss linear system solvers invoking a messenger-field and compare them with (preconditioned) conjugate gradients approaches. We show that the messenger-field techniques corre…

math.NA2017★ 8 cited

An example of explicit implementation strategy and preconditioning for the high order edge finite elements applied to the time-harmonic Maxwell's equations

Marcella Bonazzoli, Victorita Dolean, Frédéric Hecht +1

In this paper we focus on high order finite element approximations of the electric field combined with suitable preconditioners, to solve the time-harmonic Maxwell's equations in w…

math.NA2017★ 49 cited

Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations with absorption

Marcella Bonazzoli, Victorita Dolean, Ivan G. Graham +2

This paper rigorously analyses preconditioners for the time-harmonic Maxwell equations with absorption, where the PDE is discretised using curl-conforming finite-element methods of…

math.NA2017★ 13 cited

Two-level preconditioners for the Helmholtz equation

Marcella Bonazzoli, Victorita Dolean, Ivan Graham +2

In this paper we compare numerically two different coarse space definitions for two-level domain decomposition preconditioners for the Helmholtz equation, both in two and three dim…

math.NA2017★ 5 cited

A two-level domain-decomposition preconditioner for the time-harmonic Maxwell's equations

Marcella Bonazzoli, Victorita Dolean, Ivan Graham +2

The construction of fast iterative solvers for the indefinite time-harmonic Maxwell's system at mid- to high-frequency is a problem of great current interest. Some of the difficult…

math.NA2017★ 1 cited

URV Factorization with Random Orthogonal System Mixing

Stephen Becker, James Folberth, Laura Grigori

The unpivoted and pivoted Householder QR factorizations are ubiquitous in numerical linear algebra. A difficulty with pivoted Householder QR is the communication bottleneck introdu…

math.NA2016★ 2 cited

An introduction to Multitrace Formulations and Associated Domain Decomposition Solvers

X. Claeys, V. Dolean, M. J. Gander

Multitrace formulations (MTFs) are based on a decomposition of the problem domain into subdomains, and thus domain decomposition solvers are of interest. The fully rigorous mathema…

math.AP2015★ 6 cited

Oscillating behaviour of the spectrum for a plasmonic problem in a domain with a rounded corner

Lucas Chesnel, Xavier Claeys, Sergei A. Nazarov

We investigate the eigenvalue problem in a 2D domain divided into two regions . We are interested in situations where …

cs.DC2015★ 109 cited

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

Ariful Azad, Grey Ballard, Aydin Buluc +5

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The s…

math.NA2014

Robin Schwarz algorithm for the NICEM Method: the Pq finite element case

Caroline Japhet, Yvon Maday, Frédéric Nataf

In Gander et al. [2004] we proposed a new non-conforming domain decomposition paradigm, the New Interface Cement Equilibrated Mortar (NICEM) method, based on Schwarz type methods t…