default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Hallman
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Eric Hallman:
Extremal bounds for Gaussian trace estimation. CoRR abs/2411.15454 (2024)- 2023
- [j8]Eric Hallman, Ilse C. F. Ipsen:
Precision-aware deterministic and probabilistic error bounds for floating point summation. Numerische Mathematik 155(1-2): 83-119 (2023) - [j7]Eric Hallman
, Ilse C. F. Ipsen, Arvind K. Saibaba:
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix. SIAM J. Matrix Anal. Appl. 44(1): 240-269 (2023) - [j6]Tyler Chen, Eric Hallman:
Krylov-Aware Stochastic Trace Estimation. SIAM J. Matrix Anal. Appl. 44(3): 1218-1244 (2023) - [j5]Hussam Al Daas, Grey Ballard, Paul Cazeaux, Eric Hallman, Agnieszka Miedlar, Mirjeta Pasha, Tim W. Reid, Arvind K. Saibaba:
Randomized Algorithms for Rounding in the Tensor-Train Format. SIAM J. Sci. Comput. 45(1): 74- (2023) - 2022
- [j4]Eric Hallman:
A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation. SIAM J. Matrix Anal. Appl. 43(2): 661-680 (2022) - [i9]Eric Hallman, Ilse C. F. Ipsen, Arvind K. Saibaba:
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix. CoRR abs/2202.02887 (2022) - [i8]Eric Hallman, Ilse C. F. Ipsen:
Precision-aware Deterministic and Probabilistic Error Bounds for Floating Point Summation. CoRR abs/2203.15928 (2022) - [i7]Tyler Chen, Eric Hallman:
Krylov-aware stochastic trace estimation. CoRR abs/2205.01736 (2022) - 2021
- [j3]Eric Hallman:
Faster stochastic trace estimation with a Chebyshev product identity. Appl. Math. Lett. 120: 107246 (2021) - [i6]Eric Hallman:
Faster Stochastic Trace Estimation with a Chebyshev Product Identity. CoRR abs/2101.00325 (2021) - [i5]Eric Hallman:
A Block Bidiagonalization Method for Fixed-Precision Low-Rank Matrix Approximation. CoRR abs/2101.01247 (2021) - [i4]Eric Hallman, Devon Troester:
A Multilevel Approach to Stochastic Trace Estimation. CoRR abs/2103.10516 (2021) - [i3]Eric Hallman:
A Refined Probabilistic Error Bound for Sums. CoRR abs/2104.06531 (2021) - [i2]Eric Hallman, Ilse C. F. Ipsen:
Deterministic and Probabilistic Error Bounds for Floating Point Summation Algorithms. CoRR abs/2107.01604 (2021) - [i1]Hussam Al Daas, Grey Ballard, Paul Cazeaux, Eric Hallman, Agnieszka Miedlar, Mirjeta Pasha, Tim W. Reid, Arvind K. Saibaba:
Randomized algorithms for rounding in the Tensor-Train format. CoRR abs/2110.04393 (2021) - 2020
- [j2]Eric Hallman:
Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method. SIAM J. Matrix Anal. Appl. 41(3): 1183-1207 (2020)
2010 – 2019
- 2018
- [j1]Eric Hallman, Ming Gu:
LSMB: Minimizing the Backward Error for Least-Squares Problems. SIAM J. Matrix Anal. Appl. 39(3): 1295-1317 (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 2025-01-09 13:18 CET 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:
