Siegfried Cools

Orcid: 0000-0001-7065-4729

According to our database1, Siegfried Cools authored at least 19 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection.
SIAM J. Sci. Comput., 2020

2019
Numerically Stable Recurrence Relations for the Communication Hiding Pipelined Conjugate Gradient Method.
IEEE Trans. Parallel Distributed Syst., 2019

Analyzing and improving maximal attainable accuracy in the communication hiding pipelined BiCGStab method.
Parallel Comput., 2019

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

2018
Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method.
SIAM J. Matrix Anal. Appl., 2018

Numerical stability analysis of the class of communication hiding pipelined Conjugate Gradient methods.
CoRR, 2018

The Communication-Hiding Conjugate Gradient Method with Deep Pipelines.
CoRR, 2018

2017
The communication-hiding pipelined BiCGstab method for the parallel solution of large unsymmetric linear systems.
Parallel Comput., 2017

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

On Parallel Performance and Numerical Stability of Pipelined Conjugate Gradients.
Proceedings of the Parallel Computing is Everywhere, 2017

2016
A fast and robust computational method for the ionization cross sections of the driven Schrödinger equation using an O(N) multigrid-based scheme.
J. Comput. Phys., 2016

The communication-hiding pipelined BiCGStab method for the efficient parallel solution of large unsymmetric linear systems.
CoRR, 2016

Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2016, 2016

On rounding error resilience, maximal attainable accuracy and parallel performance of the pipelined Conjugate Gradients method for large-scale linear systems in PETSc.
Proceedings of the Exascale Applications and Software Conference 2016, 2016

2015
A multi-level preconditioned Krylov method for the efficient solution of algebraic tomographic reconstruction problems.
J. Comput. Appl. Math., 2015

2014
An Efficient Multigrid Calculation of the Far Field Map for Helmholtz and Schrödinger Equations.
SIAM J. Sci. Comput., 2014

A new level-dependent coarse grid correction scheme for indefinite Helmholtz problems.
Numer. Linear Algebra Appl., 2014

2013
Local Fourier analysis of the complex shifted Laplacian preconditioner for Helmholtz problems.
Numer. Linear Algebra Appl., 2013

2012
An efficient multigrid method calculation of the far field map for Helmholtz problems
CoRR, 2012


  Loading...