From e1e487d65b523237f7b6f91b40141eb4dc189271 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Mon, 6 Jul 2009 18:50:17 +0000 Subject: [PATCH] Add a point to the list. git-svn-id: https://svn.dealii.org/trunk@19035 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-36/doc/intro.dox | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/deal.II/examples/step-36/doc/intro.dox b/deal.II/examples/step-36/doc/intro.dox index 8d6c56429e..b2e4e82c2b 100644 --- a/deal.II/examples/step-36/doc/intro.dox +++ b/deal.II/examples/step-36/doc/intro.dox @@ -41,6 +41,12 @@ The program below is essentially just a slightly modified version of @ref step_18 "step-18" since that is what the SLEPc eigenvalue solvers require. +- The function EigenvalueProblem::solve is entirely + different from anything seen so far in the tutorial, as it does not + just solve a linear system but actually solves the eigenvalue problem. + It is built on the SLEPc library, and more immediately on the deal.II + SLEPc wrappers in the class SLEPcWrappers::SolverKrylovSchur. + - We use the ParameterHandler class to describe a few input parameters, such as the exact form of the potential $V(\mathbf x)$, the number of global refinement steps of the mesh, or the number of eigenvalues -- 2.39.5