Hussam received his masters in fundamental and applied mathematics from Paris-sud University in 2014. He then started preparing his doctorate at Inria-Paris and Sorbonne University (Paris-VI). In 2018 he received his PhD. Afterwards, he spent 18 months as a postdoctoral fellow at the computational methods in control and system theory group in the Max Planck Institute in Magdeburg, Germany. Starting from August 2020, he holds a research position at the Computational Mathematics Group at STFC Rutherford Appleton Laboratory.
His research interests lie in the fields of numerical linear and multilinear algebra and high performance computing. In particular, he is interested in solving large-scale sparse linear systems using preconditioned (accelerated) iterative methods focusing on acceleration techniques that are algebraic (no dependency on the underlying problem), robust with respect to problems parameters, and scalable.
Recently submitted a work on communication lower bounds and optimal algorithms for multiple tensor-times-matrix computation
PDF
A confefrence paper on parallel tensor train rounding using Gram SVD was recently accepted
Paper
A short confefrence paper on tight memory-independent parallel matrix multiplication communication lower bounds was recently accepted
PDF
Recently submitted a preprint on efficient algebraic two-level Schwarz preconditioners for general sparse matrices
PDF
6- Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation. 2022. preprint
H. Al Daas, G. Ballard, L. Grigori, S. Kumar, K. Rouse
5- Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. 2022. preprint
H. Al Daas, G. Ballard, L. Grigori, S. Kumar, K. Rouse
4- Efficient Algebraic Two-Level Schwarz Preconditioner For Sparse Matrices. 2022. preprint
H. Al Daas, P. Jolivet, T. Rees
3- An extended Krylov-like method for the solution of multi-linear systems. 2021. preprint
H. Al Daas, D. Lombardi
2- Randomized algorithms for rounding in the Tensor-Train format. 2021. preprint.
H. Al Daas, G. Ballard, P. Cazeaux, E. Hallman, A. Miedlar, M. Pasha, T. W. Reid, A. K. Saibaba
Matlab code for reproducing the results available here.
1- Low-Rank and Total Variation Regularization and Its Application to Image Recovery. 2020. preprint.
P. Goyal, H. Al Daas, P. Benner
10- A Robust Algebraic Multilevel Domain Decomposition Preconditioner For Sparse Symmetric Positive Definite Matrices.
SIAM J. Sci. Comput.. In press. 2022. preprint
H. Al Daas, P. Jolivet
9- Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds.
SPAA 2022 Proceedings. Paper.
H. Al Daas, G. Ballard, L. Grigori, S. Kumar, K. Rouse
8- Parallel Tensor Train Rounding using Gram SVD.
IPDPS 2022 Proceedings. Paper .
H. Al Daas, G. Ballard, L. Maning
7- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations.
SIAM J. Sci. Comput., 44(3), A1047--A1068. 2022. journal, preprint.
H. Al Daas, P. Jolivet, J. Scott
Code for reproducing the results available here, PETSc interface through the HPDDM package, PCHPDDM.
6- Parallel Algorithms for Tensor Train Arithmetic.
SIAM J. Sci. Comput., 44(1), C25--C53. 2022. journal, preprint
H. Al Daas, G. Ballard, P. Benner
MPI Algorithms for Tensor-Train Arithmetic (MPI_ATTAC) is a library implementing algorithms in the paper. It is available here.
5- Two-level Nyström--Schur preconditioner for sparse symmetric positive definite matries
SIAM J. Sci. Comput., 43(6), A3837--A3861. 2021. journal, preprint
H. Al Daas, T. Rees, J. Scott
Code for reproducing numerical experiments available here.
4- A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces.
SIAM J. Sci. Comput., 43(3), A1907--A1928. 2021. journal, preprint
H. Al Daas, L. Grigori, P. Jolivet, P. H. Tournier
Code for reproducing the results available here, PETSc interface through the HPDDM package, PCHPDDM.
3- Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems.
ACM Transactions on Mathematical Software Volume 47 Issue 2 June 2021 Article No.: 13 pp 1--30. journal, preprint.
H. Al Daas, L. Grigori, P. Henon, P. Ricoux
2- A Class of Efficient Locally Constructed Preconditioners Based on Coarse Spaces.
SIAM J. Matrix Anal. Appl., 40(1), 66--91. 2019. journal, preprint.
H. Al Daas, L. Grigori
1- Enlarged GMRES for solving linear systems with one or multiple right-hand sides.
IMA Journal of Numerical Analysis, Vol. 39, 2019, pp. 1924--1956. 2019. journal.
H. Al Daas, L. Grigori, P. Henon, P. Ricoux
Efficient Algebraic Two-Level Schwarz Preconditioner For Sparse Matrices.
PETSc interface through the HPDDM package, PCHPDDM.
A Robust Algebraic Multilevel Domain Decomposition Preconditioner For Sparse Symmetric Positive Definite Matrices.
PETSc interface through the HPDDM package, PCHPDDM.
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations.
Code for reproducing the results available here.
Soon: PETSc interface through the HPDDM package, PCHPDDM.
Two-level Nyström--Schur preconditioner for sparse symmetric positive definite matries
Code for reproducing numerical experiments available here.
A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces.
Code for reproducing the results available here.
PETSc interface through the HPDDM package, PCHPDDM.
Randomized algorithms for rounding in the Tensor-Train format.
Matlab code for reproducing the results available here.
MPI_ATTAC Parallel Algorithms for Tensor Train Arithmetic.
MPI Algorithms for Tensor-Train Arithmetic (MPI_ATTAC) is a library implementing algorithms in the paper. It is available here.
2022-2024 SIAM UKIE Secretary and Treasurer .
Technical Paper Committee Member of Area 1: Applications, Algorithms, and Libraries in IEEE Cluster 2022.
Co-organizer of the Online series Communication in Numerical Linear Algebra.
Programm Committee Member of TOPIC 10: PARALLEL NUMERICAL METHODS AND APPLICATIONS in EURO-PAR 2020.