From 094a1d2acb10c2fc946e5e9728427c9790f30744 Mon Sep 17 00:00:00 2001 From: Matthias Maier Date: Wed, 13 Feb 2019 16:51:16 -0600 Subject: [PATCH] examples/step-20: Simplify code by using a temporary --- examples/step-20/step-20.cc | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/examples/step-20/step-20.cc b/examples/step-20/step-20.cc index f1b12f6e18..89ed11124b 100644 --- a/examples/step-20/step-20.cc +++ b/examples/step-20/step-20.cc @@ -613,10 +613,9 @@ namespace Step20 // applies a fixed number of 30 (inexpensive) CG iterations: IterationNumberControl iteration_number_control_aS(30, 1.e-18); SolverCG<> solver_aS(iteration_number_control_aS); - PreconditionIdentity preconditioner_aS; const auto preconditioner_S = - inverse_operator(op_aS, solver_aS, preconditioner_aS); + inverse_operator(op_aS, solver_aS, PreconditionIdentity()); // Now on to the first equation. The right hand side of it is // $B^TM^{-1}F-G$, which is what we compute in the first few lines. We -- 2.39.5