Generalized Filtering Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Generalized Filtering Decomposition

Laura Grigori
Frédéric Nataf


This paper introduces a new preconditioning technique that is suitable for matrices arising from the discretization of a system of PDEs on unstructured grids. The preconditioner satisfies a so-called filtering property, which ensures that the input matrix is identical with the preconditioner on a given filtering vector. This vector is chosen to alleviate the effect of low frequency modes on convergence and so decrease or eliminate the plateau which is often observed in the convergence of iterative methods. In particular, the paper presents a general approach that allows to ensure that the filtering condition is satisfied in a matrix decomposition. The input matrix can have an arbitrary sparse structure. Hence, it can be reordered using nested dissection, to allow a parallel computation of the preconditioner and of the iterative process.
Fichier principal
Vignette du fichier
RR-7569.pdf (158.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00576894 , version 1 (15-03-2011)


  • HAL Id : inria-00576894 , version 1
  • ARXIV : 1103.3026


Laura Grigori, Frédéric Nataf. Generalized Filtering Decomposition. [Research Report] RR-7569, INRIA. 2011, pp.8. ⟨inria-00576894⟩
266 View
123 Download



Gmail Facebook X LinkedIn More