From adfde8e0431125ffdf2575a960ded8fe2cb848b3 Mon Sep 17 00:00:00 2001 From: Daniel Arndt Date: Thu, 8 Oct 2020 17:58:29 -0400 Subject: [PATCH] One more --- examples/step-50/doc/intro.dox | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/examples/step-50/doc/intro.dox b/examples/step-50/doc/intro.dox index 21d34cdb1c..10c6c0dad8 100644 --- a/examples/step-50/doc/intro.dox +++ b/examples/step-50/doc/intro.dox @@ -29,10 +29,10 @@ in step-16 (but for parallel computations) and a matrix-free version discussed in step-37. The goal is to find out which approach leads to the best solver for large parallel computations. -This tutorial is based on one of the numerical examples in @cite -clevenger_par_gmg. Please see that publication for a detailed background on -the multigrid implementation in deal.II. We will summarize some of the results -in the following text. +This tutorial is based on one of the numerical examples in +@cite clevenger_par_gmg. Please see that publication for a detailed background +on the multigrid implementation in deal.II. We will summarize some of the +results in the following text. Algebraic multigrid methods are obviously the easiest to implement with deal.II since classes such as TrilinosWrappers::PreconditionAMG -- 2.39.5