default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois-Henry Rouet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]Sophia Kolak, Hamed Mohammadbagherpoor, Konstantis Daloukas, Kostas Kafousas, François-Henry Rouet, Yorgos Koutsoyannopoulos, Nathan Earnest-Noble, Robert F. Lucas:
Evaluating Quantum Algorithms for Linear Solver Workflows. ISC Workshops 2023: 634-647- 2020
- [c6]François-Henry Rouet, Cleve Ashcraft, Jef Dawson, Roger Grimes, Erman Guleryuz, Seid Koric, Robert F. Lucas, James S. Ong, Todd A. Simons, Ting-Ting Zhu:
Scalability Challenges of an Industrial Implicit Finite Element Code. IPDPS 2020: 505-514
2010 – 2019
- 2019
- [j9]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) - 2018
- [j8]Shengguo Li, François-Henry Rouet, Jie Liu, Chun Huang, Xingyu Gao, Xuebin Chi:
An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures. J. Comput. Appl. Math. 344: 512-520 (2018) - [i4]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
- [c5]Pieter Ghysels, Xiaoye Sherry Li, Christopher Gorman, François-Henry Rouet:
A Robust Parallel Preconditioner for Indefinite Systems Using Hierarchical Matrices and Randomized Sampling. IPDPS 2017: 897-906 - 2016
- [j7]Emmanuel Agullo, Patrick R. Amestoy, Alfredo Buttari, Abdou Guermouche, Jean-Yves L'Excellent, François-Henry Rouet:
Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations. SIAM J. Sci. Comput. 38(3) (2016) - [j6]Pieter Ghysels, Xiaoye S. Li, François-Henry Rouet, Samuel Williams, Artem Napov:
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling. SIAM J. Sci. Comput. 38(5) (2016) - [j5]Shen Wang, Xiaoye S. Li, François-Henry Rouet, Jianlin Xia, Maarten V. de Hoop:
A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure. ACM Trans. Math. Softw. 42(3): 21:1-21:21 (2016) - [j4]François-Henry Rouet, Xiaoye S. Li, Pieter Ghysels, Artem Napov:
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization. ACM Trans. Math. Softw. 42(4): 27:1-27:35 (2016) - [i3]Shengguo Li, François-Henry Rouet, Jie Liu, Chun Huang, Xingyu Gao, Xuebin Chi:
An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures. CoRR abs/1612.07526 (2016) - 2015
- [j3]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, François-Henry Rouet:
Parallel Computation of Entries of A-1. SIAM J. Sci. Comput. 37(2) (2015) - [i2]Pieter Ghysels, Xiaoye S. Li, François-Henry Rouet, Samuel Williams, Artem Napov:
An efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling. CoRR abs/1502.07405 (2015) - [i1]François-Henry Rouet, Xiaoye S. Li, Pieter Ghysels, Artem Napov:
A distributed-memory package for dense Hierarchically Semi-Separable matrix computations using randomization. CoRR abs/1503.05464 (2015) - 2014
- [c4]Marc Baboulin, Xiaoye S. Li, François-Henry Rouet:
Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods. VECPAR 2014: 135-144 - [c3]Patrick Amestoy, Jean-Yves L'Excellent, François-Henry Rouet, Wissam M. Sid-Lakhdar:
Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver. VECPAR 2014: 156-169 - 2013
- [j2]Laurent Bouchet, Patrick Amestoy, Alfredo Buttari, François-Henry Rouet, Maxime Chauvin:
Simultaneous analysis of large INTEGRAL/SPI datasets: Optimizing the computation of the solution and its variance using sparse matrix algorithms. Astron. Comput. 1: 59-69 (2013) - [c2]Ichitaro Yamazaki, Xiaoye S. Li, François-Henry Rouet, Bora Uçar:
On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver. IPDPS Workshops 2013: 1391-1400 - 2012
- [b1]François-Henry Rouet:
Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides. (Problèmes de mémoire et de performance de la factorisation multifrontale parallèle et de la résolution triangulaire à seconds membres creux). National Polytechnic Institute of Toulouse, France, 2012 - [j1]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Yves Robert, François-Henry Rouet, Bora Uçar:
On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment. SIAM J. Sci. Comput. 34(4) (2012) - 2011
- [c1]Kamer Kaya, François-Henry Rouet, Bora Uçar:
On Partitioning Problems with Complex Objectives. Euro-Par Workshops (1) 2011: 334-344
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-04-24 23:08 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:
