### Skapa referens, olika format (klipp och klistra)

**Harvard**

Vidal, A., González-Pintor, S., Ginestar, D., Verdu, G. och Demazière, C. (2016) *Schwarz type preconditioners for the neutron diffusion equation *.

** BibTeX **

@article{

Vidal2016,

author={Vidal, Antoni and González-Pintor, Sebastian and Ginestar, Damian and Verdu, Gumersindo and Demazière, Christophe},

title={Schwarz type preconditioners for the neutron diffusion equation },

journal={Journal of Computational and Applied Mathematics},

issn={0377-0427},

volume={Epub ahead of print},

abstract={Domain decomposition is a mature methodology that has been used to accelerate the convergence of partial differential equations. Even if it was devised as a solver by itself, it is usually employed together with Krylov iterative methods improving its rate of convergence, and providing scalability with respect to the size of the problem.
In this work, a high order finite element discretization of the neutron diffusion equation is considered. In this problem the preconditioning of large and sparse linear systems arising from a source driven formulation becomes necessary due to the complexity of the problem. On the other hand, preconditioners based on an incomplete factorization are very expensive from the point of view of memory requirements. The acceleration of the neutron diffusion equation is thus studied here by using alternative preconditioners based on domain decomposition techniques inside Schur complement methodology. The study considers substructuring preconditioners, which do not involve overlapping, and additive Schwarz preconditioners, where some overlapping between the subdomains is taken into account.
The performance of the different approaches is studied numerically using two-dimensional and three-dimensional problems. It is shown that some of the proposed methodologies outperform incomplete LU factorization for preconditioning as long as the linear system to be solved is large enough, as it occurs for three-dimensional problems. They also outperform classical diagonal Jacobi preconditioners, as long as the number of systems to be solved is large enough in such a way that the overhead of building the preconditioner is less than the improvement in the convergence rate.},

year={2016},

keywords={Neutron diffusion, Finite element method, Substructuring, Schwarz preconditioner},

}

** RefWorks **

RT Journal Article

SR Electronic

ID 234870

A1 Vidal, Antoni

A1 González-Pintor, Sebastian

A1 Ginestar, Damian

A1 Verdu, Gumersindo

A1 Demazière, Christophe

T1 Schwarz type preconditioners for the neutron diffusion equation

YR 2016

JF Journal of Computational and Applied Mathematics

SN 0377-0427

VO Epub ahead of print

AB Domain decomposition is a mature methodology that has been used to accelerate the convergence of partial differential equations. Even if it was devised as a solver by itself, it is usually employed together with Krylov iterative methods improving its rate of convergence, and providing scalability with respect to the size of the problem.
In this work, a high order finite element discretization of the neutron diffusion equation is considered. In this problem the preconditioning of large and sparse linear systems arising from a source driven formulation becomes necessary due to the complexity of the problem. On the other hand, preconditioners based on an incomplete factorization are very expensive from the point of view of memory requirements. The acceleration of the neutron diffusion equation is thus studied here by using alternative preconditioners based on domain decomposition techniques inside Schur complement methodology. The study considers substructuring preconditioners, which do not involve overlapping, and additive Schwarz preconditioners, where some overlapping between the subdomains is taken into account.
The performance of the different approaches is studied numerically using two-dimensional and three-dimensional problems. It is shown that some of the proposed methodologies outperform incomplete LU factorization for preconditioning as long as the linear system to be solved is large enough, as it occurs for three-dimensional problems. They also outperform classical diagonal Jacobi preconditioners, as long as the number of systems to be solved is large enough in such a way that the overhead of building the preconditioner is less than the improvement in the convergence rate.

LA eng

DO 10.1016/j.cam.2016.02.056

LK http://dx.doi.org/10.1016/j.cam.2016.02.056

OL 30