Pierre Ramet
Pierre Ramet
About
Posts
Projects
Publications
HAL
BIB
Contact
CV
Light
Dark
Automatic
On finding approximate supernodes for an efficient ILU(k) factorization
P. Hénon
,
P. Ramet
,
J. Roman
September 2006
PDF
Cite
Type
Conference paper
Publication
Proceedings of PMAA'2006
Sparse
Related
A Parallel Multilevel ILU Factorization based on a Hierarchical Graph Decomposition
On finding approximate supernodes for an efficient ILU(k) factorization
A Blockwise Algorithm for Parallel Incomplete Cholesky Factorization
Etude sur l'applicabilité de mt́hodes it'átives nouvelles aux problèmes du CESTA
Heterogeneous architectures, Hybrid methods, Hierarchical matrices for Sparse Linear Solvers
Cite
×