activity
20112019
most citedThe communication-hiding pipelined BiCGStab method for the parallel solution of large unsymmetric linear systems

38 citations · 120 across the 12 of their papers we have counts for

collaborators

13 papers

cs.DC2019★ 4 cited

Improving strong scaling of the Conjugate Gradient method for solving large linear systems using global reduction pipelining

Siegfried Cools, Jeffrey Cornelis, Pieter Ghysels +1

This paper presents performance results comparing MPI-based implementations of the popular Conjugate Gradient (CG) method and several of its communication hiding (or 'pipelined') v…

math.NA2019

Numerically Stable Recurrence Relations for the Communication Hiding Pipelined Conjugate Gradient Method

Siegfried Cools, Jeffrey Cornelis, Wim Vanroose

Pipelined Krylov subspace methods (also referred to as communication-hiding methods) have been proposed in the literature as a scalable alternative to classic Krylov subspace algor…

math.NA2018

Analyzing and improving maximal attainable accuracy in the communication hiding pipelined BiCGStab method

Siegfried Cools

Pipelined Krylov subspace methods avoid communication latency by reducing the number of global synchronization bottlenecks and by hiding global communication behind useful computat…

math.NA2018★ 3 cited

Numerical analysis of the maximal attainable accuracy in communication hiding pipelined Conjugate Gradient methods

Siegfried Cools

Krylov subspace methods are widely known as efficient algebraic methods for solving large scale linear systems. However, on massively parallel hardware the performance of these met…

cs.DC2018★ 19 cited

The Communication-Hiding Conjugate Gradient Method with Deep Pipelines

Jeffrey Cornelis, Siegfried Cools, Wim Vanroose

Krylov subspace methods are among the most efficient solvers for large scale linear algebra problems. Nevertheless, classic Krylov subspace algorithms do not scale well on massivel…

math.NA2017★ 3 cited

Numerically Stable Variants of the Communication-hiding Pipelined Conjugate Gradients Algorithm for the Parallel Solution of Large Scale Symmetric Linear Systems

Siegfried Cools, Wim Vanroose

By reducing the number of global synchronization bottlenecks per iteration and hiding communication behind useful computational work, pipelined Krylov subspace methods achieve sign…

cs.DC2016★ 38 cited

The communication-hiding pipelined BiCGStab method for the parallel solution of large unsymmetric linear systems

Siegfried Cools, Wim Vanroose

A High Performance Computing alternative to traditional Krylov subspace methods, pipelined Krylov subspace solvers offer better scalability in the strong scaling limit compared to…

math.NA2016

Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined Conjugate Gradient method

Siegfried Cools, Emrullah Fatih Yetkin, Emmanuel Agullo +2

Pipelined Krylov subspace methods typically offer improved strong scaling on parallel HPC hardware compared to standard Krylov subspace methods for large and sparse linear systems.…

math.AP2015

On the optimality of shifted Laplacian in the class of expansion preconditioners for the Helmholtz equation

Siegfried Cools, Wim Vanroose

This paper introduces and explores the class of expansion preconditioners EX(m) that forms a direct generalization to the classic complex shifted Laplace (CSL) preconditioner for H…

physics.comp-ph2014

A fast and robust computational method for the ionization cross sections of the driven Schroedinger equation using an O(N) multigrid-based scheme

Siegfried Cools, Wim Vanroose

This paper improves the convergence and robustness of a multigrid-based solver for the cross sections of the driven Schroedinger equation. Adding an Coupled Channel Correction Step…

math.NA2012★ 13 cited

A new level-dependent coarsegrid correction scheme for indefinite Helmholtz problems

Siegfried Cools, Bram Reps, Wim Vanroose

In this paper we construct and analyse a level-dependent coarsegrid correction scheme for indefinite Helmholtz problems. This adapted multigrid method is capable of solving the Hel…

math.NA2012★ 6 cited

An efficient multigrid calculation of the far field map for Helmholtz and Schrödinger equations

Siegfried Cools, Bram Reps, Wim Vanroose

In this paper we present a new highly efficient calculation method for the far field amplitude pattern that arises from scattering problems governed by the d-dimensional Helmholtz…

math.AP2011★ 34 cited

Local Fourier Analysis of the Complex Shifted Laplacian preconditioner for Helmholtz problems

Siegfried Cools, Wim Vanroose

In this paper we solve the Helmholtz equation with multigrid preconditioned Krylov subspace methods. The class of Shifted Laplacian preconditioners are known to significantly speed…