From b7ab3a799c48502a4be3a70b11cba0dbf8caff56 Mon Sep 17 00:00:00 2001 From: "ryan.grove" Date: Mon, 10 Feb 2014 01:59:13 +0000 Subject: [PATCH] Fixed typos in step-2 tutorial, step-6.cc, and to the Function< dim > documentation. git-svn-id: https://svn.dealii.org/trunk@32442 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/doxygen/headers/glossary.h | 2 +- deal.II/examples/step-2/doc/intro.dox | 2 +- deal.II/examples/step-6/step-6.cc | 2 +- deal.II/include/deal.II/base/function.h | 4 ++-- 4 files changed, 5 insertions(+), 5 deletions(-) diff --git a/deal.II/doc/doxygen/headers/glossary.h b/deal.II/doc/doxygen/headers/glossary.h index 8117be9be1..5c10bf22dc 100644 --- a/deal.II/doc/doxygen/headers/glossary.h +++ b/deal.II/doc/doxygen/headers/glossary.h @@ -588,7 +588,7 @@ * is a vector of expension coefficients. Because we don't know their values * yet (we will compute them as the solution of a linear or nonlinear system), * they are called "unknowns" or "degrees of freedom". The second meaning of - * the term con be explained as follows: A mathematical description of finite + * the term can be explained as follows: A mathematical description of finite * element problem is often to say that we are looking for a finite * dimensional function $u_h \in V_h$ that satisfies some set of equations * (e.g. $a(u_h,\varphi_h)=(f,\varphi_h)$ for all test functions $\varphi_h\in diff --git a/deal.II/examples/step-2/doc/intro.dox b/deal.II/examples/step-2/doc/intro.dox index 3c2412609a..61b5a33244 100644 --- a/deal.II/examples/step-2/doc/intro.dox +++ b/deal.II/examples/step-2/doc/intro.dox @@ -16,7 +16,7 @@ function, in the form $u_h(\mathbf x) = \sum_{j=0}^{N-1} U_j \varphi_j(\mathbf x)$. Here, $U_j$ is a vector of expansion coefficients. Because we don't know their values yet (we will compute them as the solution of a linear or nonlinear system), they are called "unknowns" or "degrees of freedom". The -second meaning of the term con be explained as follows: A mathematical +second meaning of the term can be explained as follows: A mathematical description of finite element problem is often to say that we are looking for a finite dimensional function $u_h \in V_h$ that satisfies some set of equations (e.g. $a(u_h,\varphi_h)=(f,\varphi_h)$ for all test functions $\varphi_h\in diff --git a/deal.II/examples/step-6/step-6.cc b/deal.II/examples/step-6/step-6.cc index e3fca00b1e..52dda1eb45 100644 --- a/deal.II/examples/step-6/step-6.cc +++ b/deal.II/examples/step-6/step-6.cc @@ -273,7 +273,7 @@ Step6::~Step6 () // The next function is setting up all the variables that describe the linear // finite element problem, such as the DoF handler, the matrices, and // vectors. The difference to what we did in step-5 is only that we now also -// have to take care of handing node constraints. These constraints are +// have to take care of hanging node constraints. These constraints are // handled almost transparently by the library, i.e. you only need to know // that they exist and how to get them, but you do not have to know how they // are formed or what exactly is done with them. diff --git a/deal.II/include/deal.II/base/function.h b/deal.II/include/deal.II/base/function.h index 616f6de210..19ddcd716d 100644 --- a/deal.II/include/deal.II/base/function.h +++ b/deal.II/include/deal.II/base/function.h @@ -193,7 +193,7 @@ public: * values already has the right size, i.e. the same size as the * points array. * - * Be default, this function repeatedly calls value() for each point + * By default, this function repeatedly calls value() for each point * separately, to fill the output array. */ virtual void value_list (const std::vector > &points, @@ -207,7 +207,7 @@ public: * all elements be vectors with the same number of components as this * function has. * - * Be default, this function repeatedly calls vector_value() for each + * By default, this function repeatedly calls vector_value() for each * point separately, to fill the output array. */ virtual void vector_value_list (const std::vector > &points, -- 2.39.5