From 8443f7fe715e0a6f44e87e0cb2f4bc10ff2dc3b6 Mon Sep 17 00:00:00 2001 From: Matthias Maier Date: Mon, 11 Feb 2019 18:46:19 -0600 Subject: [PATCH] Address J.-P.'s comments --- examples/step-20/doc/intro.dox | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/examples/step-20/doc/intro.dox b/examples/step-20/doc/intro.dox index 7a836f0edf..844507e93f 100644 --- a/examples/step-20/doc/intro.dox +++ b/examples/step-20/doc/intro.dox @@ -605,6 +605,10 @@ creating another solver and inverse: U = op_M_inv * (F - op_B * P); @endcode +@note The functionality that we developed in this example step by hand is +already readily available in the library. Have a look at +schur_complement(), condense_schur_rhs(), and postprocess_schur_solution(). +

A preconditioner for the Schur complement

-- 2.39.5