The following pages link to Pieter Ghysels (Q2018481):
Displaying 15 items.
- A multi-level preconditioned Krylov method for the efficient solution of algebraic tomographic reconstruction problems (Q2018482) (← links)
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling (Q2830621) (← links)
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines (Q4917164) (← links)
- Improving the arithmetic intensity of multigrid with the help of polynomial smoothers (Q4921808) (← links)
- Preparing sparse solvers for exascale computing (Q4993505) (← links)
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations (Q4997393) (← links)
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations (Q5161748) (← links)
- Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction (Q5241244) (← links)
- Modeling the Performance of Geometric Multigrid Stencils on Multicore Computer Architectures (Q5254467) (← links)
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization (Q5270756) (← links)
- Butterfly Factorization Via Randomized Matrix-Vector Multiplications (Q5857731) (← links)
- An effective preconditioning strategy for volume penalized incompressible/low Mach multiphase flow solvers (Q6173362) (← links)
- Matrix-free construction of HSS representation using adaptive randomized sampling (Q6511950) (← links)
- Sparse approximate multifrontal factorization with composite compression methods (Q6601381) (← links)
- Preventing mass loss in the standard level set method: new insights from variational analyses (Q6648406) (← links)
