Остановите войну!
for scientists:
default search action
Patrick Amestoy
- > Home > Persons > Patrick Amestoy
Publications
- 2024
- [j33]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) - [j32]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) - 2023
- [j31]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) - 2019
- [j30]Patrick R. Amestoy, Jean-Yves L'Excellent, Gilles Moreau:
On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers. SIAM J. Sci. Comput. 41(1): A269-A291 (2019) - [j29]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) - [j28]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) - 2017
- [j27]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) - 2016
- [j26]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) - 2015
- [j25]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) - [j24]Patrick Amestoy, Cleve Ashcraft, Olivier Boiteau, Alfredo Buttari, Jean-Yves L'Excellent, Clément Weisbecker:
Improving Multifrontal Methods by Means of Block Low-Rank Representations. SIAM J. Sci. Comput. 37(3) (2015) - 2014
- [c11]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 - 2012
- [j22]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
- [r2]Patrick Amestoy, Alfredo Buttari, Iain S. Duff, Abdou Guermouche, Jean-Yves L'Excellent, Bora Uçar:
Multifrontal Method. Encyclopedia of Parallel Computing 2011: 1209-1216 - [r1]Patrick Amestoy, Alfredo Buttari, Iain S. Duff, Abdou Guermouche, Jean-Yves L'Excellent, Bora Uçar:
Mumps. Encyclopedia of Parallel Computing 2011: 1232-1238 - 2009
- [j20]Florent Sourbier, Stéphane Operto, Jean Virieux, Patrick Amestoy, Jean-Yves L'Excellent:
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data - Part 1: Algorithm. Comput. Geosci. 35(3): 487-495 (2009) - [j19]Florent Sourbier, Stéphane Operto, Jean Virieux, Patrick Amestoy, Jean-Yves L'Excellent:
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data - Part 2: Numerical examples and scalability analysis. Comput. Geosci. 35(3): 496-514 (2009) - 2006
- [j18]Patrick Amestoy, Abdou Guermouche, Jean-Yves L'Excellent, Stéphane Pralet:
Hybrid scheduling for the parallel solution of linear systems. Parallel Comput. 32(2): 136-156 (2006) - 2003
- [j13]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Xiaoye S. Li:
Impact of the implementation of MPI point-to-point communications on the performance of two general sparse solvers. Parallel Comput. 29(7): 833-849 (2003) - 2001
- [j10]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Jacko Koster:
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling. SIAM J. Matrix Anal. Appl. 23(1): 15-41 (2001) - [j9]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Xiaoye S. Li:
Analysis and comparison of two general sparse solvers for distributed memory computers. ACM Trans. Math. Softw. 27(4): 388-421 (2001) - [c6]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Xiaoye S. Li:
Performance and tuning of two distributed memory sparse solvers. PPSC 2001 - 2000
- [c5]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Jacko Koster:
MUMPS : A General Purpose Distributed Memory Sparse Solver. PARA 2000: 121-130 - 1999
- [c3]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent:
The PARASOL Project and the Multifrontal Parallel Solver for Sparse Systems. PPSC 1999 - 1998
- [c2]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent:
Multifrontal Solvers Within the PARASOL Environment. PARA 1998: 7-11
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-02 22: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