default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Hénon
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Hussam Al Daas
, Laura Grigori, Pascal Hénon, Philippe Ricoux:
Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems. ACM Trans. Math. Softw. 47(2): 13:1-13:30 (2021)
2010 – 2019
- 2016
- [j6]Serge Gratton, Pascal Hénon, Pavel Jiránek, Xavier Vasseur:
Reducing complexity of algebraic multigrid by aggregation. Numer. Linear Algebra Appl. 23(3): 501-518 (2016) - 2013
- [c8]Corentin Rossignon, Pascal Hénon, Olivier Aumage, Samuel Thibault:
A NUMA-Aware Fine Grain Parallelization Framework for Multi-core Architecture. IPDPS Workshops 2013: 1381-1390
2000 – 2009
- 2008
- [j5]Pascal Hénon, Pierre Ramet, Jean Roman:
On finding approximate supernodes for an efficient block-ILU(k. Parallel Comput. 34(6-8): 345-362 (2008) - [c7]Jérémie Gaidamour, Pascal Hénon:
A Parallel Direct/Iterative Solver Based on a Schur Complement Approach. CSE 2008: 98-105 - 2006
- [j4]Pascal Hénon, Yousef Saad:
A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition. SIAM J. Sci. Comput. 28(6): 2266-2293 (2006) - [c6]Pascal Hénon, Pierre Ramet, Jean Roman:
Partitioning and Blocking Issues for a Parallel Incomplete Factorization. PARA 2006: 929-937 - 2005
- [c5]Pascal Hénon, Pierre Ramet, Jean Roman:
On Using an Hybrid MPI-Thread Programming for the Implementation of a Parallel Sparse Direct Solver on a Network of SMP Nodes. PPAM 2005: 1050-1057 - 2004
- [c4]Pascal Hénon, François Pellegrini, Pierre Ramet, Jean Roman, Yousef Saad:
Applying Parallel Direct Solver Techniques to Build Robust High Performance Preconditioners. PARA 2004: 611-619 - 2003
- [j3]Olivier Coulaud, Michaël Dussere, Pascal Hénon, Erik Lefebvre, Jean Roman:
Optimization of a kinetic laser-plasma interaction code for large parallel systems. Parallel Comput. 29(9): 1175-1189 (2003) - 2002
- [j2]Pascal Hénon, Pierre Ramet, Jean Roman:
PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems. Parallel Comput. 28(2): 301-321 (2002) - 2001
- [c3]Pascal Hénon, Pierre Ramet, Jean Roman:
PASTIX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment. PP 2001 - 2000
- [j1]David Goudin, Pascal Hénon, François Pellegrini, Pierre Ramet, Jean Roman, Jean-Jacques Pesqué:
Parallel sparse linear algebra and application to structural mechanics. Numer. Algorithms 24(4): 371-391 (2000) - [c2]Pascal Hénon, Pierre Ramet, Jean Roman:
PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions. IPDPS Workshops 2000: 519-527
1990 – 1999
- 1999
- [c1]Pascal Hénon, Pierre Ramet, Jean Roman:
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization. Euro-Par 1999: 1059-1067
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-07-04 21:24 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:
