default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThéo Mary
Person information
- affiliation: University of Manchester, UK
- affiliation (PhD 2017): Paul Sabatier University, Toulouse, France
Other persons with a similar name
- Mary Frances Theofanos (aka: Mary Theofanos)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Patrick Amestoy, Olivier Boiteau, Alfredo Buttari
, Matthieu Gerest, Fabienne Jézéquel, Jean-Yves L'Excellent, Théo Mary:
Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides. SIAM J. Matrix Anal. Appl. 45(1): 148-166 (2024)- [j20]Patrick Amestoy, Alfredo Buttari, Nicholas J. Higham, Jean-Yves L'Excellent, Théo Mary, Bastien Vieuble:
Five-Precision GMRES-Based Iterative Refinement. SIAM J. Matrix Anal. Appl. 45(1): 529-552 (2024) - [j19]Stef Graillat, Fabienne Jézéquel, Théo Mary, Roméo Molina:
Adaptive Precision Sparse Matrix-Vector Product and Its Application to Krylov Solvers. SIAM J. Sci. Comput. 46(1): 30- (2024) - [c4]Stef Graillat, Fabienne Jézéquel, Théo Mary, Roméo Molina, Daichi Mukunoki:
Reduced-Precision and Reduced-Exponent Formats for Accelerating Adaptive Precision Sparse Matrix-Vector Product. Euro-Par (3) 2024: 17-30 - [c3]Marc Baboulin, Simplice Donfack, Oguz Kaya, Théo Mary, Matthieu Robeyns:
Mixed Precision Randomized Low-Rank Approximation with GPU Tensor Cores. Euro-Par (3) 2024: 31-44 - 2023
- [j18]Jérémy Berthomieu, Stef Graillat, Dimitri Lesnoff, Théo Mary:
Modular Matrix Multiplication on GPU for Polynomial System Solving. ACM Commun. Comput. Algebra 57(2): 35-38 (2023) - [j17]Florent Lopez, Théo Mary:
Mixed precision LU factorization on GPU tensor cores: reducing data movement and memory footprint. Int. J. High Perform. Comput. Appl. 37(2): 165-179 (2023) - [j16]Massimiliano Fasi, Nicholas J. Higham, Florent Lopez, Théo Mary, Mantas Mikaitis:
Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores. SIAM J. Sci. Comput. 45(1): 1- (2023) - [j15]Patrick Amestoy, Alfredo Buttari, Nicholas J. Higham, Jean-Yves L'Excellent, Théo Mary, Bastien Vieuble:
Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement. ACM Trans. Math. Softw. 49(1): 4:1-4:29 (2023) - 2022
- [j14]Nicholas J. Higham, Théo Mary:
Mixed precision algorithms in numerical linear algebra. Acta Numer. 31: 347-414 (2022) - [j13]Alfredo Buttari, Markus Huber, Philippe Leleux, Théo Mary, Ulrich Rüde, Barbara I. Wohlmuth:
Block low-rank single precision coarse grid solvers for extreme scale multigrid methods. Numer. Linear Algebra Appl. 29(1) (2022) - 2021
- [j12]Cleve Ashcraft, Alfredo Buttari, Théo Mary:
Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR2 Format. SIAM J. Matrix Anal. Appl. 42(2): 990-1010 (2021) - [j11]Michael P. Connolly, Nicholas J. Higham, Théo Mary:
Stochastic Rounding and Its Probabilistic Backward Error Analysis. SIAM J. Sci. Comput. 43(1): A566-A585 (2021) - 2020
- [j10]Pierre Blanchard, Nicholas J. Higham, Théo Mary:
A Class of Fast and Accurate Summation Algorithms. SIAM J. Sci. Comput. 42(3): A1541-A1557 (2020) - [j9]Pierre Blanchard, Nicholas J. Higham, Florent Lopez, Théo Mary, Srikara Pranesh:
Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores. SIAM J. Sci. Comput. 42(3): C124-C141 (2020) - [j8]Nicholas J. Higham, Théo Mary:
Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data. SIAM J. Sci. Comput. 42(5): A3427-A3446 (2020)
2010 – 2019
- 2019
- [j7]Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche:
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. 40(4): 1478-1496 (2019) - [j6]Nicholas J. Higham, Théo Mary:
A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error. SIAM J. Sci. Comput. 41(1): A59-A82 (2019) - [j5]Patrick R. Amestoy, Alfredo Buttari, Jean-Yves L'Excellent, Théo Mary:
Bridging the Gap Between Flat and Hierarchical Low-Rank Matrix Formats: The Multilevel Block Low-Rank Format. SIAM J. Sci. Comput. 41(3): A1414-A1442 (2019) - [j4]Nicholas J. Higham, Théo Mary:
A New Approach to Probabilistic Rounding Error Analysis. SIAM J. Sci. Comput. 41(5): A2815-A2835 (2019) - [j3]Christopher Gorman, Gustavo Chávez, Pieter Ghysels, Théo Mary, François-Henry Rouet, Xiaoye Sherry Li:
Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction. SIAM J. Sci. Comput. 41(5): S61-S85 (2019) - [j2]Patrick R. Amestoy, Alfredo Buttari, Jean-Yves L'Excellent, Théo Mary:
Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures. ACM Trans. Math. Softw. 45(1): 2:1-2:26 (2019) - 2018
- [i1]Christopher Gorman, Gustavo Chávez, Pieter Ghysels, Théo Mary, François-Henry Rouet, Xiaoye Sherry Li:
Matrix-free construction of HSS representation using adaptive randomized sampling. CoRR abs/1810.04125 (2018) - 2017
- [b1]Théo Mary:
Block Low-Rank multifrontal solvers: complexity, performance, and scalability. (Solveurs multifrontaux exploitant des blocs de rang faible: complexité, performance et parallélisme). Paul Sabatier University, Toulouse, France, 2017 - [j1]Patrick Amestoy, Alfredo Buttari, Jean-Yves L'Excellent, Théo Mary:
On the Complexity of the Block Low-Rank Multifrontal Factorization. SIAM J. Sci. Comput. 39(4) (2017) - 2015
- [c2]Théo Mary, Ichitaro Yamazaki, Jakub Kurzak, Piotr Luszczek, Stanimire Tomov, Jack J. Dongarra:
Performance of random sampling for computing low-rank approximations of a dense matrix on GPUs. SC 2015: 60:1-60:11 - 2014
- [c1]Ichitaro Yamazaki, Théo Mary, Jakub Kurzak, Stanimire Tomov, Jack J. Dongarra:
Access-averse framework for computing low-rank matrix approximations. IEEE BigData 2014: 70-77
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-09-10 01:15 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:
