From cc586243035467c2748deb5bee2f2b65f0a36271 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Sat, 1 Aug 2009 17:51:07 +0000 Subject: [PATCH] A couple of typo fixes. git-svn-id: https://svn.dealii.org/trunk@19163 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-36/doc/intro.dox | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/deal.II/examples/step-36/doc/intro.dox b/deal.II/examples/step-36/doc/intro.dox index 32fb3ea090..0ebb822748 100644 --- a/deal.II/examples/step-36/doc/intro.dox +++ b/deal.II/examples/step-36/doc/intro.dox @@ -33,8 +33,8 @@ no longer just a single solution, but a set of solutions (the various eigenfunctions and corresponding eigenvalues) that we want to compute. The problem of numerically finding all eigenvalues (eigenfunctions) of such eigenvalue problems is a formidable -challange. In fact, if the set $\cal I$ is infinite, the callange is -insurmountable. Most of the time however we are really only +challenge. In fact, if the set $\cal I$ is infinite, the challenge is +of course intractable. Most of the time however we are really only interested in a small subset of these values (functions); and fortunately, the interface to the SLEPc library that we will use for this tutorial program allows us to select which portion of the -- 2.39.5