default search action
Hussam Al Daas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Hussam Al Daas
, Grey Ballard
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation. SIAM J. Matrix Anal. Appl. 45(1): 450-477 (2024) - [i12]Hussam Al Daas, Pierre Jolivet, Frédéric Nataf, Pierre-Henri Tournier:
A Robust Two-Level Schwarz Preconditioner For Sparse Matrices. CoRR abs/2401.03915 (2024) - [i11]Lorenzo Lazzarino, Hussam Al Daas, Yuji Nakatsukasa:
Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces. CoRR abs/2409.09187 (2024) - [i10]Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse, Mathieu Verite:
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations. CoRR abs/2409.11304 (2024) - 2023
- [j9]Hussam Al Daas
Randomized Algorithms for Rounding in the Tensor-Train Format. SIAM J. Sci. Comput. 45(1): 74- (2023) - [j8]Hussam Al Daas
Efficient Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices. SIAM J. Sci. Comput. 45(3): 1199-1213 (2023) - [c3]Hussam Al Daas
Parallel Memory-Independent Communication Bounds for SYRK. SPAA 2023: 391-401 - 2022
- [j7]Hussam Al Daas
Parallel Algorithms for Tensor Train Arithmetic. SIAM J. Sci. Comput. 44(1): 25- (2022) - [j6]Hussam Al Daas
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations. SIAM J. Sci. Comput. 44(3): 1047- (2022) - [j5]Hussam Al Daas
A Robust Algebraic Multilevel Domain Decomposition Preconditioner for Sparse Symmetric Positive Definite Matrices. SIAM J. Sci. Comput. 44(4): 2582- (2022) - [c2]Hussam Al Daas, Grey Ballard, Lawton Manning:
Parallel Tensor Train Rounding using Gram SVD. IPDPS 2022: 930-940 - [c1]Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse
Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. SPAA 2022: 445-448 - [i9]Hussam Al Daas, Pierre Jolivet, Tyrone Rees:
Efficient Algebraic Two-Level Schwarz Preconditioner For Sparse Matrices. CoRR abs/2201.02250 (2022) - [i8]Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse:
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. CoRR abs/2205.13407 (2022) - [i7]Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse:
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation. CoRR abs/2207.10437 (2022) - 2021
- [j4]Hussam Al Daas
A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces. SIAM J. Sci. Comput. 43(3): A1907-A1928 (2021) - [j3]Hussam Al Daas
Two-Level Nyström-Schur Preconditioner for Sparse Symmetric Positive Definite Matrices. SIAM J. Sci. Comput. 43(6): A3837-A3861 (2021) - [j2]Hussam Al Daas
Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems. ACM Trans. Math. Softw. 47(2): 13:1-13:30 (2021) - [i6]Hussam Al Daas, Tyrone Rees, Jennifer A. Scott:
Two-level Nyström-Schur preconditioner for sparse symmetric positive definite matrices. CoRR abs/2101.12164 (2021) - [i5]Hussam Al Daas, Pierre Jolivet, Jennifer A. Scott:
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations. CoRR abs/2107.09006 (2021) - [i4]Hussam Al Daas, Pierre Jolivet:
A Robust Algebraic Multilevel Domain Decomposition Preconditioner For Sparse Symmetric Positive Definite Matrices. CoRR abs/2109.05908 (2021) - [i3]Hussam Al Daas, Grey Ballard, Paul Cazeaux, Eric Hallman, Agnieszka Miedlar
Randomized algorithms for rounding in the Tensor-Train format. CoRR abs/2110.04393 (2021) - 2020
- [i2]Pawan Goyal, Hussam Al Daas, Peter Benner:
Low-Rank and Total Variation Regularization and Its Application to Image Recovery. CoRR abs/2003.05698 (2020) - [i1]Hussam Al Daas, Grey Ballard
Parallel Algorithms for Tensor Train Arithmetic. CoRR abs/2011.06532 (2020)
2010 – 2019
- 2019
- [j1]Hussam Al Daas
A Class of Efficient Locally Constructed Preconditioners Based on Coarse Spaces. SIAM J. Matrix Anal. Appl. 40(1): 66-91 (2019) - 2018
- [b1]Hussam Al Daas:
Solving linear systems arising from reservoirs modelling. (Résolution de systèmes linéaires issus de la modélisation des réservoirs). Sorbonne University, France, 2018
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: