]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Find and review a large number of typos. (Thanks, Matthias Maier, for running the...
authorbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 29 May 2012 19:16:36 +0000 (19:16 +0000)
committerbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 29 May 2012 19:16:36 +0000 (19:16 +0000)
git-svn-id: https://svn.dealii.org/trunk@25560 0785d39b-7218-0410-832d-ea1e28bc413d

137 files changed:
deal.II/doc/doxygen/headers/distributed.h
deal.II/doc/doxygen/headers/exceptions.h
deal.II/doc/doxygen/headers/glossary.h
deal.II/doc/doxygen/headers/io.h
deal.II/doc/doxygen/headers/iterators.h
deal.II/doc/doxygen/headers/multithreading.h
deal.II/doc/doxygen/headers/numerical_algorithms.h
deal.II/doc/doxygen/headers/update_flags.h
deal.II/doc/doxygen/tutorial/toc-list.html
deal.II/doc/doxygen/tutorial/toc-topics.html
deal.II/doc/external-libs/arpack.html
deal.II/doc/external-libs/mumps.html
deal.II/doc/news/2000/3.0.0-vs-3.1.0.html
deal.II/doc/news/2001/3.1.0-vs-3.2.0.html
deal.II/doc/news/3.4.0-vs-4.0.0.html
deal.II/doc/news/4.0.0-vs-5.0.0.html
deal.II/doc/news/5.2.0-vs-6.0.0.html
deal.II/doc/news/6.0.0-vs-6.1.0.h
deal.II/doc/news/6.1.0-vs-6.2.0.h
deal.II/doc/news/6.2.0-vs-6.3.0.h
deal.II/doc/news/7.0.0-vs-7.1.0.h
deal.II/doc/news/changes.h
deal.II/doc/reports/dimension-independent/index.html
deal.II/doc/reports/mapping_q/index.html
deal.II/doc/reports/multithreading/node12.html
deal.II/examples/step-10/doc/results.dox
deal.II/examples/step-13/doc/results.dox
deal.II/examples/step-14/doc/results.dox
deal.II/examples/step-14/step-14.cc
deal.II/examples/step-15/step-15.cc
deal.II/examples/step-17/doc/intro.dox
deal.II/examples/step-18/step-18.cc
deal.II/examples/step-2/step-2.cc
deal.II/examples/step-20/doc/results.dox
deal.II/examples/step-21/doc/intro.dox
deal.II/examples/step-22/doc/intro.dox
deal.II/examples/step-22/doc/results.dox
deal.II/examples/step-22/step-22.cc
deal.II/examples/step-24/doc/intro.dox
deal.II/examples/step-25/doc/intro.dox
deal.II/examples/step-25/step-25.cc
deal.II/examples/step-28/step-28.cc
deal.II/examples/step-29/doc/results.dox
deal.II/examples/step-31/step-31.cc
deal.II/examples/step-32/step-32.cc
deal.II/examples/step-33/doc/intro.dox
deal.II/examples/step-33/doc/results.dox
deal.II/examples/step-33/step-33.cc
deal.II/examples/step-34/step-34.cc
deal.II/examples/step-36/step-36.cc
deal.II/examples/step-4/doc/intro.dox
deal.II/examples/step-43/step-43.cc
deal.II/examples/step-46/doc/intro.dox
deal.II/examples/step-5/step-5.cc
deal.II/include/deal.II/algorithms/newton.h
deal.II/include/deal.II/base/conditional_ostream.h
deal.II/include/deal.II/base/data_out_base.h
deal.II/include/deal.II/base/exceptions.h
deal.II/include/deal.II/base/function.h
deal.II/include/deal.II/base/function_parser.h
deal.II/include/deal.II/base/geometry_info.h
deal.II/include/deal.II/base/logstream.h
deal.II/include/deal.II/base/memory_consumption.h
deal.II/include/deal.II/base/parameter_handler.h
deal.II/include/deal.II/base/tensor_base.h
deal.II/include/deal.II/base/thread_local_storage.h
deal.II/include/deal.II/base/thread_management.h
deal.II/include/deal.II/distributed/tria.h
deal.II/include/deal.II/dofs/dof_faces.h
deal.II/include/deal.II/dofs/dof_handler.h
deal.II/include/deal.II/dofs/dof_levels.h
deal.II/include/deal.II/dofs/dof_renumbering.h
deal.II/include/deal.II/fe/fe.h
deal.II/include/deal.II/fe/fe_q_hierarchical.h
deal.II/include/deal.II/fe/fe_tools.h
deal.II/include/deal.II/fe/mapping.h
deal.II/include/deal.II/grid/grid_out.h
deal.II/include/deal.II/grid/grid_reordering_internal.h
deal.II/include/deal.II/grid/grid_tools.h
deal.II/include/deal.II/grid/tria_faces.h
deal.II/include/deal.II/grid/tria_iterator.h
deal.II/include/deal.II/grid/tria_levels.h
deal.II/include/deal.II/grid/tria_objects.h
deal.II/include/deal.II/hp/dof_faces.h
deal.II/include/deal.II/hp/dof_handler.h
deal.II/include/deal.II/lac/block_vector_base.h
deal.II/include/deal.II/lac/constraint_matrix.h
deal.II/include/deal.II/lac/exceptions.h
deal.II/include/deal.II/lac/full_matrix.h
deal.II/include/deal.II/lac/matrix_block.h
deal.II/include/deal.II/lac/parallel_vector.h
deal.II/include/deal.II/lac/petsc_matrix_base.h
deal.II/include/deal.II/lac/petsc_solver.h
deal.II/include/deal.II/lac/petsc_vector_base.h
deal.II/include/deal.II/lac/relaxation_block.h
deal.II/include/deal.II/lac/slepc_solver.h
deal.II/include/deal.II/lac/solver.h
deal.II/include/deal.II/lac/sparse_decomposition.h
deal.II/include/deal.II/lac/sparse_direct.h
deal.II/include/deal.II/lac/sparse_matrix_ez.h
deal.II/include/deal.II/lac/sparsity_pattern.h
deal.II/include/deal.II/lac/tridiagonal_matrix.h
deal.II/include/deal.II/lac/trilinos_solver.h
deal.II/include/deal.II/lac/trilinos_sparse_matrix.h
deal.II/include/deal.II/lac/trilinos_sparsity_pattern.h
deal.II/include/deal.II/lac/trilinos_vector_base.h
deal.II/include/deal.II/lac/vector.h
deal.II/include/deal.II/lac/vector_view.h
deal.II/include/deal.II/meshworker/functional.h
deal.II/include/deal.II/meshworker/integration_info.h
deal.II/include/deal.II/meshworker/vector_selector.h
deal.II/include/deal.II/multigrid/mg_tools.h
deal.II/include/deal.II/numerics/data_out.h
deal.II/include/deal.II/numerics/fe_field_function.templates.h
deal.II/include/deal.II/numerics/solution_transfer.h
deal.II/include/deal.II/numerics/time_dependent.h
deal.II/include/deal.II/numerics/vectors.h
deal.II/source/base/convergence_table.cc
deal.II/source/base/data_out_base.cc
deal.II/source/base/multithread_info.cc
deal.II/source/base/quadrature.cc
deal.II/source/dofs/dof_handler.cc
deal.II/source/dofs/dof_handler_policy.cc
deal.II/source/fe/fe.cc
deal.II/source/fe/fe_system.cc
deal.II/source/fe/fe_tools.cc
deal.II/source/fe/mapping_q.cc
deal.II/source/grid/grid_generator.cc
deal.II/source/grid/grid_reordering.cc
deal.II/source/grid/intergrid_map.cc
deal.II/source/grid/tria.cc
deal.II/source/grid/tria_accessor.cc
deal.II/source/hp/dof_handler.cc
deal.II/source/lac/solver_control.cc
deal.II/source/multigrid/mg_transfer_block.cc
deal.II/source/multigrid/mg_transfer_prebuilt.cc
deal.II/source/numerics/data_out.cc

index a733ed9eb722126cb9a990b04d93227354deba9b..b549dd4c8389249302d01e3085c380a809240576 100644 (file)
  * CompressedSimpleSparsityPattern indicates that it should store too few rows
  * of the matrix, the program will either abort when you attempt to write into
  * matrix entries that do not exist or the matrix class will silently allocate
- * more memory to accomodate them. As a consequence, it is useful to err on
+ * more memory to accommodate them. As a consequence, it is useful to err on
  * the side of caution when indicating which constraints to store and use the
  * result of DoFTools::extract_locally_relevant_dofs() rather than
  * DoFTools::extract_locally_active_dofs() . This is also affordable since the
index 761ed8114fe2d693455669efaecaa1fd2cd515e8..c39d08dd41c2c9ded49b180c3cd1a82f035b5e1e 100644 (file)
  *  (Note that function names and exact calling sequences may change
  *  over time, but the general principle remains the same.) I.e., if
  *  the given condition is violated, then the file and line in which
- *  the exception occured as well as the condition itself and the call
+ *  the exception occurred as well as the condition itself and the call
  *  sequence of the exception object is passed to the
  *  deal_II_exceptions::internals::issue_error_assert_1()
  *  function. Additionally an object of the form given by <tt>exc</tt>
index 89b313db880c059fba47ef8bc6bd3172a739ca45..797fed3e12e58f50811681c977c9f2068380021e 100644 (file)
@@ -738,7 +738,7 @@ Article{BK07,
  *
  * <dt class="glossary">@anchor GlossMaterialId <b>Material id</b></dt>
  * <dd>Each cell of a triangulation has associated with it a property called
- * "material id". It is commonly used in problems with heterogenous
+ * "material id". It is commonly used in problems with heterogeneous
  * coefficients to identify which part of the domain a cell is in and,
  * consequently, which value the coefficient should have on this particular
  * cell. The material id is inherited from mother to child cell upon mesh
index 9d5666d1d5e237c30715d2781b01363161953355..4fed985a4e969c2b72ec7a6ec9a37e90076ebe2f 100644 (file)
@@ -28,7 +28,7 @@
  *
  * In addition, deal.II can read an intermediate graphics format using the
  * DataOutReader. This format is used as an intermediate step between data
- * associated wiht a simulation and is written by the DataOutBase class (or
+ * associated with a simulation and is written by the DataOutBase class (or
  * through the more derived classes described in the \ref output module). The
  * DataOutReader class reads this data back in, and it can then be converted
  * to any of a number of data formats supported by visualization programs.
index 3fb574718a73280cd5f898245b9a135e613306d9..0ab81cc360cb5296e9f0b86ee734fac0a5eba661 100644 (file)
@@ -440,10 +440,10 @@ You can check this by calling the TriaAccessorBase::state() function.
 
 Past-the-end iterators may also be used to compare an iterator with
 the before-the-start value, when running backwards. There is no
-distiction between the iterators pointing past the two ends of a
+distinction between the iterators pointing past the two ends of a
 vector.
 
-Cells are stored based on a hierachical structure of levels, therefore the
+Cells are stored based on a hierarchical structure of levels, therefore the
 above mentioned structure is useful. Faces however are not organized in
 levels, and accessors for objects of lower dimensionality do not have a
 <code>present_level</code> member variable.
index 40407affe1407bafb5e563cb93868c902f6eda82..e4e9d9922868ebd4e13aedde010cb796807890f2 100644 (file)
  * bit more creative. The way chosen is to introduce a function
  * <code>new_task</code> that takes as arguments the function to call as well
  * as the arguments to the call. The <code>new_task</code> function is
- * overloaded to accomodate starting tasks with functions that take no, one,
+ * overloaded to accommodate starting tasks with functions that take no, one,
  * two, and up to 9 arguments. In deal.II, these functions live in the Threads
  * namespace. Consequently, the actual code for what we try to do above looks
  * like this:
index 9d009a792058a0ba9594afd189759f6b5c83e956..34ac3d345a4d39396a20a784a630d70e2641b96e 100644 (file)
@@ -21,7 +21,7 @@
  *
  * Some of the classes, like DerivativeApproximation, KellyErrorEstimator and
  * SolutionTransfer, act on solutions already obtained, and compute derived
- * quantities in the first two cases, or help transfering a set of vectors
+ * quantities in the first two cases, or help transferring a set of vectors
  * from one mesh to another.
  *
  * The remaining classes MatrixCreator, MatrixTools, and VectorTools provide
index 8d86e1381e9c154543f1caa737b8868994d6bd40..ed547b39cc5134f6fe77ef08da2e3ab1896b12ba 100644 (file)
@@ -101,7 +101,7 @@ of a FEValues object that uses a FE_RaviartThomas element, then we can set
 for the FiniteElement, but need to set <code>update_once=0</code>
 <code>update_each=update_jacobians</code> for the Mapping object.
 
-To accomodate this structure, at the time a FEValues object is constructed,
+To accommodate this structure, at the time a FEValues object is constructed,
 it asks both the FiniteElement and the Mapping object it uses the following:
 <ol>
 <li> Are any additional values required in order to compute the
index f00cd561a7d35f2d4373c6061c6982058abead5f..09dc3c5097cf1327926d9a7f1a665901905d3708 100644 (file)
   <tr valign="top">
       <td><a href="../../doxygen/deal.II/step_15.html">Step-15</a></td>
       <td> 1d problems, nonlinear solvers,
-      transfering a solution across mesh refinement.
+      transferring a solution across mesh refinement.
       </td></tr>
 
   <tr valign="top">
index d0b0662b021def343f956c1940a0ff9e8f37d5de..77646263e82e21cdfa6a2e3c4984144f21c6ebdf 100644 (file)
       <a href="../../doxygen/deal.II/step_40.html">Step-40</a>,
       <a href="../../doxygen/deal.II/step_43.html">Step-43</a>
     </td>
-    <td> Transfering solutions across mesh refinement
+    <td> Transferring solutions across mesh refinement
     </td>
   </tr>
 
index b42ca13c63245422ac8c670a0e41ea003f7d0239..b8b9c9443c93693f5b70b32fdf718e58fa5c3c0b 100644 (file)
@@ -42,7 +42,7 @@
 
     <p>
     Note: For compilation of <acronym>ARPACK</acronym> we emphasise
-    adding the compiler flag <code>-fPIC</code>. This is a definate
+    adding the compiler flag <code>-fPIC</code>. This is a definite
     requirement if we are compiling <acronym>deal.II</acronym> with
     shared libraries (which is the default). If we had preferred to be
     compiling <acronym>deal.II</acronym> without shared libraries,
index c8a2ae159c1eae2bc8c63b11963bd41d7db3a004..6749f1c2ccb56f39a3022f1c9e9ce30654a87efc 100644 (file)
        <li> Finally we add the flag <code>-fPIC</code> to the
          three compiler flag variables <code>OPTF</code>,
          <code>OPTC</code>, and <code>OPTL</code> which follow
-         imediately after the above. Without adding this last flag it
+         immediately after the above. Without adding this last flag it
          will not be possible to link <acronym>deal.II</acronym> with
          <acronym>MUMPS</acronym> as a shared library.
        </li>
     <p>
       Note: Throughout this description of the compilation process
       of <acronym>MUMPS</acronym> we have emphasised adding the
-      compiler flag <code>-fPIC</code>. This is a definate requirement
+      compiler flag <code>-fPIC</code>. This is a definite requirement
       if we are compiling <acronym>deal.II</acronym> with shared
       libraries (which is the default). If we had preferred to be
       compiling <acronym>deal.II</acronym> without shared libraries,
index c22b179f7adc1e7bc93fff5eb385a4b33ed0fb66..2a712c1e7229271a6fac7510ea6007cd114b820e 100644 (file)
@@ -453,7 +453,7 @@ documentation, etc</a>.
 
   <li> <p>
        New: <code class="class">SolverControl</code> has an interface
-       to <code class="class">ParameterHandler</code>, definining and
+       to <code class="class">ParameterHandler</code>, defining and
        reading parameters from a file automatically.
        <br>
        (GK 2000/05/24)
index 837c0f106d776136208270635057f16808b10ab6..2bacdd45b24445e03fbd104add726836aa59382e 100644 (file)
@@ -1002,7 +1002,7 @@ documentation, etc</a>.
 
   <li> <p>
        New: There is now a class <code class="class">MappingC1</code>
-       that implements a continously differentiable C<sup>1</sup>
+       that implements a continuously differentiable C<sup>1</sup>
        mapping of the boundary by using a cubic mapping with
        continuous derivatives at cell boundaries. The class presently
        only implements something for 2d and 1d (where it does nothing).
index 287ca1d2c43908efb8ef43275290a00eb3e337e1..23fde020fa7e2d772d5d2b1b1e986fd84ebb11d3 100644 (file)
@@ -747,7 +747,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK
   <li> <p>
        New: The interface for sparse decompositions has been abstracted, and
        there is now an Modified Incomplete Cholesky (MIC) decomposition in
-       addition to the Imcomplete LU (ILU) decomposition.
+       addition to the Incomplete LU (ILU) decomposition.
        <br>
        (Stephen Kolaroff 2002/11/27)
        </p>
@@ -1051,7 +1051,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK
        New: Checked in new <code class="class">GridGenerator</code> 
        member function <code class="member">half_hyper_ball</code>,
        derived from member <code class="member">hyper_ball</code>.     
-       The intial mesh contains four elements. This mesh will work with
+       The initial mesh contains four elements. This mesh will work with
        the boundary class <code class="class">HalfHyperBallBoundary</code>.
        <br>
        (Brian Carnes 2002/12/16)
@@ -1061,7 +1061,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK
        New: Checked in new class <code class="class">FE_Q_Hierarchical</code>
        derived from class <code class="class">FiniteElement</code>.  
        This element is analogous to <code class="class">FE_Q</code>, but 
-       makes use of hierachical shape functions, based on the 
+       makes use of hierarchical shape functions, based on the 
        <code class="class">Polynomials::Hierarchical</code> class. 
        For <code>degree&gt;1</code>, the non-nodal basis functions are "bubble"
        functions, which are not Lagrange polynomials. Therefore, the usual
index 897750a102987ba9ea5ad410a73ffe473ad62b5b..312bcf12a242fd16facbdf1b7309042e63d34dff 100644 (file)
@@ -523,7 +523,7 @@ inconvenience this causes.
 
   <li> <p> Fixed: The <code
        class="class">SolverMinRes</code> class had a nasty bug where we were
-       inadvertantly copying vectors; this could also have led to a memory
+       inadvertently copying vectors; this could also have led to a memory
        corruption bug. This is now fixed.
        <br>
        (WB 2004/02/26)
index fb3e80ab17a0a48ff72a5d8a134e60463a4e7fe8..27a8ea7b0e6720367f58777fb780410437617c65 100644 (file)
@@ -91,7 +91,7 @@ inconvenience this causes.
 
   <li> <p>
        Changed: Lower dimensional objects have been removed from the
-       hierachical structure of levels in <code
+       hierarchical structure of levels in <code
        class="class">TriaLevel</code>. Faces, i.e. lines in 2D and
        lines and quads in 3D, have no associated level
        anymore. Therefore, the level argument of some iterator
@@ -210,7 +210,7 @@ inconvenience this causes.
   <li> <p>
        Changed: The internal numbering of faces, lines and vertices
        has been reimplemented. Now the numbering scheme uses a
-       lexicographic ordering (with x running fastest) whereever
+       lexicographic ordering (with x running fastest) wherever
        possible. For more information on the new numbering scheme, see
        the <a
        href="http://ganymed.iwr.uni-heidelberg.de/pipermail/dealii/2005/000827.html">announcement</a>
@@ -280,9 +280,9 @@ inconvenience this causes.
                 lines of cells is in some cases a bit more complicated. The same applies,
        for example, 
                 to the extraction of the information, which child of a neighbor is behind
-                a given subface. However, this infomation is supplied by various
+                a given subface. However, this information is supplied by various
                 functions in <code class="class">GeometryInfo</code>. As a rule-of-thumb:
-                if you want to use non-standard meshes, all occurances of
+                if you want to use non-standard meshes, all occurrences of
                 <tt>face_orientation</tt> have to be supplemented by <tt>face_flip</tt>
                 and <tt>face_rotation</tt>.
        <br> In order to reduce the impact of possible bugs, the grid is still given to
index 7871cad9df8a8a3366da40ee48c7f58260d723e0..8d324cfc34da75166c364849aef180f2eed649c9 100644 (file)
@@ -66,7 +66,7 @@ inconvenience this causes.
   </p>
 
   <li> <p>Changed: The version number of the deal.II intermediate format written by
-  DataOutBase::write_deal_II_intermediate has been increased to 3 to accomodate the fact that
+  DataOutBase::write_deal_II_intermediate has been increased to 3 to accommodate the fact that
   we now support writing vector-valued data to output files in at least some output formats.
   (Previously, vector-valued date was written as a collection of scalar fields.) Since
   we can only read files written in intermediate format that has the same number as the
index e0fef796e91075f0508433fce12e8abee675402f..6de0c2aaa6301608d4e0f37ad206cd2f768fb012 100644 (file)
@@ -203,7 +203,7 @@ inconvenience this causes.
   New: A new tutorial program  step-34 was added to the
   library that shows the usage of the new codimension one functionality
   recently added to the library. In this tutorial we show the use of
-  bondary element methods on piecewise constant functions defined over
+  boundary element methods on piecewise constant functions defined over
   a surface, and we solve the irrotational flow problem, or exterior
   Neumann Laplace problem.
   <br>
index bb8d65297722363602d196f1be3d088b3b0e7415..d516c4fac404155b9930881a752882d29b6aed9c 100644 (file)
@@ -57,7 +57,7 @@ inconvenience this causes.
   <li>
   <p>
   Removed: The interface to PETSc has been simplified to better handle
-  incremental changes in PETSc versions and accomodate changes in
+  incremental changes in PETSc versions and accommodate changes in
   functionality between versions. As a part of this process, the
   deal.II configure script no longer handles PETSc versions
   &lt;2.3.0. Attempting to configure deal.II with PETSc versions that are
index 11b550b3918064e191f8319596f2ee90e836d470..6d4ef48ce170e8721864f08f05b5c465ef2975f3 100644 (file)
@@ -74,7 +74,7 @@ in connection to the changed outlined below for _1, _2, etc. Consequently,
 if the compiler used supports C++ 1x, we now selectively import elements of the
 compiler's namespace std into namespace std_cxx1x as well. This may lead to
 incompatibilities if you are already using elements of the C++ 1x
-standard by refering to them through the std_cxx1x namespace and these elements
+standard by referring to them through the std_cxx1x namespace and these elements
 are not on the list of selectively imported ones.
 <br>
 (Wolfgang Bangerth, 2011/05/29)
index 7102fa6c270caa504b41239c61c666a3b6a4b787..bb67db78afd594952c83ccf8f69c79d42170e1d6 100644 (file)
@@ -341,8 +341,8 @@ a valid output file.
 <li> Improved: <code>PETScWrappers::SolverXXX</code> class was
 restricted to using default solver options for the KSP only. It is now
 possible to override those by using PETSc command-line options
-<code>-ksp_*</code>; giving greater flexability in controling PETSc
-solvers. (See class documentation).
+<code>-ksp_*</code>; giving greater flexibility in controlling PETSc
+solvers. (See the class's documentation).
 <br>
 (Vijay S. Mahadevan, 2011/12/22)
 
index 10d42ca563cc0927191e1fe051fc6afc0acbeb5f..be5e7dc54451876f531f454938db9512ff0753a5 100644 (file)
@@ -590,7 +590,7 @@ time to implement an algorithm is often more significant than the time to
 actually execute it.
 
 <P>
-<B>Acknowledgments</B> Present development and maintainance of deal.II is a
+<B>Acknowledgments</B> Present development and maintenance of deal.II is a
 joint effort of several people at the University of Heidelberg, the University
 of Minneapolis, and elsewhere.  The author acknowledges the support by the
 German Research Association (DFG) through the Graduiertenkolleg and the SFB
index 706cadeb3f710468a4bb67005727ad1bd5c54f84..487a4d79ded4a8465c005fe301f0c59aff720e74 100644 (file)
@@ -65,7 +65,7 @@ to the element
  SRC="img9.gif"
  ALT="$K=\sigma_K(\hat K)$">
 in real space, whereas on cells <I>K</I> at the
-boundary, i.e. 
+boundary, i.e.
 <!-- MATH: $\partial K\cap\Gamma=\emptyset$ -->
 <IMG
  WIDTH="93" HEIGHT="34" ALIGN="MIDDLE" BORDER="0"
@@ -88,7 +88,7 @@ by first introducing some notation. Let <IMG
  SRC="img12.gif"
  ALT="$K\in T_h$">
 be a cell of the
-triangulation <I>T</I><SUB><I>h</I></SUB> with 
+triangulation <I>T</I><SUB><I>h</I></SUB> with
 <!-- MATH: $K=\sigma_K(\hat K)$ -->
 <IMG
  WIDTH="96" HEIGHT="41" ALIGN="MIDDLE" BORDER="0"
@@ -173,7 +173,7 @@ support points <IMG
  SRC="img15.gif"
  ALT="$i=0,\ldots,(p+1)^d-1$">,
 we define a
-<I>Q</I><SUB><I>p</I></SUB>-mapping 
+<I>Q</I><SUB><I>p</I></SUB>-mapping
 <!-- MATH: $\sigma\in [Q_p]^d$ -->
 <IMG
  WIDTH="75" HEIGHT="38" ALIGN="MIDDLE" BORDER="0"
@@ -292,7 +292,7 @@ shows the distributions of the unit support points <IMG
  WIDTH="174" HEIGHT="37" ALIGN="MIDDLE" BORDER="0"
  SRC="img22.gif"
  ALT="$i=0,\ldots,(p+1)^2-1$">
-for degrees 
+for degrees
 <!-- MATH: $p=1,\ldots,4$ -->
 <IMG
  WIDTH="96" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
@@ -312,7 +312,7 @@ Unit support points <IMG
  WIDTH="126" HEIGHT="37" ALIGN="MIDDLE" BORDER="0"
  SRC="img4.gif"
  ALT="$0\leq i<(p+1)^2$">,
-for degrees 
+for degrees
 <!-- MATH: $p=1,\ldots,4$ -->
 <IMG
  WIDTH="96" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
@@ -351,7 +351,7 @@ Let the ordering and numbering of the unit support points be as
 follows: first the corners, then the points on the edges and finally
 the inner support points, see also Figure
 <A HREF="index.html#fig:unit-mapping-points">2</A>.  Thus the first 4<I>p</I> points are placed
-on the boundary 
+on the boundary
 <!-- MATH: $\partial\hat K$ -->
 <IMG
  WIDTH="31" HEIGHT="21" ALIGN="BOTTOM" BORDER="0"
@@ -374,7 +374,7 @@ of the reference cell, i.e.
 <BR CLEAR="ALL">
 <P></P>
 According to (<A HREF="index.html#eq:point-mappings">2</A>) these points are mapped to the
-mapping support points <I>p</I><SUB><I>k</I></SUB>, 
+mapping support points <I>p</I><SUB><I>k</I></SUB>,
 <!-- MATH: $k=0,\ldots,4p-1$ -->
 <IMG
  WIDTH="135" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
@@ -398,7 +398,7 @@ p_k\in\partial K, \quad k=0,\ldots,4p-1.
 </DIV>
 <BR CLEAR="ALL">
 <P></P>
-While the support points <I>p</I><SUB><I>k</I></SUB>, 
+While the support points <I>p</I><SUB><I>k</I></SUB>,
 <!-- MATH: $k=0,\ldots,4p-1$ -->
 <IMG
  WIDTH="135" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
@@ -453,7 +453,7 @@ Laplace equation that is solved on the reference cell <IMG
  SRC="img8.gif"
  ALT="$\hat K$">.
 Discrete boundary conditions are imposed that are given by the
-coordinates of the mapping support points <I>p</I><SUB><I>k</I></SUB>, 
+coordinates of the mapping support points <I>p</I><SUB><I>k</I></SUB>,
 <!-- MATH: $k=0,\ldots,4p-1$ -->
 <IMG
  WIDTH="135" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
@@ -501,7 +501,7 @@ for each component <IMG
  WIDTH="15" HEIGHT="16" ALIGN="BOTTOM" BORDER="0"
  SRC="img1.gif"
  ALT="$\sigma $">.
-Here, the discrete boundary function 
+Here, the discrete boundary function
 <!-- MATH: $g\in [Q_p]^2$ -->
 <IMG
  WIDTH="73" HEIGHT="37" ALIGN="MIDDLE" BORDER="0"
@@ -535,13 +535,13 @@ and <IMG
  ALT="$\phi_i$">
 the corresponding Lagrangian interpolation basis
 function.  We recall that the numbering of the mapping support points
-involves 
+involves
 <!-- MATH: $p_k\in\partial K$ -->
 <IMG
  WIDTH="69" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
  SRC="img36.gif"
  ALT="$p_k\in\partial K$">
-for 
+for
 <!-- MATH: $k=0,\ldots, 4p-1$ -->
 <IMG
  WIDTH="135" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
@@ -651,13 +651,13 @@ and recalling definitions (<A HREF="index.html#eq:def-mapping-q">1</A>), (<A HRE
 </TABLE>
 </DIV>
 <BR CLEAR="ALL"><P></P>
-with the matrices 
+with the matrices
 <!-- MATH: $S_{ij}\in\mathbb R^{(p-1)^2\times(p-1)^2}$ -->
 <IMG
  WIDTH="155" HEIGHT="42" ALIGN="MIDDLE" BORDER="0"
  SRC="img42.gif"
  ALT="$S_{ij}\in\mathbb R^{(p-1)^2\times(p-1)^2}$">
-and 
+and
 <!-- MATH: $T_{ik}\in\mathbb R^{(p-1)^2\times 4p}$ -->
 <IMG
  WIDTH="128" HEIGHT="42" ALIGN="MIDDLE" BORDER="0"
@@ -753,7 +753,7 @@ c_{jk}=-\sum_{i=0}^{(p-1)^2-1}S^{-1}_{ji}T_{ik}.
 <BR CLEAR="ALL"><P></P>
 of the linear combination (<A HREF="index.html#eq:linear-combination-laplace">8</A>), that
 represents the dependency of the <I>j</I>th inner mapping support point
-<I>p</I><SUB>4<I>p</I>+<I>j</I></SUB> on the support points <I>p</I><SUB><I>k</I></SUB>, 
+<I>p</I><SUB>4<I>p</I>+<I>j</I></SUB> on the support points <I>p</I><SUB><I>k</I></SUB>,
 <!-- MATH: $k=0,\ldots,4p-1$ -->
 <IMG
  WIDTH="135" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
@@ -855,7 +855,7 @@ the base <I>Mapping</I> class. In
 <I>MappingQ::compute_support_points_laplace</I>, first the 4<I>p</I> points on the boundary of the cell are computed (by calling
 <I>MappingQ::add_line_support_points</I>), then by calling
 <I>MappingQ::apply_laplace_vector</I> the remaining (<I>p</I>-1)<SUP>2</SUP> inner mapping supports points are computed, where
-<I>MappingQ::apply_laplace_vector</I> just performes the linear
+<I>MappingQ::apply_laplace_vector</I> just performs the linear
 combination given in (<A HREF="index.html#eq:linear-combination-laplace">8</A>).
 <BR><HR>
 </FONT>
index a006404738947157735036a76355f79009ed9be4..5e6fd4cef3c39e7b77730ca60578cbc3c4ec56af 100644 (file)
@@ -49,7 +49,7 @@ Conclusions</A>
 
 <P>
 We have shown how multi-threading is supported in <TT>deal.II</TT> and how it
-can be used in several examples occuring in common finite element programs. It
+can be used in several examples occurring in common finite element programs. It
 was demonstrated that implementing a usable C++ interface poses several
 difficulties, both from the aspect of user friendliness as well as program
 correctness. In order to overcome these difficulties, first the more simple
index fd81759e2534eb0f165351ad6cfee0ff41eeb5f9..785792d11bcd1fd8fcb55e515b3a5629b86ec0fb 100644 (file)
@@ -78,7 +78,7 @@ also see that the mapping only changes something at the outer
 boundaries of the triangulation. In the interior, all lines are still
 represented by linear functions, resulting in additional computations
 only on cells at the boundary. Higher order mappings are therefore
-usually not noticably slower than lower order ones, because the
+usually not noticeably slower than lower order ones, because the
 additional computations are only performed on a small subset of all
 cells.
 
index 9e570382cd5cde45849c8c6762fd6ba2bd7aec91..86de3d4aab0d5c16e8d0c80964bb941305163f37 100644 (file)
@@ -48,7 +48,7 @@ output) of the program looks as follows:
 
 
 What surprises here is that the exact value is 1.59491554..., and that
-it is obviously suprisingly complicated to compute the solution even to
+it is obviously surprisingly complicated to compute the solution even to
 only one per cent accuracy, although the solution is smooth (in fact
 infinite often differentiable). This smoothness is shown in the
 graphical output generated by the program, here coarse grid and the
index b0f44a46bfc6c5986298edcbba6f7b5ecbce0a5e..595dd8906c3280c6c54607f3433fce680db70ed7 100644 (file)
@@ -196,7 +196,7 @@ smaller errors.
 Besides evaluating the values of the solution at a certain point, the
 program also offers the possibility to evaluate the x-derivatives at a
 certain point, and also to tailor mesh refinement for this. To let the
-program compute these quantities, simply replace the two occurences of
+program compute these quantities, simply replace the two occurrences of
 <code>PointValueEvaluation</code> in the main function by
 <code>PointXDerivativeEvaluation</code>, and let the program run:
 @code
index c43c970f4ea58c8b5740c5fda52c973e8a61eba2..e3167db652103065b234493246db65091e9bc212 100644 (file)
@@ -1773,7 +1773,7 @@ namespace Step14
                                    // domains, boundary values, and
                                    // right hand sides do not fit
                                    // together any more, and starts
-                                   // loosing the overview over the
+                                   // losing the overview over the
                                    // whole structure. Encapsulating
                                    // everything belonging to a certain
                                    // test case into a structure of its
index 664e9f56a182c3b0b7dce7c372249209d30f683b..483a54a57f27714fc683500aec0e23539ad76e95 100644 (file)
@@ -184,7 +184,7 @@ namespace Step15
                                     // But only the first time, the starting solution has to be
                                     // initialized. Also the vector of the solution will be
                                     // resized in the <code>refine_grid</code> function, while the
-                                    // vector is transfered to the new mesh.
+                                    // vector is transferred to the new mesh.
 
     if (first_step)
       {
index 18c8deeb6acc3aa2209f2615338e83dbfa343cf0..631360953f17cfdcecd0d8d6f9fb67077d6cd033 100644 (file)
@@ -45,7 +45,7 @@ of the deal.II linear algebra classes, but instead of implementing this
 functionality themselves, they simply pass on to their corresponding PETSc
 functions. The wrappers are therefore only used to give PETSc a more modern,
 object oriented interface, and to make the use of PETSc and deal.II objects as
-interchangable as possible.
+interchangeable as possible.
 
 
 
index 35a46754e557800fadf92efdf61d084aaa6404c5..0297cdfab857fe4ac0b63045f3cb5cedb4073112 100644 (file)
@@ -2579,7 +2579,7 @@ namespace Step18
                                   // should have computed an
                                   // incremental displacement update
                                   // so that the material in its new
-                                  // configuration accomodates for
+                                  // configuration accommodates for
                                   // the difference between the
                                   // external body and boundary
                                   // forces applied during this time
index 8a24ffb6d4adb3ad4dcda9135c5620c329f06046..fc9110a46fc7ffc6b77074af4296fb134074456f 100644 (file)
@@ -417,7 +417,7 @@ void renumber_dofs (DoFHandler<2> &dof_handler)
                                  // of course be ideal if all couplings were
                                  // in the lower or upper triangular part of a
                                  // matrix, since then solving the linear
-                                 // system would amoung to only forward or
+                                 // system would among to only forward or
                                  // backward substitution. This is of course
                                  // unachievable for symmetric sparsity
                                  // patterns, but in some special situations
index d07e4c3df3ec69cbc7e0c09e7790670aa9dd694b..f281abd6940c0a0ac153ce91a96b823ef6d8d614 100644 (file)
@@ -298,7 +298,7 @@ We will use these permeability fields again in step-21.
 
 As mentioned in the introduction, the Schur complement solver used here is not
 the best one conceivable (nor is it intended to be a particularly good
-one). Better ones can be found in the literture and can be built using the
+one). Better ones can be found in the literature and can be built using the
 same block matrix techniques that were introduced here. We pick up on this
 theme again in step-22, where we first build a Schur complement solver for the
 Stokes equation as we did here, and then in the <a
index 15188b6e17062f627ec990bb078b11fae6514078..d5f8782c55b75e408570701f14374ea00e5bb20d 100644 (file)
@@ -30,7 +30,7 @@ To derive the governing equations, consider two phase flow in a
 reservoir $\Omega$ under the assumption that the movement of fluids is
 dominated by viscous effects; i.e. we neglect the effects of gravity,
 compressibility, and capillary pressure. Porosity will be considered
-to be constant. We will denote variables refering to either of the two
+to be constant. We will denote variables referring to either of the two
 phases using subscripts $w$ and $o$, short for water and oil. The
 derivation of the equations holds for other pairs of fluids as well,
 however.
index 3542d7435694fab04d2a7c3a10d34270404319c1..5f6739836b77dbd411246a9733b2b306fd4a42d8 100644 (file)
@@ -724,7 +724,7 @@ Essentially, there are currently two algorithms in the program that do not
 scale linearly with the number of degrees of freedom: renumbering of degrees
 of freedom (which is ${\cal O}(N \log N)$, and the linear solver (which is
 ${\cal O}(N^{4/3})$). As for the first, while reordering degrees of freedom
-may not scale linearly, it is an indispensible part of the overall algorithm
+may not scale linearly, it is an indispensable part of the overall algorithm
 as it greatly improves the quality of the sparse ILU, easily making up for
 the time spent on computing the renumbering; graphs and timings to
 demonstrate this are shown in the documentation of the DoFRenumbering
index 03cc5f6819fab6828efb6e4afa423ac67c0a5ddf..437c499c8398c2eff739eda7b511609deea82323 100644 (file)
@@ -512,7 +512,7 @@ the fact that we use an incomplete basis - this will increase the number of
 required iterations.
 
 BiCGStab, on the other hand, won't get slower when many iterations are needed
-(one iteration uses only results from one preceeding step and
+(one iteration uses only results from one preceding step and
 not all the steps as GMRES). Besides the fact the BiCGStab is more expensive per
 step since two matrix-vector products are needed (compared to one for
 CG or GMRES), there is one main reason which makes BiCGStab not appropriate for
@@ -753,7 +753,7 @@ interesting cases. The original motivation to write this program was for it to
 be a starting point for some geophysical flow problems, such as the
 movement of magma under places where continental plates drift apart (for
 example mid-ocean ridges). Of course, in such places, the geometry is more
-complicated than the examples shown above, but it is not hard to accomodate
+complicated than the examples shown above, but it is not hard to accommodate
 for that.
 
 For example, by using the folllowing modification of the boundary values
index e384c7966d64ea8578e6b2f7537bacc74b36708b..491147154770453ed1ccefd96aa650355751dba5 100644 (file)
@@ -52,7 +52,7 @@
                                 // for the sparse direct solver UMFPACK:
 #include <deal.II/lac/sparse_direct.h>
 
-                                // This includes the libary for the
+                                // This includes the library for the
                                 // incomplete LU factorization that will
                                 // be used as a preconditioner in 3D:
 #include <deal.II/lac/sparse_ilu.h>
@@ -688,7 +688,7 @@ namespace Step22
                                      // makes the algorithm to build the
                                      // sparsity pattern be quadratic in the
                                      // number of degrees of freedom. This
-                                     // doesn't become noticable until we get
+                                     // doesn't become noticeable until we get
                                      // well into the range of several 100,000
                                      // degrees of freedom, but eventually
                                      // dominates the setup of the linear
index 1d94b8ee5e407fbf025880eeb75f1380981b3b90..4ee0f37f703f49836ab1bc83f0d3de5af64f5123 100644 (file)
@@ -119,7 +119,7 @@ v = \frac{\partial\bar{p}}{\partial t}
 @f]
 
 With the second variables, one then transform the forward problem into
-two seperate equations:
+two separate equations:
 @f{eqnarray*}
 \bar{p}_{t} - v & = & 0 \\
 \Delta\bar{p} - \frac{1}{c_0^2}\,v_{t} & = & f 
index a915bc4c52731040b291be58a2e2f9e0c39ba42f..f43b6a31789ce7a2a2cc8d06632aaed3118e9a95 100644 (file)
@@ -11,7 +11,7 @@ extensively.
 
 Rather facetiously, the sine-Gordon equation's moniker is a pun on the
 so-called Klein-Gordon equation, which is a relativistic version of
-the Schr&ouml;dinger equation for particles with non-zero mass. The resemblence is not just
+the Schr&ouml;dinger equation for particles with non-zero mass. The resemblance is not just
 superficial, the sine-Gordon equation has been shown to model some
 unified-field phenomena such as interaction of subatomic particles
 (see, e.g., Perring &amp; Skyrme in Nuclear Physics <b>31</b>) and the
index 8f912012ef619cafc6720536e9aa9a5e3afe691f..19f401aad83a09aa6c3bd30a857a54c4b7571c2b 100644 (file)
@@ -886,7 +886,7 @@ namespace Step25
                                  // program. It creates an object of
                                  // top-level class and calls its
                                  // principal function. Also, we
-                                 // supress some of the library output
+                                 // suppress some of the library output
                                  // by setting
                                  // <code>deallog.depth_console</code>
                                  // to zero. Furthermore, if
index 3cf757a6b6d128214667d62cefec27e199ab989e..c74b2c4e2f6c45464ed7f1538605492e29868be5 100644 (file)
@@ -1188,7 +1188,7 @@ namespace Step28
                                      // $\Sigma_{s,g'\to g}$). This is
                                      // straight forward, but note how
                                      // we determine which of the two
-                                     // cells is ther finer one by
+                                     // cells is the finer one by
                                      // looking at the refinement level
                                      // of the two cells:
     if (!cell_g->has_children() && !cell_g_prime->has_children())
index 3274a41ee29f6effeedc0946ea6f30c65cb2547d..f2a4ea663c411100f9c7656f425d4ab7751cf5fd 100644 (file)
@@ -184,5 +184,5 @@ hour. What you'll notice, however, is that the solution is completely
 wrong: the mesh size is simply not small enough to resolve the
 solution's waves accurately, and you can see this in plots of the
 solution. Consequently, this is one of the cases where adaptivity is
-indispensible if you don't just want to throw a bigger (presumably
+indispensable if you don't just want to throw a bigger (presumably
 %parallel) machine at the problem.
index 4f3f39ae4be16a5cdaf3656326d4271752a30357..e294cf2016316dc68ae7e8868cb2ae8a72ea5b36 100644 (file)
@@ -2667,7 +2667,7 @@ namespace Step31
                                      // old mesh to the new one. To this end
                                      // we use the SolutionTransfer class and
                                      // we have to prepare the solution
-                                     // vectors that should be transfered to
+                                     // vectors that should be transferred to
                                      // the new grid (we will lose the old
                                      // grid once we have done the refinement
                                      // so the transfer has to happen
index 7f3fcc77c0fb51d4a709dc52de068e269c04dbdb..386b9b1affc222f82b67084ec33184621ddc1655 100644 (file)
@@ -3391,7 +3391,7 @@ namespace Step32
                                    // precompute the temperature
                                    // preconditioner as well. The reason is
                                    // that the setup of the Jacobi
-                                   // preconditioner takes a noticable time
+                                   // preconditioner takes a noticeable time
                                    // compared to the solver because we
                                    // usually only need between 10 and 20
                                    // iterations for solving the temperature
index 2c9e0d157dd8fd43dcd97267f362abf5b3367bc5..acafeee5dce41257c6e7915be3affedfb84b0650 100644 (file)
@@ -225,7 +225,7 @@ of a lot of zeros: the elements of the local residual vector are
 independent of almost all elements of the solution vector, and
 consequently their derivatives are zero; however, trying to compute
 these zeros can easily take 90% or more of the compute time of the
-entire program in an experiment inadvertantly made by a student a few
+entire program, as shown in an experiment inadvertently made by a student a few
 years after this program was first written.
 
 
index 1d2d9a546704c401e5cab54e57a21197f5f168b8..430e1a24235395fcb9c3aa4f4724d39dbd76281a 100644 (file)
@@ -151,7 +151,7 @@ We can also visualize the evolution of the adaptively refined grid:
 
 @image html step-33.slide_adapt.gif
 
-The adaptivity follows and preceeds the flow pattern, based on the heuristic
+The adaptivity follows and precedes the flow pattern, based on the heuristic
 refinement scheme discussed above.
 
 
index d95ffcced5f336ec2e5292dfec918a3e6a2afefe..9394797e2003d9d04b5d24be0b38cffc4350cf1b 100644 (file)
@@ -930,7 +930,7 @@ namespace Step33
                                    // entries at the top level of the
                                    // input file, as well as a few odd
                                    // other entries in subsections that
-                                   // are too short to warrent a
+                                   // are too short to warrant a
                                    // structure by themselves.
                                    //
                                    // It is worth pointing out one thing here:
index d101457575b6a22cc7d6bdc84e9e8db274a18414..cc27622bebd9a8c2095ae36135c18169bb9bfc9f 100644 (file)
@@ -1162,7 +1162,7 @@ namespace Step34
                                    // does not result only in a factor
                                    // appearing as a constant factor on
                                    // the entire integral, but also on
-                                   // an additional integral alltogether
+                                   // an additional integral altogether
                                    // that needs to be evaluated:
                                    //
                                    // \f[
index baed9382e01c7cb54a5ba3cb919a45f33eaaa442..40862d2aeed8945a151bd6e3ba32de58343c9a7a 100644 (file)
@@ -209,7 +209,7 @@ namespace Step36
                                    // these extra entries and aborts
                                    // with an error message.
                                    //
-                                   // In the absense of any obvious way
+                                   // In the absence of any obvious way
                                    // to avoid this, we simply settle
                                    // for the second best option, which
                                    // is have PETSc allocate memory as
index c345efb6f774612b618d125875981fc53efde23f..8aa9428d966f4d28c6641565eb0ad343754ec651 100644 (file)
@@ -101,7 +101,7 @@ This function has a member variable of type
 <code>DoFHandler@<dim@></code>. Again, the compiler can't
 compile this function until it knows for which dimension. If you call
 this function for a specific dimension as above, the compiler will
-take the template, replace all occurences of dim by the dimension for
+take the template, replace all occurrences of dim by the dimension for
 which it was called, and compile it. If you call the function several
 times for different dimensions, it will compile it several times, each
 time calling the right <code>make_grid</code> function and reserving the right
index 46bc040e5c6d66acc244ac7010d21675513f6130..775395f4b44f699d0accacf66888b839a2b4f991 100644 (file)
@@ -1983,7 +1983,7 @@ namespace Step43
                                    // larger or smaller than a certain
                                    // threshold, preserving minimal
                                    // and maximal levels of mesh
-                                   // refinement. (iii) Transfering
+                                   // refinement. (iii) Transferring
                                    // the solution from the old to the
                                    // new mesh. None of this is
                                    // particularly difficult.
index 3d722c8630fa72980fe0986482b026eae8ddbb67..66e50860434f6466785aba4eb86429d3a11d3d57 100644 (file)
@@ -91,7 +91,7 @@ H^1(\Omega_s)^d$ such that
        0,
 @f}
 for all test functions $\mathbf a, q, \mathbf b$.
-Note that $Y$ is only a subspace of the spaces listed above to accomodate for
+Note that $Y$ is only a subspace of the spaces listed above to accommodate for
 the various Dirichlet boundary conditions.
 
 This sort of coupling is of course possible by simply having two Triangulation
index 9d219ebca27822a655cb20cfca4cc158c7080a48..c5bd15aedf7dd64ebd253a990d721194bb727507 100644 (file)
@@ -200,7 +200,7 @@ double Coefficient<dim>::value (const Point<dim> &p,
                                  // argument) which will usually
                                  // terminate the program giving
                                  // information where the error
-                                 // occured and what the reason
+                                 // occurred and what the reason
                                  // was. This generally reduces the
                                  // time to find programming errors
                                  // dramatically and we have found
@@ -476,7 +476,7 @@ void Step5<dim>::assemble_system ()
                                    // dofs_per_cell*dofs_per_cell*n_q_points. On
                                    // the other hand, the function
                                    // will of course return the same
-                                   // value everytime it is called
+                                   // value every time it is called
                                    // with the same quadrature point,
                                    // independently of what shape
                                    // function we presently treat;
index f3cdcee24bc3507c9a53d4f51d930b247d89b1d1..23a6600900094bb00d55dc89aee0f203d32ef5cc 100644 (file)
@@ -27,7 +27,7 @@ namespace Algorithms
  * Operator class performing Newton's iteration with standard step
  * size control and adaptive matrix generation.
  *
- * This class performes a Newton iteration up to convergence
+ * This class performs a Newton iteration up to convergence
  * determined by #control. If after an update the norm of the residual
  * has become larger, then step size control is activated and the
  * update is subsequently divided by two until the residual actually
index d7da18e098f55d186a97dd32f790f4eb11d8f9ac..d21721d4219c826f267d415aed65ace4f7350268 100644 (file)
@@ -71,7 +71,7 @@ DEAL_II_NAMESPACE_OPEN
  * @code
  * system_matrix.print_formatted(pout);
  * @endcode
- * is <em>not</em> possible. Instead use the is_active() funtion for a
+ * is <em>not</em> possible. Instead use the is_active() function for a
  * work-around:
  *
  * @code
index 86dc55bed7f8e8298aff272f316e3fa0ee06d5bd..560e09e55e3e9e1f570ff4be7364ae4a97c0057d 100644 (file)
@@ -807,7 +807,7 @@ class DataOutBase
                                           *
                                           * Default is the
                                           * Gnuplot-default of 30.
-                                          * An exemple of a
+                                          * An example of a
                                           * Gnuplot-default of 0 is
                                           * the following:
                                           *
@@ -1635,7 +1635,7 @@ class DataOutBase
  * make sure that the TECHOME environment variable points to the
  * Tecplot installation directory, and that the files
  * \$TECHOME/include/TECIO.h and \$TECHOME/lib/tecio.a are readable.
- * If these files are not availabe (or in the case of 1D) this
+ * If these files are not available (or in the case of 1D) this
  * function will simply call write_tecplot() and thus larger ASCII
  * data files will be produced rather than more efficient Tecplot
  * binary files.
index 86d8035aafb7aa0aa3a52f95d7e278e0e3d84772..87c3c8fc092d235f82126103169ff0153d68f771 100644 (file)
@@ -110,7 +110,7 @@ class ExceptionBase : public std::exception
                                       *  Function derived from the base class
                                       *  which allows to pass information like
                                       *  the line and name of the file where the
-                                      *  exception occured as well as user
+                                      *  exception occurred as well as user
                                       *  information.
                                       *
                                       *  This function is mainly used
index 9cde3bccd1ac1e19bcd1b29cee06d225246e674e..40b3dbba5a4151136dbd94c65f584d7878a67545 100644 (file)
@@ -87,7 +87,7 @@ template <typename number> class Vector;
  * call itself.
  *
  *
- * Support for time dependant functions can be found in the base
+ * Support for time dependent functions can be found in the base
  * class FunctionTime.
  *
  * @note if the functions you are dealing with have sizes which
index b6b8b17c6f721d2a894da23db3362281794cd3bd..1f5d9a705e99f13b36c5c03fc248c867941ff9b4 100644 (file)
@@ -196,7 +196,7 @@ template <typename> class Vector;
                   whose tangent is (A).
       atan2(A,B): Arc-tangent of A/B. The two main differences to atan() is
                   that it will return the right angle depending on the signs of
-                  A and B (atan() can only return values betwen -pi/2 and pi/2),
+                  A and B (atan() can only return values between -pi/2 and pi/2),
                   and that the return value of pi/2 and -pi/2 are possible.
       atanh(A)  : Same as atan() but for hyperbolic tangent.
       ceil(A)   : Ceiling of A. Returns the smallest integer greater than A.
index 75f97619d2c8f8659c3fed892ed9852894393634..05e7db996da7c51f4f6ccf1c65992020a6f0ac76 100644 (file)
@@ -2695,7 +2695,7 @@ GeometryInfo<3>::cell_to_child_coordinates (const Point<3>         &p,
       case RefinementCase<3>::cut_xz:
                                              // careful, this is slightly
                                              // different from xy and yz due to
-                                             // differnt internal numbering of
+                                             // different internal numbering of
                                              // children!
             point[0]*=2.0;
             point[2]*=2.0;
@@ -2802,7 +2802,7 @@ GeometryInfo<3>::child_to_cell_coordinates (const Point<3>         &p,
       case RefinementCase<3>::cut_xz:
                                              // careful, this is slightly
                                              // different from xy and yz due to
-                                             // differnt internal numbering of
+                                             // different internal numbering of
                                              // children!
             if (child_index/2==1)
               point[0]+=1.0;
index 3ebbb2b83490f27a179dd880b153383d50128df9..f87f5a3aa3b8c4e1531a9d8ab9fd5f6ef4f176ab 100644 (file)
@@ -521,7 +521,7 @@ class LogStream : public Subscriptor
                                       *
                                       * This functionality was
                                       * introduced to produce more
-                                      * reproducable floating point
+                                      * reproducible floating point
                                       * output for regression
                                       * tests. The rationale is, that
                                       * an exact output value is much
index ee048569c29a22386336e990a476ef297b22e987..9bd925f4c5a91e6559c3ece4b03f33661e6e635f 100644 (file)
@@ -39,7 +39,7 @@ DEAL_II_NAMESPACE_OPEN
  * <li> The argument is a standard C++ data type, namely,
  * <tt>bool</tt>, <tt>float</tt>, <tt>double</tt> or any of the
  * integer types. In that case, memory_consumption() simple returns
- * <tt>sizeof</tt> of its argument. The libary also provides an
+ * <tt>sizeof</tt> of its argument. The library also provides an
  * estimate for the amount of memory occupied by a
  * <tt>std::string</tt> this way.
  *
index a218768708bef9b40b014e21ee4091bc3feba51b..66754146a26072d3578cc614121adc4f6624b323 100644 (file)
@@ -157,7 +157,7 @@ namespace Patterns
                                     * integer. If bounds are given
                                     * to the constructor, then the
                                     * integer given also needs to be
-                                    * withing the interval specified
+                                    * within the interval specified
                                     * by these bounds. Note that
                                     * unlike common convention in
                                     * the C++ standard library, both
@@ -304,7 +304,7 @@ namespace Patterns
                                     * <tt>double</tt>. If bounds are
                                     * given to the constructor, then
                                     * the integer given also needs
-                                    * to be withing the interval
+                                    * to be within the interval
                                     * specified by these
                                     * bounds. Note that unlike
                                     * common convention in the C++
@@ -1213,7 +1213,7 @@ namespace Patterns
  *     ...
  *   @endcode
  *   You can use several sources of input successively. Entries which are changed more than
- *   once will be overwritten everytime they are used.
+ *   once will be overwritten every time they are used.
  *
  *   You should not try to declare entries using declare_entry() and
  *   enter_subsection() with as yet unknown subsection names after
@@ -2268,7 +2268,7 @@ class ParameterHandler : public Subscriptor
                                       * left by an <tt>END</tt> or <tt>end</tt>
                                       * statement, a value for a
                                       * non-declared entry was given
-                                      * or teh entry value did not
+                                      * or the entry value did not
                                       * match the regular
                                       * expression. <tt>true</tt> otherwise.
                                       *
index 4a8b2e316bbf0b90c2b14bd47a48ee04ce4a44a0..491695df9bac225964d23f66c23b44c78165ace9 100644 (file)
@@ -16,7 +16,7 @@
 // single this file out from tensor.h, since we want to derive
 // Point<dim,Number> from Tensor<1,dim,Number>. However, the point class will
 // not need all the tensor stuff, so we don't want the whole tensor package to
-// be included everytime we use a point.
+// be included every time we use a point.
 
 
 #include <deal.II/base/config.h>
index 7b82dda6b57ece4fa0910eeaca60dcdce44f9a55..d655cbb0380a03cc428c3fb7ed52d23398193c53 100644 (file)
@@ -46,7 +46,7 @@ namespace Threads
    * <h3>Construction and destruction</h3>
    *
    * Objects of this class can either be default constructed or by providing an
-   * "exemplar", i.e. an object of type T so that everytime we need to create
+   * "exemplar", i.e. an object of type T so that every time we need to create
    * a T on a thread that doesn't already have such an object, it is copied from
    * the exemplar.
    *
index fb6a169c64b64f648f6965afe4214531cbfa14e5..6b5f941cfcccaefa8a613d460a9ab29e7f89406e 100644 (file)
@@ -1251,7 +1251,7 @@ namespace Threads
                                       * long as the thread
                                       * executes. This means that even
                                       * if all Threads::Thread objects
-                                      * that refered to this
+                                      * that referred to this
                                       * descriptor (through a
                                       * std::shared_ptr) have gone out
                                       * of scope, we must still hold
index 4ed683a59e1525a3c1d182160da05f3709277b39..333216b6d35a23da48e637af144f74fc4fcb2902 100644 (file)
@@ -203,7 +203,7 @@ namespace parallel
                                           * ordering in the deal.II mesh. As
                                           * assembly is done in the deal.II
                                           * cell ordering, this flag is
-                                          * required to get reproducable
+                                          * required to get reproducible
                                           * behaviour after snapshot/resume.
                                           */
         enum Settings
index c462bdf157a28e5ffca58681aa18276bf648e971..0b8bacc182f76b2103ee11a66612793a7541539c 100644 (file)
@@ -39,7 +39,7 @@ namespace internal
  *
  * These classes are similar to the DoFLevel classes. We here store information
  * that is associated with faces, rather than cells, as this information is independent of
- * the hierachical structure of cells, which are organized in levels. In 2D we store
+ * the hierarchical structure of cells, which are organized in levels. In 2D we store
  * information on degrees of freedom located on lines whereas in 3D we store information on
  * drefrees of freedom located on quads and lines. In 1D we do nothing, as the faces of
  * lines are vertices which are treated seperately.
@@ -128,7 +128,7 @@ namespace internal
     };
 
 /**
- * Store the indices of degrees of freedom on faces in 3D, which are quads, additionaly also on lines.
+ * Store the indices of degrees of freedom on faces in 3D, which are quads, additionally also on lines.
  *
  * @author Tobias Leicht, 2006
  */
index 14bdcaabe99f79ef4913365915d555af6be3c6e9..54eb34d7eccc9d5fedd46cd8408cecf6a11acb93 100644 (file)
@@ -1056,7 +1056,7 @@ class DoFHandler  :  public Subscriptor
                                       * listed in the given set. The
                                       * reason that a @p map rather
                                       * than a @p set is used is the
-                                      * same as descibed in the
+                                      * same as described in the
                                       * section on the
                                       * @p make_boundary_sparsity_pattern
                                       * function.
index cf84aac15e9aa679752009232f9b91017c705839..cb9c40d7332006bc75346a42bc2626536fba7e7e 100644 (file)
@@ -54,8 +54,8 @@ namespace internal
  * objects, i.e. on lines for 2D and on quads and lines for 3D are
  * treated similarly than that on cells. However, theses geometrical
  * objects, which are called faces as a generalisation, are not
- * organised in a hierachical structure of levels. Therefore, the
- * degrees of freedom located on these objects are stored in seperate
+ * organised in a hierarchical structure of levels. Therefore, the
+ * degrees of freedom located on these objects are stored in separate
  * classes, namely the <tt>DoFFaces</tt> classes.
  *
  *
index 61613c45bf37e5e08e4f5c2108a9e1ada17860e4..f760b6d86cde97bbb6d4c204d3a589ef3cf20af2 100644 (file)
@@ -121,7 +121,7 @@ DEAL_II_NAMESPACE_OPEN
  * `zoom in' mesh). In one such example the bandwidth was increased by
  * about 50 per cent.
  *
- * In most other cases, the bandwith is reduced significantly. The reduction
+ * In most other cases, the bandwidth is reduced significantly. The reduction
  * is the better the less structured the grid is. With one grid where the
  * cells were refined according to a random driven algorithm, the bandwidth
  * was reduced by a factor of six.
index 66c0759613b47edbee0d273ed271fd6ff1bed78d..289288f4b86215e7f05ebd438e4cdcb3ca1f0bfe 100644 (file)
@@ -259,7 +259,7 @@ namespace hp
  *
  * <h5>Computing the correct basis from "raw" basis functions</h5>
  *
- * First, aready the basis of the shape function space may be
+ * First, already the basis of the shape function space may be
  * difficult to implement for arbitrary order and dimension. On the
  * other hand, if the @ref GlossNodes "node values" are given, then
  * the duality relation between node functionals and basis functions
index a073892cae6aae5fb97650f0f48d0f6976d96bfa..f6b70f1bb62ebffb754d37775175d667f84e3eab 100644 (file)
@@ -417,7 +417,7 @@ class FE_Q_Hierarchical : public FE_Poly<TensorProductPolynomials<dim>,dim>
 
                                      /**
                                       * The numbering of the degrees
-                                      * of freedom in continous finite
+                                      * of freedom in continuous finite
                                       * elements is hierarchic,
                                       * i.e. in such a way that we
                                       * first number the vertex dofs,
index c8e643b90b99a95d0be9718c271a0d4c23b4836d..75caa20de6ab5bba21bc0c45a07a797438b0d006 100644 (file)
@@ -1099,7 +1099,7 @@ namespace FETools
                                    //@}
                                    /**
                                     * The numbering of the degrees
-                                    * of freedom in continous finite
+                                    * of freedom in continuous finite
                                     * elements is hierarchic,
                                     * i.e. in such a way that we
                                     * first number the vertex dofs,
index 2bf2f5aaeb0329b3b387104ca46ff3a8d978b990..835ab82ea892964f13a4a1dbef144b50c4bd5408 100644 (file)
@@ -440,7 +440,7 @@ class Mapping : public Subscriptor
  * @f[
  * \mathbf u(\mathbf x) = J(\mathbf{\hat x})\mathbf{\hat u}(\mathbf{\hat x}).
  * @f]
- * In physics, this is usually refered to as the contravariant
+ * In physics, this is usually referred to as the contravariant
  * transformation. Mathematically, it is the push forward of a
  * vector field.
  *
index 2ac1ef4a1b3438617f0aa6fc34ca84d0f460417b..824d896e5fea04524ca11f2617cc741ba3412d31 100644 (file)
@@ -523,7 +523,7 @@ namespace GridOutFlags
                                        /**
                                         * Vertex numbers can be
                                         * written onto the
-                                        * vertices. This is controled
+                                        * vertices. This is controlled
                                         * by the following
                                         * flag. Default is @p false.
                                         */
index 07b18beb7ef231f1dcd28e15450c93e50eda7c1f..aaf09e7068f94e982a36356b4933635b49dc8889 100644 (file)
@@ -732,7 +732,7 @@ namespace internal
 
                                          /**
                                           * Indices of the cells to be
-                                          * processed withing the
+                                          * processed within the
                                           * present sheet. If a cell
                                           * is being processed
                                           * presently, it is taken
index 2bd4b431efea7855be842c84a70deb0638174a13..7c2a4217963247aace76cacf11624a6e0197ce3c 100644 (file)
@@ -889,7 +889,7 @@ namespace GridTools
                                     * finer level faces to their
                                     * corresponding surface mesh
                                     * cells, for example to
-                                    * accomodate different geometry
+                                    * accommodate different geometry
                                     * descriptions in the case of
                                     * curved boundaries.
                                     */
index 473975e92bae227e6276b413648f6e6e24bef210..e092ea0b9afc158a11785ee03a754f3a7387ea20 100644 (file)
@@ -28,10 +28,10 @@ namespace internal
  * are similar to the TriaLevel classes. As cells are organised in a hierarchical
  * structure of levels, each triangulation consists of several such TriaLevels. However the
  * faces of a triangulation, lower dimensional objects like lines in 2D or lines and quads
- * in 3D, do not have to be based on such a hierachical structure. In fact we have to
+ * in 3D, do not have to be based on such a hierarchical structure. In fact we have to
  * organise them in only one object if we want to enable anisotropic refinement. Therefore
  * the TriaFaces classes store the information belonging to the faces of a
- * triangualtion seperately from the TriaLevel classes.
+ * triangulation separately from the TriaLevel classes.
  *
  * This general template is only provided to enable a specialization below.
  *
index 64773b0ac0583e020f04fbf4a7d7e42875a20fe8..e24919e9a0d3277453d9e3e24ea1ede8ce5b5cba 100644 (file)
@@ -125,7 +125,7 @@ template <typename> class TriaActiveIterator;
  * as template arguments, you can write your own versions here to add
  * more functionality.
  *
- * Furthermore, the iterators decribed here satisfy the requirement of
+ * Furthermore, the iterators described here satisfy the requirement of
  * input and bidirectional iterators as stated by the C++ standard and
  * the STL documentation. It is therefore possible to use the
  * functions from the algorithm section of the C++ standard,
@@ -215,7 +215,7 @@ template <typename> class TriaActiveIterator;
  *
  * Past-the-end iterators may also be used to compare an iterator with the
  * <i>before-the-start</i> value, when running backwards. There is no
- * distiction between the iterators pointing past the two ends of a vector.
+ * distinction between the iterators pointing past the two ends of a vector.
  *
  * By defining only one value to be past-the-end and making all other values
  * invalid provides a second track of security: if we should have forgotten
index 69a2ee1627a0274d101a1eade964fdf630373e92..37b0bac873192cb7b3333deeb22f4fa1a8e29509 100644 (file)
@@ -167,12 +167,12 @@ namespace internal
 
 
                                          /**
-                                          *  Reserve enough space to accomodate
+                                          *  Reserve enough space to accommodate
                                           *  @p total_cells cells on this level.
                                           *  Since there are no @p used flags on this
                                           *  level, you have to give the total number
                                           *  of cells, not only the number of newly
-                                          *  to accomodate ones, like in the
+                                          *  to accommodate ones, like in the
                                           *  <tt>TriaLevel<N>::reserve_space</tt>
                                           *  functions, with <tt>N>0</tt>.
                                           *
index 91d439d0d3f2753581bf08950517d8486f6dff99..77a9bbfd9f98771daed4553d90f5710f586d972c 100644 (file)
@@ -198,7 +198,7 @@ namespace internal
             /**
              *  Assert that enough space
              *  is allocated to
-             *  accomodate
+             *  accommodate
              *  <code>new_objs_in_pairs</code>
              *  new objects, stored in
              *  pairs, plus
@@ -501,7 +501,7 @@ namespace internal
 /**
  * For hexahedrons the data of TriaObjects needs to be extended, as we can obtain faces
  * (quads) in non-standard-orientation, therefore we declare a class TriaObjectsHex, which
- * additionaly contains a bool-vector of the face-orientations.
+ * additionally contains a bool-vector of the face-orientations.
  */
 
     class TriaObjectsHex : public TriaObjects<TriaObject<3> >
@@ -580,7 +580,7 @@ namespace internal
 
                                          /**
                                           *  Assert that enough space is
-                                          *  allocated to accomodate
+                                          *  allocated to accommodate
                                           *  <code>new_objs</code> new objects.
                                           *  This function does not only call
                                           *  <code>vector::reserve()</code>, but
@@ -624,7 +624,7 @@ namespace internal
 /**
  * For quadrilaterals in 3D the data of TriaObjects needs to be extended, as we
  * can obtain faces (quads) with lines in non-standard-orientation, therefore we
- * declare a class TriaObjectsQuad3D, which additionaly contains a bool-vector
+ * declare a class TriaObjectsQuad3D, which additionally contains a bool-vector
  * of the line-orientations.
  */
 
@@ -659,7 +659,7 @@ namespace internal
                                          /**
                                           *  Assert that enough space
                                           *  is allocated to
-                                          *  accomodate
+                                          *  accommodate
                                           *  <code>new_quads_in_pairs</code>
                                           *  new quads, stored in
                                           *  pairs, plus
index 19f001b341092d9278c41a93ec1092434e5321a0..e37db5ae2ebbae6e686ab57e487bc9a6f9a9f5f8 100644 (file)
@@ -40,7 +40,7 @@ namespace internal
  *
  * These classes are similar to the internal::hp::DoFLevel classes. We here store
  * information that is associated with faces, rather than cells, as this information is
- * independent of the hierachical structure of cells, which are organized in levels. In 2D
+ * independent of the hierarchical structure of cells, which are organized in levels. In 2D
  * we store information on degrees of freedom located on lines whereas in 3D we store
  * information on drefrees of freedom located on quads and lines. In 1D we do nothing, as
  * the faces of lines are vertices which are treated seperately.
index eb232ec2d958f69e3d5e4ff9bfd70b0f1bedf897..13c0e813afb957c410f1a2107c89a2ff81b24949 100644 (file)
@@ -846,7 +846,7 @@ namespace hp
                                         * listed in the given set. The
                                         * reason that a @p map rather
                                         * than a @p set is used is the
-                                        * same as descibed in the
+                                        * same as described in the
                                         * section on the
                                         * @p make_boundary_sparsity_pattern
                                         * function.
index 33fdaa2fb69eb0659bafb967d898d212a42e0662..89d5688bff9c5d3c35020606fbdd1505d843428f 100644 (file)
@@ -958,7 +958,7 @@ class BlockVectorBase : public Subscriptor
                                       * Return whether the vector contains only
                                       * elements with value zero. This function
                                       * is mainly for internal consistency
-                                      * check and should seldomly be used when
+                                      * check and should seldom be used when
                                       * not in debug mode since it uses quite
                                       * some time.
                                       */
index c713c8186e6dee5a8732d17ddf741e2afa285c47..3f9d9d767e7a75e06154db76e4bc76489091b3c8 100644 (file)
@@ -353,7 +353,7 @@ class ConstraintMatrix : public Subscriptor
                                       * denoted by pairs of column indices
                                       * and values, to a line of
                                       * constraints. This function is
-                                      * equivalent to calling the preceeding
+                                      * equivalent to calling the preceding
                                       * function several times, but is
                                       * faster.
                                       */
@@ -638,7 +638,7 @@ class ConstraintMatrix : public Subscriptor
                                       *
                                       * @note The hanging nodes are
                                       * completely eliminated from the
-                                      * linear system refering to
+                                      * linear system referring to
                                       * <tt>condensed</tt>. Therefore, the
                                       * dimension of <tt>condensed</tt> is
                                       * the dimension of
index ea96c7447bc3bde4c91b949f506f5f7475b076b8..9988947c4660cf94f05c1a09e939f2dc40f8cf28 100644 (file)
@@ -49,7 +49,7 @@ namespace LACExceptions
   DeclException1 (ExcPETScError,
                   int,
                   << "An error with error number " << arg1
-                  << " occured while calling a PETSc function");
+                  << " occurred while calling a PETSc function");
 
                                    /**
                                     * An error of a Trilinos function was
@@ -59,7 +59,7 @@ namespace LACExceptions
   DeclException1 (ExcTrilinosError,
                   int,
                   << "An error with error number " << arg1
-                  << " occured while calling a Trilinos function");
+                  << " occurred while calling a Trilinos function");
 
                                    //@}
 }
index 2cef208b0e1e1e257bcf1070fbd3a7c5e8f63a3c..51708e58f63c52e41aef42de7647a939f2579216 100644 (file)
@@ -566,7 +566,7 @@ class FullMatrix : public Table<2,number>
                                       * value zero. This function is
                                       * mainly for internal
                                       * consistency checks and should
-                                      * seldomly be used when not in
+                                      * seldom be used when not in
                                       * debug mode since it uses quite
                                       * some time.
                                       */
index 9dbc06d989e3f5aaff06c80d4bfb26c9f683832e..4030afad704e0536b93d2feb01ade21a3f67eeaa 100644 (file)
@@ -160,7 +160,7 @@ class MatrixBlock
                                         * and ExcBlockIndexMismatch is
                                         * thrown, if the global index
                                         * does not point into the
-                                        * block refered to by #row and
+                                        * block referred to by #row and
                                         * #column.
                                         *
                                         * @todo
@@ -194,7 +194,7 @@ class MatrixBlock
                                         * and ExcBlockIndexMismatch is
                                         * thrown, if the global index
                                         * does not point into the
-                                        * block refered to by #row and
+                                        * block referred to by #row and
                                         * #column.
                                         *
                                         * @todo
@@ -234,7 +234,7 @@ class MatrixBlock
                                         * ExcBlockIndexMismatch is
                                         * thrown, if the global index
                                         * does not point into the
-                                        * block refered to by #row and
+                                        * block referred to by #row and
                                         * #column.
                                         *
                                         * @todo
index 4e8650b3004027f3003440ac366bab976709a2c9..2ae2dc5dfc90efd929ea8af1762cc3015581857e 100644 (file)
@@ -402,7 +402,7 @@ namespace parallel
                                           * Return whether the vector contains only
                                           * elements with value zero. This function
                                           * is mainly for internal consistency
-                                          * checks and should seldomly be used when
+                                          * checks and should seldom be used when
                                           * not in debug mode since it uses quite
                                           * some time.
                                           */
index 555e354ec861432496bf2232a3b94e3fecfb4cf0..e35ecd55bfb26137d2b23477c3deb00d77b0b912 100644 (file)
@@ -1153,7 +1153,7 @@ namespace PETScWrappers
       DeclException1 (ExcPETScError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a PETSc function");
+                      << " occurred while calling a PETSc function");
                                        /**
                                         * Exception
                                         */
index 20ade043a7fff84040c12acb8b7c33745d9fc041..3c00e1ed95f6cafcf004bbc1ed34c76477c8393a 100644 (file)
@@ -167,7 +167,7 @@ namespace PETScWrappers
       DeclException1 (ExcPETScError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a PETSc function");
+                      << " occurred while calling a PETSc function");
 
     protected:
 
index 942d05730cd2c38724e7da61635e62dd1cfba090..e62b926d173bc7bda249464e11485f6a6c594f99 100644 (file)
@@ -162,7 +162,7 @@ namespace PETScWrappers
         DeclException1 (ExcPETScError,
                         int,
                         << "An error with error number " << arg1
-                        << " occured while calling a PETSc function");
+                        << " occurred while calling a PETSc function");
                                          /**
                                           * Exception
                                           */
@@ -569,7 +569,7 @@ namespace PETScWrappers
                                         * only elements with value zero. This
                                         * function is mainly for internal
                                         * consistency checks and should
-                                        * seldomly be used when not in debug
+                                        * seldom be used when not in debug
                                         * mode since it uses quite some time.
                                         */
       bool all_zero () const;
index 7c1cb3fa270b7187905de9d53af072c06fd616ed..ca235fe5b6855e27b7904d1d538b6050d87bd690 100644 (file)
@@ -141,7 +141,7 @@ class RelaxationBlock :
                                           * <li>If the length of the
                                           * vector is zero, then the
                                           * relaxation method will be
-                                          * exectued from first to
+                                          * executed from first to
                                           * last block.
                                           * <li> If the length is one,
                                           * then the inner vector must
index ef4d570d7d7c7d8c17af7d193660a955815d77d8..db08ed0bfa4eba50fa3350c1864b3642fc399448 100644 (file)
@@ -140,7 +140,7 @@ namespace SLEPcWrappers
                                     * being used (and can be more). To
                                     * avoid doing this, the fairly
                                     * standard calling sequence
-                                    * excecuted here is used:
+                                    * executed here is used:
                                     * Initialise; Set up matrices for
                                     * solving; Actually solve the
                                     * system; Gather the solution(s);
@@ -286,7 +286,7 @@ namespace SLEPcWrappers
       DeclException1 (ExcSLEPcError,
                       int,
                       << "    An error with error number " << arg1
-                      << " occured while calling a SLEPc function");
+                      << " occurred while calling a SLEPc function");
 
       DeclException2 (ExcSLEPcEigenvectorConvergenceMismatchError,
                       int, int,
index 2649e640749737ec25dbc24b41195a7e2c4048fc..84058ab0e7b420cce68cffa669648a53e1c3ba30 100644 (file)
@@ -200,7 +200,7 @@ class Solver : public Subscriptor
     SolverControl &cntrl;
 
                                      /**
-                                      * Memory for auxilliary vectors.
+                                      * Memory for auxiliary vectors.
                                       */
     VectorMemory<VECTOR> &memory;
 };
index 308b5fde51d76d5d3c020c43356cf1e0659fca56..8c2aaa3bbe67261a739a70b0b55473e751f403ea 100644 (file)
@@ -406,7 +406,7 @@ class SparseLUDecomposition : protected SparseMatrix<number>,
     bool decomposed;
 
                                      /**
-                                      * The default strenghtening
+                                      * The default strengthening
                                       * value, returned by
                                       * get_strengthen_diagonal().
                                       */
index d726cbe6982e7668f9531debef7fa25633e1fd2d..e63a1190dfd267dd234bab6f825f2d8be3c71028 100644 (file)
@@ -134,10 +134,10 @@ DEAL_II_NAMESPACE_OPEN
  * that we now have two programs that communicate via pipes.  The
  * forked copy of the program then actually replaces itself by a
  * program called <tt>detached_ma27</tt>, that is started in its place
- * through the <tt>execv</tt> system call. Now everytime you call one of
+ * through the <tt>execv</tt> system call. Now every time you call one of
  * the functions of this class, it relays the data to the other
  * program and lets it execute the respective function. The results
- * are then transfered back. Since the MA27 functions are only called
+ * are then transferred back. Since the MA27 functions are only called
  * in the detached program, they will now no longer interfere with the
  * respective calls to other functions with different data, so no
  * synchronisation is necessary any more.
index a09d38caf6101eb4aced56d5eca03f740301a7bb..ca0742ff546b2c758c78b49fa84092fb278ad25e 100644 (file)
@@ -66,7 +66,7 @@ template<typename number> class FullMatrix;
  *
  * Finally, the @p default_reserve allocates extra space at the end
  * of the data array. This space is used whenever a row must be
- * enlarged. Since @p std::vector doubles the capacity everytime it
+ * enlarged. Since @p std::vector doubles the capacity every time it
  * must increase it, this value should allow for all the growth needed.
  *
  * Suggested settings: @p default_row_length should be the length of
index 4368433b342ab6d2fc1e28209fb90029de9b2606..01c2df6978248a8b63da855a86a8467c32b49668 100644 (file)
@@ -510,7 +510,7 @@ class SparsityPattern : public Subscriptor
                                       * structure is to hold. It is
                                       * assumed that this number is
                                       * sufficiently large to
-                                      * accomodate both the elements
+                                      * accommodate both the elements
                                       * in <tt>original</tt> as well
                                       * as the new off-diagonal
                                       * elements created by this
index a0228bcae7e2d7583a8ba6f98352df66d1fd8633..b512c5517cf65e165140b70e912dad40c9c09fb9 100644 (file)
@@ -90,7 +90,7 @@ class TridiagonalMatrix
                                       * value zero. This function is
                                       * mainly for internal
                                       * consistency checks and should
-                                      * seldomly be used when not in
+                                      * seldom be used when not in
                                       * debug mode since it uses quite
                                       * some time.
                                       */
index dfc37586a532f1a915dc92e00528f80bd83490a1..a76f34d1e4b9c217a3b8d43b2720e99c504b3609 100644 (file)
@@ -191,7 +191,7 @@ namespace TrilinosWrappers
       DeclException1 (ExcTrilinosError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a Trilinos function");
+                      << " occurred while calling a Trilinos function");
 
     protected:
 
@@ -611,7 +611,7 @@ namespace TrilinosWrappers
       DeclException1 (ExcTrilinosError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a Trilinos function");
+                      << " occurred while calling a Trilinos function");
 
     private:
 
index 120d9379ebdb73bddca8170603fdb80bb949c513..ff64607164af923bb7742f04ae6be6edddb5501b 100644 (file)
@@ -2175,7 +2175,7 @@ namespace TrilinosWrappers
       DeclException1 (ExcTrilinosError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a Trilinos function");
+                      << " occurred while calling a Trilinos function");
 
                                        /**
                                         * Exception
index 1590a8fb8dafd46309c48cf844c39ba560145462..a054538d5dd6bb160d0a5ee9961f2650b36226d4 100644 (file)
@@ -1296,7 +1296,7 @@ namespace TrilinosWrappers
       DeclException1 (ExcTrilinosError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a Trilinos function");
+                      << " occurred while calling a Trilinos function");
 
                                        /**
                                         * Exception
index c54df41ca039bd441f1cb02233c9191ed09a94ec..dc77b335fe68b37a58e22dcd850041577f9c19a0 100644 (file)
@@ -181,7 +181,7 @@ namespace TrilinosWrappers
         DeclException1 (ExcTrilinosError,
                         int,
                         << "An error with error number " << arg1
-                        << " occured while calling a Trilinos function");
+                        << " occurred while calling a Trilinos function");
 
                                        /**
                                         * Exception
@@ -549,7 +549,7 @@ namespace TrilinosWrappers
                                         * value zero. This function is
                                         * mainly for internal
                                         * consistency checks and should
-                                        * seldomly be used when not in
+                                        * seldom be used when not in
                                         * debug mode since it uses quite
                                         * some time.
                                         */
@@ -954,7 +954,7 @@ namespace TrilinosWrappers
       DeclException1 (ExcTrilinosError,
                       int,
                       << "An error with error number " << arg1
-                      << " occured while calling a Trilinos function");
+                      << " occurred while calling a Trilinos function");
 
                                        /**
                                         * Exception
index d0ad5e1fac5166e7b4b52f9ac98550794155e4c9..498a746687f62e319b723d9eab85a74253766033 100644 (file)
@@ -572,7 +572,7 @@ class Vector : public Subscriptor
                                       * Return whether the vector contains only
                                       * elements with value zero. This function
                                       * is mainly for internal consistency
-                                      * checks and should seldomly be used when
+                                      * checks and should seldom be used when
                                       * not in debug mode since it uses quite
                                       * some time.
                                       */
index c61e53a70796297c70ab71fb74212210c40fcd90..440e6342b4d5b2b6c7ea4aede837600e6453a196 100644 (file)
@@ -182,7 +182,7 @@ class VectorView : public Vector<Number>
                                       * reinit function. You can, however,
                                       * resize the view that you have of the
                                       * original object. Notice that it is
-                                      * your own responsability to ensure that
+                                      * your own responsibility to ensure that
                                       * the memory you are pointing to is big
                                       * enough.
                                       *
index b0c3ff591d7b29fbe801d57aa3660a932d9b334a..8678e28f95de582cb6a7808d251d1b72aecab8b0 100644 (file)
@@ -123,7 +123,7 @@ namespace MeshWorker
                                           * true). In each of the two,
                                           * each block should have
                                           * equal size and be large
-                                          * enough to accomodate all
+                                          * enough to accommodate all
                                           * user indices set in the
                                           * cells and faces covered by
                                           * the loop it is used
index 5935e8ee66c986cb970a7e6fd66be4125a3b5124..c7931c39794c4224e11a4cb837478900e2545ddd 100644 (file)
@@ -42,7 +42,7 @@ namespace MeshWorker
  * FEVALUES object is fixed in the constructor and only used to
  * initialize the pointers in #fevalv.
  *
- * Additionally, this function containes space to store the values of
+ * Additionally, this function contains space to store the values of
  * finite element functions stored in #global_data in the
  * quadrature points. These vectors are initialized automatically on
  * each cell or face. In order to avoid initializing unused vectors,
index 6cae5f4b9b1f0acc07c0f60f43e723774685c47b..808f84e716c6a2e58dd56af6fd7b346d8308ff83 100644 (file)
@@ -93,7 +93,7 @@ namespace MeshWorker
                                         * @note This function caches
                                         * the index associated with a
                                         * name. Therefore, it must be
-                                        * called everytime after the
+                                        * called every time after the
                                         * NamedData object has changed.
                                         */
       template <class DATA>
index 534e9aa90dda8e9798db0055c165415270685b45..b1695498e03c2be1bb9de910d6045bcb3e415a0b 100644 (file)
@@ -133,7 +133,7 @@ namespace MGTools
                                     *
                                     * There is one matrix for
                                     * couplings in a cell and one
-                                    * for the couplings occuring in
+                                    * for the couplings occurring in
                                     * fluxes.
                                     */
   template <int dim, class SparsityPattern, int spacedim>
index ae018046078663a1cbc739d571769b35387a03e8..7cb565b7fbc018ac70d4946e1604460423309935 100644 (file)
@@ -79,7 +79,7 @@ namespace internal
                                           * postprocessor is going to be
                                           * used. In that case, the names and
                                           * vector declarations are going to
-                                          * be aquired from the postprocessor.
+                                          * be acquired from the postprocessor.
                                           */
         DataEntryBase (const DataPostprocessor<DH::space_dimension> *data_postprocessor);
 
index 4c6859e16adae5d2e6ccc06a8c4d5339af89b593..c343871594cd0629af45c99996f6b482521334d0 100644 (file)
@@ -390,7 +390,7 @@ namespace Functions
                                      // found
     std::vector<bool> point_flags(np, false);
 
-                                     // Set this to true untill all
+                                     // Set this to true until all
                                      // points have been classified
     bool left_over = true;
 
index 0f73f989bb9726be16b2be8e835261cf5bf0586d..8c5e354db414fa00ac86714ac4f7c2cfdad1c77b 100644 (file)
@@ -412,7 +412,7 @@ class SolutionTransfer
                                      /**
                                       * All cell data (the dof indices and
                                       * the dof values)
-                                      * should be accessable from each cell.
+                                      * should be accessible from each cell.
                                       * As each cell has got only one
                                       * @p user_pointer, multiple pointers to the
                                       * data need to be packetized in a structure.
index f5c1929aa66994918596d313d49ae6ed4a8d5fa2..531621bcb8695737ce220925bb529b1984d646d3 100644 (file)
@@ -596,7 +596,7 @@ class TimeDependent
                                       * equally well use
                                       * <tt>bind2nd(mem_fun1(&X::unary_function), arg)</tt>
                                       * which lets the @p do_loop
-                                      * function call teh given function with
+                                      * function call the given function with
                                       * the specified parameter. Note that you
                                       * need to bind the second parameter since
                                       * the first one implicitly contains
@@ -1477,7 +1477,7 @@ namespace TimeStepBase_Tria_Flags
                                         * number correction is done,
                                         * but before grid adaption, so
                                         * the cell number on this grid
-                                        * is not noticably influenced
+                                        * is not noticeably influenced
                                         * by the cells flagged
                                         * additionally on the previous
                                         * grid.
@@ -1696,7 +1696,7 @@ class TimeStepBase_Tria : public TimeStepBase
                                       * the respective @p wake_up function can
                                       * rebuild it. You should therefore call
                                       * this function from your overloaded
-                                      * version, preferrably at the end so
+                                      * version, preferably at the end so
                                       * that your function can use the
                                       * triangulation as long as ou need it.
                                       */
index 823d6a45e3ddf9525dfe97311dcb7c09c8043946..0852961cf741c8150bc541ccced1c64edc26f9e9 100644 (file)
@@ -49,7 +49,7 @@ class ConstraintMatrix;
 //TODO: Move documentation of functions to the functions!
 
 /**
- * Provide a namespace which offers some operations on vectors. Amoung
+ * Provide a namespace which offers some operations on vectors. Among
  * these are assembling of standard vectors, integration of the
  * difference of a finite element solution and a continuous function,
  * interpolations and projections of continuous functions to the
index be1e3f671576cbd5218663bddaf7e44032bb00a6..7f0e2183c11f2a7ed28e11f6f8bec94c2c3870ba 100644 (file)
@@ -137,7 +137,7 @@ ConvergenceTable::evaluate_convergence_rates(const std::string &data_column_key,
       case reduction_rate_log2:
             rate_key+="red.rate.log2";
             Assert(columns.count(rate_key)==0, ExcRateColumnAlreadyExists(rate_key));
-                                             // no value availble for the
+                                             // no value available for the
                                              // first row
             add_value(rate_key, std::string("-"));
             for (unsigned int i=1; i<n; ++i)
index e367ecf4ce7cea921c821c1fbcd047ae77b6d6c5..557c59aac0325ea530a5e0e01614214983af5e1e 100644 (file)
@@ -3138,7 +3138,7 @@ void DataOutBase::write_povray (const std::vector<Patch<dim,spacedim> > &patches
 
       if (!flags.bicubic_patch)
         {
-                                           // aproximate normal
+                                           // approximate normal
                                            // vectors in patch
           std::vector<Point<3> > nrml;
                                            // only if smooth triangles are used
index aab89d8c79bf8497118c9e6a20f9877970d7ee5d..e60f66f28d91dce2af38c9ea59835b585da25559 100644 (file)
@@ -91,7 +91,7 @@ unsigned int MultithreadInfo::get_n_cpus()
 #  elif defined(__MACH__) && defined(__APPLE__)
 // This is only tested on a dual G5 2.5GHz running MacOSX 10.3.6
 // and on an Intel Mac Book Pro.
-// If it doesnt work please contact the mailinglist.
+// If it doesn't work please contact the mailinglist.
 unsigned int MultithreadInfo::get_n_cpus()
 {
         int mib[2];
index cb51865e7c22844583a2b6778293748aca19526c..29f23cb9394cc53237950d6609f4b86fd8caf5ae 100644 (file)
@@ -149,7 +149,7 @@ Quadrature<dim>::Quadrature (const SubQuadrature &q1,
       double sum = 0;
       for (unsigned int i=0; i<size(); ++i)
         sum += weights[i];
-                                       // we cant guarantee the sum of weights
+                                       // we cannot guarantee the sum of weights
                                        // to be exactly one, but it should be
                                        // near that.
       Assert ((sum>0.999999) && (sum<1.000001), ExcInternalError());
@@ -186,7 +186,7 @@ Quadrature<1>::Quadrature (const SubQuadrature&,
       double sum = 0;
       for (unsigned int i=0; i<size(); ++i)
         sum += weights[i];
-                                       // we cant guarantee the sum of weights
+                                       // we cannot guarantee the sum of weights
                                        // to be exactly one, but it should be
                                        // near that.
       Assert ((sum>0.999999) && (sum<1.000001), ExcInternalError());
@@ -1230,7 +1230,7 @@ subface (const unsigned int face_no,
                                    // already for the isotropic
                                    // case. Additionally, we have three
                                    // different refinement cases, resulting in
-                                   // <tt>4 + 2 + 2 = 8</tt> differnt subfaces
+                                   // <tt>4 + 2 + 2 = 8</tt> different subfaces
                                    // for each face.
   const unsigned int total_subfaces_per_face=8;
 
index 1be336cebb635c3e965a063f4dbb3b5dfc2e0689..fb4a98ac97cf5e95c0520ca44cf00cd56088b941 100644 (file)
@@ -1780,7 +1780,7 @@ DoFHandler<dim,spacedim>::max_couplings_between_boundary_dofs () const
                                              // this assumption is not
                                              // justified and needs to be
                                              // fixed some time. fortunately,
-                                             // ommitting it for now does no
+                                             // omitting it for now does no
                                              // harm since the matrix will cry
                                              // foul if its requirements are
                                              // not satisfied
index 435690e3d512c92a8f3ae577abeef66bb15b6330..241199d8918c8039b9c7fa2feaca6ba28e5860d8 100644 (file)
@@ -1491,7 +1491,7 @@ namespace internal
 
 
                                            // * Create global_dof_indexsets by
-                                           // transfering our own owned_dofs to
+                                           // transferring our own owned_dofs to
                                            // every other machine.
           const unsigned int n_cpus = Utilities::System::
                                       get_n_mpi_processes (tr->get_communicator());
index 8a5811c4f00556197cda5fe8dd5964b4de07947d..15fe75d4cacbbf507b71cefd59b59d18efc37e24 100644 (file)
@@ -97,7 +97,7 @@ FiniteElement<dim,spacedim>::InternalDataBase::~InternalDataBase ()
       {
                                          // delete pointer and set it
                                          // to zero to avoid
-                                         // inadvertant use
+                                         // inadvertent use
         delete differences[i];
         differences[i] = 0;
       };
index 38bccab0d1340427a8392e279a68baef90456f36..a4eac7d0e58b48f60d980dfe7b3f47fbe6b51f82 100644 (file)
@@ -42,7 +42,7 @@ template <int dim, int spacedim>
 FESystem<dim,spacedim>::InternalData::~InternalData()
 {
                                    // delete pointers and set them to
-                                   // zero to avoid inadvertant use
+                                   // zero to avoid inadvertent use
   for (unsigned int i=0; i<base_fe_datas.size(); ++i)
     if (base_fe_datas[i])
       {
@@ -3510,7 +3510,7 @@ FESystem<dim,spacedim>::memory_consumption () const
 {
                                    // neglect size of data stored in
                                    // @p{base_elements} due to some
-                                   // problems with teh
+                                   // problems with the
                                    // compiler. should be neglectable
                                    // after all, considering the size
                                    // of the data of the subelements
index beee6d889c11c88180172b55854c4d0c13aabd5f..facc4b8efd0b87470d8b60d9f1162a73c664fb4b 100644 (file)
@@ -2311,7 +2311,7 @@ namespace FETools
         if (pos2 != pos1)
           name.erase(pos1, pos2-pos1+1);
       }
-                                     // Replace all occurences of "^dim"
+                                     // Replace all occurrences of "^dim"
                                      // by "^d" to be handled by the
                                      // next loop
     for (unsigned int pos = name.find("^dim");
@@ -2319,7 +2319,7 @@ namespace FETools
          pos = name.find("^dim"))
       name.erase(pos+2, 2);
 
-                                     // Replace all occurences of "^d"
+                                     // Replace all occurrences of "^d"
                                      // by using the actual dimension
     for (unsigned int pos = name.find("^d");
          pos < name.size();
index 73817630e1be958e4d650d394beb0330982626dc..5657c97f90c77e92a981e5b5745605b33be553a0 100644 (file)
@@ -1263,7 +1263,7 @@ MappingQ<dim,spacedim>::transform (
   const MappingType mapping_type) const
 {
   AssertDimension (input.size(), output.size());
-                                   // The data object may be jsut a
+                                   // The data object may be just a
                                    // MappingQ1::InternalData, so we
                                    // have to test for this first.
   const typename MappingQ1<dim,spacedim>::InternalData *q1_data =
@@ -1302,7 +1302,7 @@ MappingQ<dim,spacedim>::transform (
   const MappingType mapping_type) const
 {
   AssertDimension (input.size(), output.size());
-                                   // The data object may be jsut a
+                                   // The data object may be just a
                                    // MappingQ1::InternalData, so we
                                    // have to test for this first.
   const typename MappingQ1<dim,spacedim>::InternalData *q1_data =
@@ -1339,7 +1339,7 @@ void MappingQ<dim,spacedim>::transform
  const MappingType mapping_type) const
 {
   AssertDimension (input.size(), output.size());
-                                   // The data object may be jsut a
+                                   // The data object may be just a
                                    // MappingQ1::InternalData, so we
                                    // have to test for this first.
   const typename MappingQ1<dim,spacedim>::InternalData *q1_data =
index 26c57ceb8eaca4e95e8cd28adfbaefc8d7b0cb0b..5db865c14e7f0a18f55152c577389e58df29ead3 100644 (file)
@@ -1578,7 +1578,7 @@ GridGenerator::colorize_hyper_shell (
   Triangulation<2>& tria,
   const Point<2>&, const double, const double)
 {
-                                   // Inspite of receiving geometrical
+                                   // In spite of receiving geometrical
                                    // data, we do this only based on
                                    // topology.
 
index bbda1d4f87ad6b46a08cbde3d5d17fbbb26e14ec..429490e4f69fa61087e1b25731c3c41b23319017 100644 (file)
@@ -1489,7 +1489,7 @@ namespace internal
           Assert (perm_num != numbers::invalid_unsigned_int,
                   ExcGridOrientError("No node having 3 incoming edges found in curent hex."));
 
-                                           // So use the apropriate
+                                           // So use the appropriate
                                            // rotation to get the new
                                            // cube
           unsigned int temp[8];
index 97aabd511f49cc4105f3bf02fb90303ff1d0701f..1aa14654ed23253464376468824f40125a0d6635 100644 (file)
@@ -30,7 +30,7 @@ DEAL_II_NAMESPACE_OPEN
 
 namespace
 {
-// helper function to aquire the number of levels within a grid
+// helper function to acquire the number of levels within a grid
   template <class GridClass>
   unsigned int
   get_n_levels (const GridClass &grid)
index 693bab96cfbd38fdcb0ce8db9aaae775f4a209ab..24215318aedbf3637c8e8ee72882a456f5ad3b15 100644 (file)
@@ -5662,7 +5662,7 @@ namespace internal
                                                              // in memory, we won't find
                                                              // them later on, so we have
                                                              // to create new ones instead
-                                                             // and replace all occurances
+                                                             // and replace all occurrences
                                                              // of the old ones with those
                                                              // new ones. As this is kind
                                                              // of ugly, we hope we don't
@@ -6535,7 +6535,7 @@ namespace internal
                                                        // similar, the actual work
                                                        // strongly depends on the actual
                                                        // refinement case. therefore, we
-                                                       // use seperate blocks of code for
+                                                       // use separate blocks of code for
                                                        // each of these cases, which
                                                        // hopefully increases the
                                                        // readability to some extend.
@@ -9030,7 +9030,7 @@ namespace internal
                                                              // coordinate direction (0
                                                              // for faces 0 and 1, 1 for
                                                              // faces 2 and 3, 2 for faces
-                                                             // 4 and 5) and substract the
+                                                             // 4 and 5) and subtract the
                                                              // correct boundary value of
                                                              // the face (0 for faces 0,
                                                              // 2, and 4; 1 for faces 1, 3
@@ -9359,7 +9359,7 @@ namespace internal
                                                            // are further refined along
                                                            // the face, otherwise
                                                            // something went wrong in the
-                                                           // contruction of neighbor
+                                                           // construction of neighbor
                                                            // pointers.  then only allow
                                                            // coarsening if this neighbor
                                                            // will be coarsened as well
@@ -12543,7 +12543,7 @@ unsigned int Triangulation<dim, spacedim>::max_adjacent_cells () const
                                    // larger dimensions
   std::vector<unsigned short int> usage_count (max_vertex_index+1, 0);
                                    // touch a vertex's usage count
-                                   // everytime we find an adjacent
+                                   // every time we find an adjacent
                                    // element
   for (cell=begin(); cell!=endc; ++cell)
     for (unsigned vertex=0; vertex<GeometryInfo<dim>::vertices_per_cell; ++vertex)
@@ -13263,7 +13263,7 @@ namespace
                                                  // now extract which
                                                  // refine case would
                                                  // be necessary to
-                                                 // achive the same
+                                                 // achieve the same
                                                  // face
                                                  // refinement. set
                                                  // the intersection
@@ -13423,7 +13423,7 @@ bool Triangulation<dim,spacedim>::prepare_coarsening_and_refinement ()
                                    // 1/ do not coarsen a cell if
                                    //    'most of the neighbors' will be
                                    //    refined after the step. This is
-                                   //    to prevent occurence of
+                                   //    to prevent occurrence of
                                    //    unrefined islands.
                                    // 2/ eliminate refined islands in the
                                    //    interior and at the boundary. since
@@ -13518,7 +13518,7 @@ bool Triangulation<dim,spacedim>::prepare_coarsening_and_refinement ()
                                        //    do not coarsen a cell if 'most of
                                        //    the neighbors' will be refined after
                                        //    the step. This is to prevent the
-                                       //    occurence of unrefined islands.
+                                       //    occurrence of unrefined islands.
                                        //    If patch_level_1 is set, this will
                                        //    be automatically fulfilled.
       if (smooth_grid & do_not_produce_unrefined_islands &&
index 6d5ae33f821f7b9987752ec2edb2958d70a016bf..db2550087fad713fb90fafaa812e26af91664c64 100644 (file)
@@ -1162,7 +1162,7 @@ bool CellAccessor<3>::point_inside (const Point<3> &p) const
                                    // Weimar
 
                                    // we first eliminate points based
-                                   // on the maximum and minumum of
+                                   // on the maximum and minimum of
                                    // the corner coordinates, then
                                    // transform to the unit cell, and
                                    // check there.
index a4f8d14cc3e7860312aa46df01493f84d05730c3..09b2fbef5d80d245ebcedacfc5e532b93648590d 100644 (file)
@@ -3886,7 +3886,7 @@ template <>
                                                // we assume here, that only four faces
                                                // meet at the boundary; this assumption
                                                // is not justified and needs to be
-                                               // fixed some time. fortunately, ommitting
+                                               // fixed some time. fortunately, omitting
                                                // it for now does no harm since the
                                                // matrix will cry foul if its requirements
                                                // are not satisfied
index c9fe894f51647be65bd45fb3c7bc7adeea20e351..72431cf7901205f6f959bac60f360953ffe18f58 100644 (file)
@@ -43,7 +43,7 @@ SolverControl::NoConvergence::what () const throw ()
                                    //
                                    // we need to make this object static, since
                                    // we want to return the data stored in it
-                                   // and therefore need a liftime which is
+                                   // and therefore need a lifetime which is
                                    // longer than the execution time of this
                                    // function
   static std::string description;
index 8d35e682539bb0557321a8add13b913e9da9ab22..e92e0246e0e20e0ffff78704e2d07324fcc60b9d 100644 (file)
@@ -419,7 +419,7 @@ void MGTransferBlockBase::build_matrices (
             continue;
 
                                 // need to delete all the columns in the
-                                // matrix that are on the boundary. to achive
+                                // matrix that are on the boundary. to achieve
                                 // this, create an array as long as there are
                                 // matrix columns, and find which columns we
                                 // need to filter away.
index 596fe651ab8b424368a6412f91682693f693cd9c..8f180f7ede399b988d67f6e1065a0299f4558573 100644 (file)
@@ -177,7 +177,7 @@ void MGTransferPrebuilt<VECTOR>::build_matrices (
             continue;
 
                                 // need to delete all the columns in the
-                                // matrix that are on the boundary. to achive
+                                // matrix that are on the boundary. to achieve
                                 // this, create an array as long as there are
                                 // matrix columns, and find which columns we
                                 // need to filter away.
index b5c20acde8798b2c311fd25ce38d848e4fbf342b..b3477e39e7223976bece84889a52678bea4ae29d 100644 (file)
@@ -190,7 +190,7 @@ namespace internal
                                           * postprocessor is going to be
                                           * used. In that case, the names and
                                           * vector declarations are going to
-                                          * be aquired from the postprocessor.
+                                          * be acquired from the postprocessor.
                                           */
         DataEntry (const VectorType                       *data,
                    const DataPostprocessor<DH::space_dimension> *data_postprocessor);

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.