From: kanschat Date: Mon, 2 Apr 2012 20:56:52 +0000 (+0000) Subject: Fix documentation X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ffcd4f190ca429d85a645853e77735e686b41444;p=dealii-svn.git Fix documentation git-svn-id: https://svn.dealii.org/trunk@25371 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/include/deal.II/multigrid/mg_coarse.h b/deal.II/include/deal.II/multigrid/mg_coarse.h index 295a22a8d2..7a2dba4035 100644 --- a/deal.II/include/deal.II/multigrid/mg_coarse.h +++ b/deal.II/include/deal.II/multigrid/mg_coarse.h @@ -111,21 +111,14 @@ class MGCoarseGridLACIteration : public MGCoarseGridBase -//TODO: Improve QR-factorization to make this more efficient. - /** - * Coarse grid solver by QR factorization - * - * This is a direct solver for possibly indefinite coarse grid - * problems, using the @p least_squares function of the class - * FullMatrix. + * Coarse grid solver by QR factorization implemented in the class Householder. * - * Since the currently implemented Householder algorithm transforms - * the right hand side immediately, the transformation has to be - * computed for each coarse grid solution. Therefore, this coarse grid - * solver may be inefficient for larger coarse grid systems. + * Upon initialization, the QR decomposition of the matrix is + * computed. then, the operator() uses Householder::least_squares() to + * compute the action of the inverse. * - * @author Guido Kanschat, 2003 + * @author Guido Kanschat, 2003, 2012 */ template > class MGCoarseGridHouseholder : public MGCoarseGridBase