Hussam Al Daas

Hussam Al Daas

Auto-generated profile, based on publicly available information

Hussam Al Daas

Rutherford Appleton Laboratory, Didcot, United Kingdom

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2023 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
HDHussam Al Daas
Hussam Al Daas
GBGrey Ballard
Grey Ballard
PCPaul Cazeaux
Paul Cazeaux
EHEric Hallman
Eric Hallman
AMAgnieszka Międlar
Agnieszka Międlar
ASArvind K. Saibaba
Arvind K. Saibaba
The tensor-train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions of certa...

3 February 2022 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
HDHussam Al Daas
Hussam Al Daas
GBGrey Ballard
Grey Ballard
PBPeter Benner
Peter Benner
We present efficient and scalable parallel algorithms for performing mathematical operations for low-rank tensors represented in the tensor train (TT) format. We consider algorithms for addition, e...

1 January 2021 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
HDHussam Al Daas
Hussam Al Daas
LGLaura Grigori
Laura Grigori
PJPierre Jolivet
Pierre Jolivet
PTPierre-Henri Tournier
Pierre-Henri Tournier
In this paper we present a multilevel preconditioner based on overlapping Schwarz methods for symmetric positive definite (SPD) matrices. Robust two-level Schwarz preconditioners exist in the liter...

20 April 2021 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
HDHussam Al Daas
Hussam Al Daas
LGLaura Grigori
Laura Grigori
PHPascal Hénon
Pascal Hénon
PRPhilippe Ricoux
Philippe Ricoux
This article presents deflation strategies related to recycling Krylov subspace methods for solving one or a sequence of linear systems of equations. Besides well-known strategies of deflation, Ritz-, and harmonic Ritz-based deflation, we introduce an Singular Value Decomposition based deflation technique. We consider the recycling in two contexts: recycling the Krylov subspace between the restart cycles and recycling a deflation subspace when the matrix changes in a sequence of linear systems. Numerical experiments on real-life reservoir simulation demonstrate the impact of our proposed strategy.

9 June 2023 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
HDHussam Al Daas
Hussam Al Daas
PJPierre Jolivet
Pierre Jolivet
TRTyrone Rees
Tyrone Rees
Domain decomposition methods are among the most efficient for solving sparse linear systems of equations. Their effectiveness relies on a judiciously chosen coarse space. Originally introduced and theoretically proved to be efficient for self-adjoint operators, spectral coarse spaces have been proposed in the past few years for indefinite and non-self-adjoint operators. This paper presents a new spectral coarse space that can be constructed in a fully algebraic way unlike most existing spectral coarse spaces. We present theoretical convergence results for Hermitian positive definite diagonally dominant matrices. Numerical experiments and comparison against state-of-the-art preconditioners in the multigrid community show that the resulting two-level Schwarz preconditioner is efficient especially for non-self-adjoint operators. Furthermore, in this case, our proposed preconditioner outperforms state-of-the-art preconditioners.

3 May 2022 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
HDHussam Al Daas
Hussam Al Daas
PJPierre Jolivet
Pierre Jolivet
JSJennifer Scott
Jennifer Scott
Solving the normal equations corresponding to large sparse linear least-squares problems is an important and challenging problem. For very large problems, an iterative solver is needed and, in gene...