Остановите войну!
for scientists:
default search action
Jean Roman
- > Home > Persons > Jean Roman
Publications
- 2018
- [j27]Gregoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman:
Sparse supernodal solver using block low-rank compression: Design, performance and analysis. J. Comput. Sci. 27: 255-270 (2018) - 2017
- [j24]Gregoire Pichon, Mathieu Faverge, Pierre Ramet, Jean Roman:
Reordering Strategy for Blocking Optimization in Sparse Linear Solvers. SIAM J. Matrix Anal. Appl. 38(1): 226-248 (2017) - [c39]Gregoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman:
Sparse Supernodal Solver Using Block Low-Rank Compression. IPDPS Workshops 2017: 1138-1147 - 2014
- [c35]Astrid Casadei, Pierre Ramet, Jean Roman:
An improved recursive graph bipartitioning algorithm for well balanced domain decomposition. HiPC 2014: 1-10 - 2011
- [j18]Maxime Barrault, Bruno Lathuilière, Pierre Ramet, Jean Roman:
Efficient parallel resolution of the simplified transport equations in mixed-dual formulation. J. Comput. Phys. 230(5): 2004-2020 (2011) - 2008
- [j14]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) - [c32]Maxime Barrault, Bruno Lathuilière, Pierre Ramet, Jean Roman:
A Domain Decomposition Method Applied to the Simplified Transport Equations. CSE 2008: 91-97 - 2006
- [c27]Pascal Hénon, Pierre Ramet, Jean Roman:
Partitioning and Blocking Issues for a Parallel Incomplete Factorization. PARA 2006: 929-937 - 2005
- [c24]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
- [c23]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
- [c21]Olivier Beaumont, Pierre Ramet, Jean Roman:
Asymptotically Optimal Algorithm for Laplace Task Graphs on Heterogeneous Platforms. PPAM 2003: 880-887 - 2002
- [j10]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
- [j9]Eddy Caron, Serge Chaumette, Sylvain Contassot-Vivier, Frederic Desprez, Eric Fleury, Claude Gomez, Maurice Goursat, Martin Quinson, Emmanuel Jeannot, Dominique Lazure, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe, Pierre Ramet, Jean Roman, Frank Rubi, Serge Steer, Frédéric Suter, Gil Utard:
SCILAB to SCILAB//: The OURAGAN project. Parallel Comput. 27(11): 1497-1519 (2001) - [c19]Pascal Hénon, Pierre Ramet, Jean Roman:
PASTIX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment. PPSC 2001 - 2000
- [j7]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) - [c18]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 - 1999
- [c13]Pascal Hénon, Pierre Ramet, Jean Roman:
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization. Euro-Par 1999: 1059-1067 - 1996
- [c7]Frederic Desprez, Pierre Ramet, Jean Roman:
Optimal Grain Size Computation for Pipelined Algorithms. Euro-Par, Vol. I 1996: 165-172
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-25 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint