On finding approximate supernodes for an efficient ILU(k) factorization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Parallel Computing Year : 2008
No file

Dates and versions

inria-00346018 , version 1 (10-12-2008)

Identifiers

  • HAL Id : inria-00346018 , version 1

Cite

Pascal Hénon, Pierre Ramet, Jean Roman. On finding approximate supernodes for an efficient ILU(k) factorization. Parallel Computing, 2008, 34, pp.345--362. ⟨inria-00346018⟩
135 View
0 Download

Share

Gmail Facebook X LinkedIn More