I graduated from Universite catholique de Louvain (Belgium) in 2015 with a Master's degree in Mathematical Engineering. I specialized in Optimization and Numerical Linear Algebra.
I am interested in Fast Linear Solvers, either dense or sparse.
Past projects consisted of accelerating BEM equations solve through low-rank approximation of the kernel function.
Currently, I am working on methods to solver large sparse linear systems with a near linear complexity on a wide range of problems.
This combines ideas from direct methos (Nested Dissection) and low-rank approximations to sparsify nested dissection separators.
Current Research and Scholarly Interests
Fast Sparse Linear Solvers
FAST, Finally an SDDP Toolbox, Universite catholique de Louvain
- Damien Scieur, PhD student, INRIA/ENS Paris
Software Intern, NVidia Corp (2016)
San Jose, California; USA
- ROBUST LOW-RANK MATRIX COMPLETION BY RIEMANNIAN OPTIMIZATION SIAM JOURNAL ON SCIENTIFIC COMPUTING 2016; 38 (5): S440-S460
- AN ALGEBRAIC SPARSIFIED NESTED DISSECTION ALGORITHM USING LOW-RANK APPROXIMATIONS SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 2020; 41 (2): 715–46
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling JOURNAL OF COMPUTATIONAL PHYSICS 2019; 396: 819–36
- FAST LOW-RANK KERNEL MATRIX FACTORIZATION USING SKELETONIZED INTERPOLATION SIAM JOURNAL ON SCIENTIFIC COMPUTING 2019; 41 (3): A1652–A1680
- Application of Stochastic Dual Dynamic Programming to the Real-Time Dispatch of Storage Under Renewable Supply Uncertainty IEEE TRANSACTIONS ON SUSTAINABLE ENERGY 2018; 9 (2): 547–58
Optimal Management of Storage for Offsetting Solar Power Uncertainty using Multistage Stochastic Programming
View details for Web of Science ID 000447282400204