From: bangerth Date: Tue, 29 May 2012 19:16:36 +0000 (+0000) Subject: Find and review a large number of typos. (Thanks, Matthias Maier, for running the... X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=40aaacf4f10aaf3a09ddc4ba3e72f3d84f8d1de6;p=dealii-svn.git Find and review a large number of typos. (Thanks, Matthias Maier, for running the script.) git-svn-id: https://svn.dealii.org/trunk@25560 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/doxygen/headers/distributed.h b/deal.II/doc/doxygen/headers/distributed.h index a733ed9eb7..b549dd4c83 100644 --- a/deal.II/doc/doxygen/headers/distributed.h +++ b/deal.II/doc/doxygen/headers/distributed.h @@ -284,7 +284,7 @@ * 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 diff --git a/deal.II/doc/doxygen/headers/exceptions.h b/deal.II/doc/doxygen/headers/exceptions.h index 761ed8114f..c39d08dd41 100644 --- a/deal.II/doc/doxygen/headers/exceptions.h +++ b/deal.II/doc/doxygen/headers/exceptions.h @@ -159,7 +159,7 @@ * (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 exc diff --git a/deal.II/doc/doxygen/headers/glossary.h b/deal.II/doc/doxygen/headers/glossary.h index 89b313db88..797fed3e12 100644 --- a/deal.II/doc/doxygen/headers/glossary.h +++ b/deal.II/doc/doxygen/headers/glossary.h @@ -738,7 +738,7 @@ Article{BK07, * *
@anchor GlossMaterialId Material id
*
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 diff --git a/deal.II/doc/doxygen/headers/io.h b/deal.II/doc/doxygen/headers/io.h index 9d5666d1d5..4fed985a4e 100644 --- a/deal.II/doc/doxygen/headers/io.h +++ b/deal.II/doc/doxygen/headers/io.h @@ -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. diff --git a/deal.II/doc/doxygen/headers/iterators.h b/deal.II/doc/doxygen/headers/iterators.h index 3fb574718a..0ab81cc360 100644 --- a/deal.II/doc/doxygen/headers/iterators.h +++ b/deal.II/doc/doxygen/headers/iterators.h @@ -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 present_level member variable. diff --git a/deal.II/doc/doxygen/headers/multithreading.h b/deal.II/doc/doxygen/headers/multithreading.h index 40407affe1..e4e9d99228 100644 --- a/deal.II/doc/doxygen/headers/multithreading.h +++ b/deal.II/doc/doxygen/headers/multithreading.h @@ -177,7 +177,7 @@ * bit more creative. The way chosen is to introduce a function * new_task that takes as arguments the function to call as well * as the arguments to the call. The new_task 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: diff --git a/deal.II/doc/doxygen/headers/numerical_algorithms.h b/deal.II/doc/doxygen/headers/numerical_algorithms.h index 9d009a7920..34ac3d345a 100644 --- a/deal.II/doc/doxygen/headers/numerical_algorithms.h +++ b/deal.II/doc/doxygen/headers/numerical_algorithms.h @@ -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 diff --git a/deal.II/doc/doxygen/headers/update_flags.h b/deal.II/doc/doxygen/headers/update_flags.h index 8d86e1381e..ed547b39cc 100644 --- a/deal.II/doc/doxygen/headers/update_flags.h +++ b/deal.II/doc/doxygen/headers/update_flags.h @@ -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 update_once=0 update_each=update_jacobians 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:
  1. Are any additional values required in order to compute the diff --git a/deal.II/doc/doxygen/tutorial/toc-list.html b/deal.II/doc/doxygen/tutorial/toc-list.html index f00cd561a7..09dc3c5097 100644 --- a/deal.II/doc/doxygen/tutorial/toc-list.html +++ b/deal.II/doc/doxygen/tutorial/toc-list.html @@ -121,7 +121,7 @@ Step-15 1d problems, nonlinear solvers, - transfering a solution across mesh refinement. + transferring a solution across mesh refinement. diff --git a/deal.II/doc/doxygen/tutorial/toc-topics.html b/deal.II/doc/doxygen/tutorial/toc-topics.html index d0b0662b02..77646263e8 100644 --- a/deal.II/doc/doxygen/tutorial/toc-topics.html +++ b/deal.II/doc/doxygen/tutorial/toc-topics.html @@ -192,7 +192,7 @@ Step-40, Step-43 - Transfering solutions across mesh refinement + Transferring solutions across mesh refinement diff --git a/deal.II/doc/external-libs/arpack.html b/deal.II/doc/external-libs/arpack.html index b42ca13c63..b8b9c9443c 100644 --- a/deal.II/doc/external-libs/arpack.html +++ b/deal.II/doc/external-libs/arpack.html @@ -42,7 +42,7 @@

    Note: For compilation of ARPACK we emphasise - adding the compiler flag -fPIC. This is a definate + adding the compiler flag -fPIC. This is a definite requirement if we are compiling deal.II with shared libraries (which is the default). If we had preferred to be compiling deal.II without shared libraries, diff --git a/deal.II/doc/external-libs/mumps.html b/deal.II/doc/external-libs/mumps.html index c8a2ae159c..6749f1c2cc 100644 --- a/deal.II/doc/external-libs/mumps.html +++ b/deal.II/doc/external-libs/mumps.html @@ -276,7 +276,7 @@

  2. Finally we add the flag -fPIC to the three compiler flag variables OPTF, OPTC, and OPTL 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 deal.II with MUMPS as a shared library.
  3. @@ -306,7 +306,7 @@

    Note: Throughout this description of the compilation process of MUMPS we have emphasised adding the - compiler flag -fPIC. This is a definate requirement + compiler flag -fPIC. This is a definite requirement if we are compiling deal.II with shared libraries (which is the default). If we had preferred to be compiling deal.II without shared libraries, diff --git a/deal.II/doc/news/2000/3.0.0-vs-3.1.0.html b/deal.II/doc/news/2000/3.0.0-vs-3.1.0.html index c22b179f7a..2a712c1e72 100644 --- a/deal.II/doc/news/2000/3.0.0-vs-3.1.0.html +++ b/deal.II/doc/news/2000/3.0.0-vs-3.1.0.html @@ -453,7 +453,7 @@ documentation, etc.

  4. New: SolverControl has an interface - to ParameterHandler, definining and + to ParameterHandler, defining and reading parameters from a file automatically.
    (GK 2000/05/24) diff --git a/deal.II/doc/news/2001/3.1.0-vs-3.2.0.html b/deal.II/doc/news/2001/3.1.0-vs-3.2.0.html index 837c0f106d..2bacdd45b2 100644 --- a/deal.II/doc/news/2001/3.1.0-vs-3.2.0.html +++ b/deal.II/doc/news/2001/3.1.0-vs-3.2.0.html @@ -1002,7 +1002,7 @@ documentation, etc.

  5. New: There is now a class MappingC1 - that implements a continously differentiable C1 + that implements a continuously differentiable C1 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). diff --git a/deal.II/doc/news/3.4.0-vs-4.0.0.html b/deal.II/doc/news/3.4.0-vs-4.0.0.html index 287ca1d2c4..23fde020fa 100644 --- a/deal.II/doc/news/3.4.0-vs-4.0.0.html +++ b/deal.II/doc/news/3.4.0-vs-4.0.0.html @@ -747,7 +747,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK

  6. 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.
    (Stephen Kolaroff 2002/11/27)

    @@ -1051,7 +1051,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK New: Checked in new GridGenerator member function half_hyper_ball, derived from member hyper_ball. - 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 HalfHyperBallBoundary.
    (Brian Carnes 2002/12/16) @@ -1061,7 +1061,7 @@ contributor's names are abbreviated by WB (Wolfgang Bangerth), GK New: Checked in new class FE_Q_Hierarchical derived from class FiniteElement. This element is analogous to FE_Q, but - makes use of hierachical shape functions, based on the + makes use of hierarchical shape functions, based on the Polynomials::Hierarchical class. For degree>1, the non-nodal basis functions are "bubble" functions, which are not Lagrange polynomials. Therefore, the usual diff --git a/deal.II/doc/news/4.0.0-vs-5.0.0.html b/deal.II/doc/news/4.0.0-vs-5.0.0.html index 897750a102..312bcf12a2 100644 --- a/deal.II/doc/news/4.0.0-vs-5.0.0.html +++ b/deal.II/doc/news/4.0.0-vs-5.0.0.html @@ -523,7 +523,7 @@ inconvenience this causes.
  7. Fixed: The SolverMinRes 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.
    (WB 2004/02/26) diff --git a/deal.II/doc/news/5.2.0-vs-6.0.0.html b/deal.II/doc/news/5.2.0-vs-6.0.0.html index fb3e80ab17..27a8ea7b0e 100644 --- a/deal.II/doc/news/5.2.0-vs-6.0.0.html +++ b/deal.II/doc/news/5.2.0-vs-6.0.0.html @@ -91,7 +91,7 @@ inconvenience this causes.

  8. Changed: Lower dimensional objects have been removed from the - hierachical structure of levels in TriaLevel. 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.

  9. 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 announcement @@ -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 GeometryInfo. 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 face_orientation have to be supplemented by face_flip and face_rotation.
    In order to reduce the impact of possible bugs, the grid is still given to diff --git a/deal.II/doc/news/6.0.0-vs-6.1.0.h b/deal.II/doc/news/6.0.0-vs-6.1.0.h index 7871cad9df..8d324cfc34 100644 --- a/deal.II/doc/news/6.0.0-vs-6.1.0.h +++ b/deal.II/doc/news/6.0.0-vs-6.1.0.h @@ -66,7 +66,7 @@ inconvenience this causes.

  10. 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 diff --git a/deal.II/doc/news/6.1.0-vs-6.2.0.h b/deal.II/doc/news/6.1.0-vs-6.2.0.h index e0fef796e9..6de0c2aaa6 100644 --- a/deal.II/doc/news/6.1.0-vs-6.2.0.h +++ b/deal.II/doc/news/6.1.0-vs-6.2.0.h @@ -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.
    diff --git a/deal.II/doc/news/6.2.0-vs-6.3.0.h b/deal.II/doc/news/6.2.0-vs-6.3.0.h index bb8d652977..d516c4fac4 100644 --- a/deal.II/doc/news/6.2.0-vs-6.3.0.h +++ b/deal.II/doc/news/6.2.0-vs-6.3.0.h @@ -57,7 +57,7 @@ inconvenience this causes.

  11. 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 <2.3.0. Attempting to configure deal.II with PETSc versions that are diff --git a/deal.II/doc/news/7.0.0-vs-7.1.0.h b/deal.II/doc/news/7.0.0-vs-7.1.0.h index 11b550b391..6d4ef48ce1 100644 --- a/deal.II/doc/news/7.0.0-vs-7.1.0.h +++ b/deal.II/doc/news/7.0.0-vs-7.1.0.h @@ -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.
    (Wolfgang Bangerth, 2011/05/29) diff --git a/deal.II/doc/news/changes.h b/deal.II/doc/news/changes.h index 7102fa6c27..bb67db78af 100644 --- a/deal.II/doc/news/changes.h +++ b/deal.II/doc/news/changes.h @@ -341,8 +341,8 @@ a valid output file.

  12. Improved: PETScWrappers::SolverXXX 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 --ksp_*; giving greater flexability in controling PETSc -solvers. (See class documentation). +-ksp_*; giving greater flexibility in controlling PETSc +solvers. (See the class's documentation).
    (Vijay S. Mahadevan, 2011/12/22) diff --git a/deal.II/doc/reports/dimension-independent/index.html b/deal.II/doc/reports/dimension-independent/index.html index 10d42ca563..be5e7dc544 100644 --- a/deal.II/doc/reports/dimension-independent/index.html +++ b/deal.II/doc/reports/dimension-independent/index.html @@ -590,7 +590,7 @@ time to implement an algorithm is often more significant than the time to actually execute it.

    -Acknowledgments Present development and maintainance of deal.II is a +Acknowledgments 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 diff --git a/deal.II/doc/reports/mapping_q/index.html b/deal.II/doc/reports/mapping_q/index.html index 706cadeb3f..487a4d79de 100644 --- a/deal.II/doc/reports/mapping_q/index.html +++ b/deal.II/doc/reports/mapping_q/index.html @@ -65,7 +65,7 @@ to the element SRC="img9.gif" ALT="$K=\sigma_K(\hat K)$"> in real space, whereas on cells K at the -boundary, i.e. +boundary, i.e. $K\in T_h$ be a cell of the -triangulation Th with +triangulation Th with $i=0,\ldots,(p+1)^d-1$, we define a -Qp-mapping +Qp-mapping $i=0,\ldots,(p+1)^2-1$ -for degrees +for degrees $0\leq i<(p+1)^2$, -for degrees +for degrees 2. Thus the first 4p points are placed -on the boundary +on the boundary

    According to (2) these points are mapped to the -mapping support points pk, +mapping support points pk,

    -While the support points pk, +While the support points pk, $\hat K$. Discrete boundary conditions are imposed that are given by the -coordinates of the mapping support points pk, +coordinates of the mapping support points pk, $\sigma $. -Here, the discrete boundary function +Here, the discrete boundary function $\phi_i$ the corresponding Lagrangian interpolation basis function. We recall that the numbering of the mapping support points -involves +involves $p_k\in\partial K$ -for +for 1), (

    -with the matrices +with the matrices $S_{ij}\in\mathbb R^{(p-1)^2\times(p-1)^2}$ -and +and

    of the linear combination (
    8), that represents the dependency of the jth inner mapping support point -p4p+j on the support points pk, +p4p+j on the support points pk, Mapping class. In MappingQ::compute_support_points_laplace, first the 4p points on the boundary of the cell are computed (by calling MappingQ::add_line_support_points), then by calling MappingQ::apply_laplace_vector the remaining (p-1)2 inner mapping supports points are computed, where -MappingQ::apply_laplace_vector just performes the linear +MappingQ::apply_laplace_vector just performs the linear combination given in (8).

    diff --git a/deal.II/doc/reports/multithreading/node12.html b/deal.II/doc/reports/multithreading/node12.html index a006404738..5e6fd4cef3 100644 --- a/deal.II/doc/reports/multithreading/node12.html +++ b/deal.II/doc/reports/multithreading/node12.html @@ -49,7 +49,7 @@ Conclusions

    We have shown how multi-threading is supported in deal.II 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 diff --git a/deal.II/examples/step-10/doc/results.dox b/deal.II/examples/step-10/doc/results.dox index fd81759e25..785792d11b 100644 --- a/deal.II/examples/step-10/doc/results.dox +++ b/deal.II/examples/step-10/doc/results.dox @@ -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. diff --git a/deal.II/examples/step-13/doc/results.dox b/deal.II/examples/step-13/doc/results.dox index 9e570382cd..86de3d4aab 100644 --- a/deal.II/examples/step-13/doc/results.dox +++ b/deal.II/examples/step-13/doc/results.dox @@ -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 diff --git a/deal.II/examples/step-14/doc/results.dox b/deal.II/examples/step-14/doc/results.dox index b0f44a46bf..595dd8906c 100644 --- a/deal.II/examples/step-14/doc/results.dox +++ b/deal.II/examples/step-14/doc/results.dox @@ -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 PointValueEvaluation in the main function by PointXDerivativeEvaluation, and let the program run: @code diff --git a/deal.II/examples/step-14/step-14.cc b/deal.II/examples/step-14/step-14.cc index c43c970f4e..e3167db652 100644 --- a/deal.II/examples/step-14/step-14.cc +++ b/deal.II/examples/step-14/step-14.cc @@ -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 diff --git a/deal.II/examples/step-15/step-15.cc b/deal.II/examples/step-15/step-15.cc index 664e9f56a1..483a54a57f 100644 --- a/deal.II/examples/step-15/step-15.cc +++ b/deal.II/examples/step-15/step-15.cc @@ -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 refine_grid function, while the - // vector is transfered to the new mesh. + // vector is transferred to the new mesh. if (first_step) { diff --git a/deal.II/examples/step-17/doc/intro.dox b/deal.II/examples/step-17/doc/intro.dox index 18c8deeb6a..631360953f 100644 --- a/deal.II/examples/step-17/doc/intro.dox +++ b/deal.II/examples/step-17/doc/intro.dox @@ -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. diff --git a/deal.II/examples/step-18/step-18.cc b/deal.II/examples/step-18/step-18.cc index 35a46754e5..0297cdfab8 100644 --- a/deal.II/examples/step-18/step-18.cc +++ b/deal.II/examples/step-18/step-18.cc @@ -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 diff --git a/deal.II/examples/step-2/step-2.cc b/deal.II/examples/step-2/step-2.cc index 8a24ffb6d4..fc9110a46f 100644 --- a/deal.II/examples/step-2/step-2.cc +++ b/deal.II/examples/step-2/step-2.cc @@ -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 diff --git a/deal.II/examples/step-20/doc/results.dox b/deal.II/examples/step-20/doc/results.dox index d07e4c3df3..f281abd694 100644 --- a/deal.II/examples/step-20/doc/results.dox +++ b/deal.II/examples/step-20/doc/results.dox @@ -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 - // 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 @@ -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 diff --git a/deal.II/examples/step-24/doc/intro.dox b/deal.II/examples/step-24/doc/intro.dox index 1d94b8ee5e..4ee0f37f70 100644 --- a/deal.II/examples/step-24/doc/intro.dox +++ b/deal.II/examples/step-24/doc/intro.dox @@ -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 diff --git a/deal.II/examples/step-25/doc/intro.dox b/deal.II/examples/step-25/doc/intro.dox index a915bc4c52..f43b6a3178 100644 --- a/deal.II/examples/step-25/doc/intro.dox +++ b/deal.II/examples/step-25/doc/intro.dox @@ -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ödinger equation for particles with non-zero mass. The resemblence is not just +the Schrö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 & Skyrme in Nuclear Physics 31) and the diff --git a/deal.II/examples/step-25/step-25.cc b/deal.II/examples/step-25/step-25.cc index 8f912012ef..19f401aad8 100644 --- a/deal.II/examples/step-25/step-25.cc +++ b/deal.II/examples/step-25/step-25.cc @@ -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 // deallog.depth_console // to zero. Furthermore, if diff --git a/deal.II/examples/step-28/step-28.cc b/deal.II/examples/step-28/step-28.cc index 3cf757a6b6..c74b2c4e2f 100644 --- a/deal.II/examples/step-28/step-28.cc +++ b/deal.II/examples/step-28/step-28.cc @@ -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()) diff --git a/deal.II/examples/step-29/doc/results.dox b/deal.II/examples/step-29/doc/results.dox index 3274a41ee2..f2a4ea663c 100644 --- a/deal.II/examples/step-29/doc/results.dox +++ b/deal.II/examples/step-29/doc/results.dox @@ -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. diff --git a/deal.II/examples/step-31/step-31.cc b/deal.II/examples/step-31/step-31.cc index 4f3f39ae4b..e294cf2016 100644 --- a/deal.II/examples/step-31/step-31.cc +++ b/deal.II/examples/step-31/step-31.cc @@ -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 diff --git a/deal.II/examples/step-32/step-32.cc b/deal.II/examples/step-32/step-32.cc index 7f3fcc77c0..386b9b1aff 100644 --- a/deal.II/examples/step-32/step-32.cc +++ b/deal.II/examples/step-32/step-32.cc @@ -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 diff --git a/deal.II/examples/step-33/doc/intro.dox b/deal.II/examples/step-33/doc/intro.dox index 2c9e0d157d..acafeee5dc 100644 --- a/deal.II/examples/step-33/doc/intro.dox +++ b/deal.II/examples/step-33/doc/intro.dox @@ -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. diff --git a/deal.II/examples/step-33/doc/results.dox b/deal.II/examples/step-33/doc/results.dox index 1d2d9a5467..430e1a2423 100644 --- a/deal.II/examples/step-33/doc/results.dox +++ b/deal.II/examples/step-33/doc/results.dox @@ -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. diff --git a/deal.II/examples/step-33/step-33.cc b/deal.II/examples/step-33/step-33.cc index d95ffcced5..9394797e20 100644 --- a/deal.II/examples/step-33/step-33.cc +++ b/deal.II/examples/step-33/step-33.cc @@ -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: diff --git a/deal.II/examples/step-34/step-34.cc b/deal.II/examples/step-34/step-34.cc index d101457575..cc27622beb 100644 --- a/deal.II/examples/step-34/step-34.cc +++ b/deal.II/examples/step-34/step-34.cc @@ -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[ diff --git a/deal.II/examples/step-36/step-36.cc b/deal.II/examples/step-36/step-36.cc index baed9382e0..40862d2aee 100644 --- a/deal.II/examples/step-36/step-36.cc +++ b/deal.II/examples/step-36/step-36.cc @@ -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 diff --git a/deal.II/examples/step-4/doc/intro.dox b/deal.II/examples/step-4/doc/intro.dox index c345efb6f7..8aa9428d96 100644 --- a/deal.II/examples/step-4/doc/intro.dox +++ b/deal.II/examples/step-4/doc/intro.dox @@ -101,7 +101,7 @@ This function has a member variable of type DoFHandler@. 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 make_grid function and reserving the right diff --git a/deal.II/examples/step-43/step-43.cc b/deal.II/examples/step-43/step-43.cc index 46bc040e5c..775395f4b4 100644 --- a/deal.II/examples/step-43/step-43.cc +++ b/deal.II/examples/step-43/step-43.cc @@ -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. diff --git a/deal.II/examples/step-46/doc/intro.dox b/deal.II/examples/step-46/doc/intro.dox index 3d722c8630..66e5086043 100644 --- a/deal.II/examples/step-46/doc/intro.dox +++ b/deal.II/examples/step-46/doc/intro.dox @@ -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 diff --git a/deal.II/examples/step-5/step-5.cc b/deal.II/examples/step-5/step-5.cc index 9d219ebca2..c5bd15aedf 100644 --- a/deal.II/examples/step-5/step-5.cc +++ b/deal.II/examples/step-5/step-5.cc @@ -200,7 +200,7 @@ double Coefficient::value (const Point &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::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; diff --git a/deal.II/include/deal.II/algorithms/newton.h b/deal.II/include/deal.II/algorithms/newton.h index f3cdcee24b..23a6600900 100644 --- a/deal.II/include/deal.II/algorithms/newton.h +++ b/deal.II/include/deal.II/algorithms/newton.h @@ -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 diff --git a/deal.II/include/deal.II/base/conditional_ostream.h b/deal.II/include/deal.II/base/conditional_ostream.h index d7da18e098..d21721d421 100644 --- a/deal.II/include/deal.II/base/conditional_ostream.h +++ b/deal.II/include/deal.II/base/conditional_ostream.h @@ -71,7 +71,7 @@ DEAL_II_NAMESPACE_OPEN * @code * system_matrix.print_formatted(pout); * @endcode - * is not possible. Instead use the is_active() funtion for a + * is not possible. Instead use the is_active() function for a * work-around: * * @code diff --git a/deal.II/include/deal.II/base/data_out_base.h b/deal.II/include/deal.II/base/data_out_base.h index 86dc55bed7..560e09e55e 100644 --- a/deal.II/include/deal.II/base/data_out_base.h +++ b/deal.II/include/deal.II/base/data_out_base.h @@ -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. diff --git a/deal.II/include/deal.II/base/exceptions.h b/deal.II/include/deal.II/base/exceptions.h index 86d8035aaf..87c3c8fc09 100644 --- a/deal.II/include/deal.II/base/exceptions.h +++ b/deal.II/include/deal.II/base/exceptions.h @@ -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 diff --git a/deal.II/include/deal.II/base/function.h b/deal.II/include/deal.II/base/function.h index 9cde3bccd1..40b3dbba5a 100644 --- a/deal.II/include/deal.II/base/function.h +++ b/deal.II/include/deal.II/base/function.h @@ -87,7 +87,7 @@ template 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 diff --git a/deal.II/include/deal.II/base/function_parser.h b/deal.II/include/deal.II/base/function_parser.h index b6b8b17c6f..1f5d9a705e 100644 --- a/deal.II/include/deal.II/base/function_parser.h +++ b/deal.II/include/deal.II/base/function_parser.h @@ -196,7 +196,7 @@ template 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. diff --git a/deal.II/include/deal.II/base/geometry_info.h b/deal.II/include/deal.II/base/geometry_info.h index 75f97619d2..05e7db996d 100644 --- a/deal.II/include/deal.II/base/geometry_info.h +++ b/deal.II/include/deal.II/base/geometry_info.h @@ -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; diff --git a/deal.II/include/deal.II/base/logstream.h b/deal.II/include/deal.II/base/logstream.h index 3ebbb2b834..f87f5a3aa3 100644 --- a/deal.II/include/deal.II/base/logstream.h +++ b/deal.II/include/deal.II/base/logstream.h @@ -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 diff --git a/deal.II/include/deal.II/base/memory_consumption.h b/deal.II/include/deal.II/base/memory_consumption.h index ee048569c2..9bd925f4c5 100644 --- a/deal.II/include/deal.II/base/memory_consumption.h +++ b/deal.II/include/deal.II/base/memory_consumption.h @@ -39,7 +39,7 @@ DEAL_II_NAMESPACE_OPEN *

  13. The argument is a standard C++ data type, namely, * bool, float, double or any of the * integer types. In that case, memory_consumption() simple returns - * sizeof of its argument. The libary also provides an + * sizeof of its argument. The library also provides an * estimate for the amount of memory occupied by a * std::string this way. * diff --git a/deal.II/include/deal.II/base/parameter_handler.h b/deal.II/include/deal.II/base/parameter_handler.h index a218768708..66754146a2 100644 --- a/deal.II/include/deal.II/base/parameter_handler.h +++ b/deal.II/include/deal.II/base/parameter_handler.h @@ -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 * double. 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 END or end * 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. true otherwise. * diff --git a/deal.II/include/deal.II/base/tensor_base.h b/deal.II/include/deal.II/base/tensor_base.h index 4a8b2e316b..491695df9b 100644 --- a/deal.II/include/deal.II/base/tensor_base.h +++ b/deal.II/include/deal.II/base/tensor_base.h @@ -16,7 +16,7 @@ // single this file out from tensor.h, since we want to derive // Point 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 diff --git a/deal.II/include/deal.II/base/thread_local_storage.h b/deal.II/include/deal.II/base/thread_local_storage.h index 7b82dda6b5..d655cbb038 100644 --- a/deal.II/include/deal.II/base/thread_local_storage.h +++ b/deal.II/include/deal.II/base/thread_local_storage.h @@ -46,7 +46,7 @@ namespace Threads *

    Construction and destruction

    * * 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. * diff --git a/deal.II/include/deal.II/base/thread_management.h b/deal.II/include/deal.II/base/thread_management.h index fb6a169c64..6b5f941cfc 100644 --- a/deal.II/include/deal.II/base/thread_management.h +++ b/deal.II/include/deal.II/base/thread_management.h @@ -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 diff --git a/deal.II/include/deal.II/distributed/tria.h b/deal.II/include/deal.II/distributed/tria.h index 4ed683a59e..333216b6d3 100644 --- a/deal.II/include/deal.II/distributed/tria.h +++ b/deal.II/include/deal.II/distributed/tria.h @@ -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 diff --git a/deal.II/include/deal.II/dofs/dof_faces.h b/deal.II/include/deal.II/dofs/dof_faces.h index c462bdf157..0b8bacc182 100644 --- a/deal.II/include/deal.II/dofs/dof_faces.h +++ b/deal.II/include/deal.II/dofs/dof_faces.h @@ -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 */ diff --git a/deal.II/include/deal.II/dofs/dof_handler.h b/deal.II/include/deal.II/dofs/dof_handler.h index 14bdcaabe9..54eb34d7ec 100644 --- a/deal.II/include/deal.II/dofs/dof_handler.h +++ b/deal.II/include/deal.II/dofs/dof_handler.h @@ -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. diff --git a/deal.II/include/deal.II/dofs/dof_levels.h b/deal.II/include/deal.II/dofs/dof_levels.h index cf84aac15e..cb9c40d733 100644 --- a/deal.II/include/deal.II/dofs/dof_levels.h +++ b/deal.II/include/deal.II/dofs/dof_levels.h @@ -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 DoFFaces classes. * * diff --git a/deal.II/include/deal.II/dofs/dof_renumbering.h b/deal.II/include/deal.II/dofs/dof_renumbering.h index 61613c45bf..f760b6d86c 100644 --- a/deal.II/include/deal.II/dofs/dof_renumbering.h +++ b/deal.II/include/deal.II/dofs/dof_renumbering.h @@ -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. diff --git a/deal.II/include/deal.II/fe/fe.h b/deal.II/include/deal.II/fe/fe.h index 66c0759613..289288f4b8 100644 --- a/deal.II/include/deal.II/fe/fe.h +++ b/deal.II/include/deal.II/fe/fe.h @@ -259,7 +259,7 @@ namespace hp * *
    Computing the correct basis from "raw" basis functions
    * - * 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 diff --git a/deal.II/include/deal.II/fe/fe_q_hierarchical.h b/deal.II/include/deal.II/fe/fe_q_hierarchical.h index a073892cae..f6b70f1bb6 100644 --- a/deal.II/include/deal.II/fe/fe_q_hierarchical.h +++ b/deal.II/include/deal.II/fe/fe_q_hierarchical.h @@ -417,7 +417,7 @@ class FE_Q_Hierarchical : public FE_Poly,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, diff --git a/deal.II/include/deal.II/fe/fe_tools.h b/deal.II/include/deal.II/fe/fe_tools.h index c8e643b90b..75caa20de6 100644 --- a/deal.II/include/deal.II/fe/fe_tools.h +++ b/deal.II/include/deal.II/fe/fe_tools.h @@ -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, diff --git a/deal.II/include/deal.II/fe/mapping.h b/deal.II/include/deal.II/fe/mapping.h index 2bf2f5aaeb..835ab82ea8 100644 --- a/deal.II/include/deal.II/fe/mapping.h +++ b/deal.II/include/deal.II/fe/mapping.h @@ -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. * diff --git a/deal.II/include/deal.II/grid/grid_out.h b/deal.II/include/deal.II/grid/grid_out.h index 2ac1ef4a1b..824d896e5f 100644 --- a/deal.II/include/deal.II/grid/grid_out.h +++ b/deal.II/include/deal.II/grid/grid_out.h @@ -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. */ diff --git a/deal.II/include/deal.II/grid/grid_reordering_internal.h b/deal.II/include/deal.II/grid/grid_reordering_internal.h index 07b18beb7e..aaf09e7068 100644 --- a/deal.II/include/deal.II/grid/grid_reordering_internal.h +++ b/deal.II/include/deal.II/grid/grid_reordering_internal.h @@ -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 diff --git a/deal.II/include/deal.II/grid/grid_tools.h b/deal.II/include/deal.II/grid/grid_tools.h index 2bd4b431ef..7c2a421796 100644 --- a/deal.II/include/deal.II/grid/grid_tools.h +++ b/deal.II/include/deal.II/grid/grid_tools.h @@ -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. */ diff --git a/deal.II/include/deal.II/grid/tria_faces.h b/deal.II/include/deal.II/grid/tria_faces.h index 473975e92b..e092ea0b9a 100644 --- a/deal.II/include/deal.II/grid/tria_faces.h +++ b/deal.II/include/deal.II/grid/tria_faces.h @@ -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. * diff --git a/deal.II/include/deal.II/grid/tria_iterator.h b/deal.II/include/deal.II/grid/tria_iterator.h index 64773b0ac0..e24919e9a0 100644 --- a/deal.II/include/deal.II/grid/tria_iterator.h +++ b/deal.II/include/deal.II/grid/tria_iterator.h @@ -125,7 +125,7 @@ template 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 class TriaActiveIterator; * * 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 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 diff --git a/deal.II/include/deal.II/grid/tria_levels.h b/deal.II/include/deal.II/grid/tria_levels.h index 69a2ee1627..37b0bac873 100644 --- a/deal.II/include/deal.II/grid/tria_levels.h +++ b/deal.II/include/deal.II/grid/tria_levels.h @@ -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 * TriaLevel::reserve_space * functions, with N>0. * diff --git a/deal.II/include/deal.II/grid/tria_objects.h b/deal.II/include/deal.II/grid/tria_objects.h index 91d439d0d3..77a9bbfd9f 100644 --- a/deal.II/include/deal.II/grid/tria_objects.h +++ b/deal.II/include/deal.II/grid/tria_objects.h @@ -198,7 +198,7 @@ namespace internal /** * Assert that enough space * is allocated to - * accomodate + * accommodate * new_objs_in_pairs * 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 > @@ -580,7 +580,7 @@ namespace internal /** * Assert that enough space is - * allocated to accomodate + * allocated to accommodate * new_objs new objects. * This function does not only call * vector::reserve(), 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 * new_quads_in_pairs * new quads, stored in * pairs, plus diff --git a/deal.II/include/deal.II/hp/dof_faces.h b/deal.II/include/deal.II/hp/dof_faces.h index 19f001b341..e37db5ae2e 100644 --- a/deal.II/include/deal.II/hp/dof_faces.h +++ b/deal.II/include/deal.II/hp/dof_faces.h @@ -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. diff --git a/deal.II/include/deal.II/hp/dof_handler.h b/deal.II/include/deal.II/hp/dof_handler.h index eb232ec2d9..13c0e813af 100644 --- a/deal.II/include/deal.II/hp/dof_handler.h +++ b/deal.II/include/deal.II/hp/dof_handler.h @@ -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. diff --git a/deal.II/include/deal.II/lac/block_vector_base.h b/deal.II/include/deal.II/lac/block_vector_base.h index 33fdaa2fb6..89d5688bff 100644 --- a/deal.II/include/deal.II/lac/block_vector_base.h +++ b/deal.II/include/deal.II/lac/block_vector_base.h @@ -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. */ diff --git a/deal.II/include/deal.II/lac/constraint_matrix.h b/deal.II/include/deal.II/lac/constraint_matrix.h index c713c8186e..3f9d9d767e 100644 --- a/deal.II/include/deal.II/lac/constraint_matrix.h +++ b/deal.II/include/deal.II/lac/constraint_matrix.h @@ -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 * condensed. Therefore, the * dimension of condensed is * the dimension of diff --git a/deal.II/include/deal.II/lac/exceptions.h b/deal.II/include/deal.II/lac/exceptions.h index ea96c7447b..9988947c46 100644 --- a/deal.II/include/deal.II/lac/exceptions.h +++ b/deal.II/include/deal.II/lac/exceptions.h @@ -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"); //@} } diff --git a/deal.II/include/deal.II/lac/full_matrix.h b/deal.II/include/deal.II/lac/full_matrix.h index 2cef208b0e..51708e58f6 100644 --- a/deal.II/include/deal.II/lac/full_matrix.h +++ b/deal.II/include/deal.II/lac/full_matrix.h @@ -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. */ diff --git a/deal.II/include/deal.II/lac/matrix_block.h b/deal.II/include/deal.II/lac/matrix_block.h index 9dbc06d989..4030afad70 100644 --- a/deal.II/include/deal.II/lac/matrix_block.h +++ b/deal.II/include/deal.II/lac/matrix_block.h @@ -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 diff --git a/deal.II/include/deal.II/lac/parallel_vector.h b/deal.II/include/deal.II/lac/parallel_vector.h index 4e8650b300..2ae2dc5dfc 100644 --- a/deal.II/include/deal.II/lac/parallel_vector.h +++ b/deal.II/include/deal.II/lac/parallel_vector.h @@ -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. */ diff --git a/deal.II/include/deal.II/lac/petsc_matrix_base.h b/deal.II/include/deal.II/lac/petsc_matrix_base.h index 555e354ec8..e35ecd55bf 100644 --- a/deal.II/include/deal.II/lac/petsc_matrix_base.h +++ b/deal.II/include/deal.II/lac/petsc_matrix_base.h @@ -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 */ diff --git a/deal.II/include/deal.II/lac/petsc_solver.h b/deal.II/include/deal.II/lac/petsc_solver.h index 20ade043a7..3c00e1ed95 100644 --- a/deal.II/include/deal.II/lac/petsc_solver.h +++ b/deal.II/include/deal.II/lac/petsc_solver.h @@ -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: diff --git a/deal.II/include/deal.II/lac/petsc_vector_base.h b/deal.II/include/deal.II/lac/petsc_vector_base.h index 942d05730c..e62b926d17 100644 --- a/deal.II/include/deal.II/lac/petsc_vector_base.h +++ b/deal.II/include/deal.II/lac/petsc_vector_base.h @@ -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; diff --git a/deal.II/include/deal.II/lac/relaxation_block.h b/deal.II/include/deal.II/lac/relaxation_block.h index 7c1cb3fa27..ca235fe5b6 100644 --- a/deal.II/include/deal.II/lac/relaxation_block.h +++ b/deal.II/include/deal.II/lac/relaxation_block.h @@ -141,7 +141,7 @@ class RelaxationBlock : *
  14. If the length of the * vector is zero, then the * relaxation method will be - * exectued from first to + * executed from first to * last block. *
  15. If the length is one, * then the inner vector must diff --git a/deal.II/include/deal.II/lac/slepc_solver.h b/deal.II/include/deal.II/lac/slepc_solver.h index ef4d570d7d..db08ed0bfa 100644 --- a/deal.II/include/deal.II/lac/slepc_solver.h +++ b/deal.II/include/deal.II/lac/slepc_solver.h @@ -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, diff --git a/deal.II/include/deal.II/lac/solver.h b/deal.II/include/deal.II/lac/solver.h index 2649e64074..84058ab0e7 100644 --- a/deal.II/include/deal.II/lac/solver.h +++ b/deal.II/include/deal.II/lac/solver.h @@ -200,7 +200,7 @@ class Solver : public Subscriptor SolverControl &cntrl; /** - * Memory for auxilliary vectors. + * Memory for auxiliary vectors. */ VectorMemory &memory; }; diff --git a/deal.II/include/deal.II/lac/sparse_decomposition.h b/deal.II/include/deal.II/lac/sparse_decomposition.h index 308b5fde51..8c2aaa3bbe 100644 --- a/deal.II/include/deal.II/lac/sparse_decomposition.h +++ b/deal.II/include/deal.II/lac/sparse_decomposition.h @@ -406,7 +406,7 @@ class SparseLUDecomposition : protected SparseMatrix, bool decomposed; /** - * The default strenghtening + * The default strengthening * value, returned by * get_strengthen_diagonal(). */ diff --git a/deal.II/include/deal.II/lac/sparse_direct.h b/deal.II/include/deal.II/lac/sparse_direct.h index d726cbe698..e63a1190df 100644 --- a/deal.II/include/deal.II/lac/sparse_direct.h +++ b/deal.II/include/deal.II/lac/sparse_direct.h @@ -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 detached_ma27, that is started in its place - * through the execv system call. Now everytime you call one of + * through the execv 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. diff --git a/deal.II/include/deal.II/lac/sparse_matrix_ez.h b/deal.II/include/deal.II/lac/sparse_matrix_ez.h index a09d38caf6..ca0742ff54 100644 --- a/deal.II/include/deal.II/lac/sparse_matrix_ez.h +++ b/deal.II/include/deal.II/lac/sparse_matrix_ez.h @@ -66,7 +66,7 @@ template 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 diff --git a/deal.II/include/deal.II/lac/sparsity_pattern.h b/deal.II/include/deal.II/lac/sparsity_pattern.h index 4368433b34..01c2df6978 100644 --- a/deal.II/include/deal.II/lac/sparsity_pattern.h +++ b/deal.II/include/deal.II/lac/sparsity_pattern.h @@ -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 original as well * as the new off-diagonal * elements created by this diff --git a/deal.II/include/deal.II/lac/tridiagonal_matrix.h b/deal.II/include/deal.II/lac/tridiagonal_matrix.h index a0228bcae7..b512c5517c 100644 --- a/deal.II/include/deal.II/lac/tridiagonal_matrix.h +++ b/deal.II/include/deal.II/lac/tridiagonal_matrix.h @@ -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. */ diff --git a/deal.II/include/deal.II/lac/trilinos_solver.h b/deal.II/include/deal.II/lac/trilinos_solver.h index dfc37586a5..a76f34d1e4 100644 --- a/deal.II/include/deal.II/lac/trilinos_solver.h +++ b/deal.II/include/deal.II/lac/trilinos_solver.h @@ -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: diff --git a/deal.II/include/deal.II/lac/trilinos_sparse_matrix.h b/deal.II/include/deal.II/lac/trilinos_sparse_matrix.h index 120d9379eb..ff64607164 100644 --- a/deal.II/include/deal.II/lac/trilinos_sparse_matrix.h +++ b/deal.II/include/deal.II/lac/trilinos_sparse_matrix.h @@ -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 diff --git a/deal.II/include/deal.II/lac/trilinos_sparsity_pattern.h b/deal.II/include/deal.II/lac/trilinos_sparsity_pattern.h index 1590a8fb8d..a054538d5d 100644 --- a/deal.II/include/deal.II/lac/trilinos_sparsity_pattern.h +++ b/deal.II/include/deal.II/lac/trilinos_sparsity_pattern.h @@ -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 diff --git a/deal.II/include/deal.II/lac/trilinos_vector_base.h b/deal.II/include/deal.II/lac/trilinos_vector_base.h index c54df41ca0..dc77b335fe 100644 --- a/deal.II/include/deal.II/lac/trilinos_vector_base.h +++ b/deal.II/include/deal.II/lac/trilinos_vector_base.h @@ -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 diff --git a/deal.II/include/deal.II/lac/vector.h b/deal.II/include/deal.II/lac/vector.h index d0ad5e1fac..498a746687 100644 --- a/deal.II/include/deal.II/lac/vector.h +++ b/deal.II/include/deal.II/lac/vector.h @@ -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. */ diff --git a/deal.II/include/deal.II/lac/vector_view.h b/deal.II/include/deal.II/lac/vector_view.h index c61e53a707..440e6342b4 100644 --- a/deal.II/include/deal.II/lac/vector_view.h +++ b/deal.II/include/deal.II/lac/vector_view.h @@ -182,7 +182,7 @@ class VectorView : public Vector * 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. * diff --git a/deal.II/include/deal.II/meshworker/functional.h b/deal.II/include/deal.II/meshworker/functional.h index b0c3ff591d..8678e28f95 100644 --- a/deal.II/include/deal.II/meshworker/functional.h +++ b/deal.II/include/deal.II/meshworker/functional.h @@ -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 diff --git a/deal.II/include/deal.II/meshworker/integration_info.h b/deal.II/include/deal.II/meshworker/integration_info.h index 5935e8ee66..c7931c3979 100644 --- a/deal.II/include/deal.II/meshworker/integration_info.h +++ b/deal.II/include/deal.II/meshworker/integration_info.h @@ -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, diff --git a/deal.II/include/deal.II/meshworker/vector_selector.h b/deal.II/include/deal.II/meshworker/vector_selector.h index 6cae5f4b9b..808f84e716 100644 --- a/deal.II/include/deal.II/meshworker/vector_selector.h +++ b/deal.II/include/deal.II/meshworker/vector_selector.h @@ -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 diff --git a/deal.II/include/deal.II/multigrid/mg_tools.h b/deal.II/include/deal.II/multigrid/mg_tools.h index 534e9aa90d..b1695498e0 100644 --- a/deal.II/include/deal.II/multigrid/mg_tools.h +++ b/deal.II/include/deal.II/multigrid/mg_tools.h @@ -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 diff --git a/deal.II/include/deal.II/numerics/data_out.h b/deal.II/include/deal.II/numerics/data_out.h index ae01804607..7cb565b7fb 100644 --- a/deal.II/include/deal.II/numerics/data_out.h +++ b/deal.II/include/deal.II/numerics/data_out.h @@ -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 *data_postprocessor); diff --git a/deal.II/include/deal.II/numerics/fe_field_function.templates.h b/deal.II/include/deal.II/numerics/fe_field_function.templates.h index 4c6859e16a..c343871594 100644 --- a/deal.II/include/deal.II/numerics/fe_field_function.templates.h +++ b/deal.II/include/deal.II/numerics/fe_field_function.templates.h @@ -390,7 +390,7 @@ namespace Functions // found std::vector point_flags(np, false); - // Set this to true untill all + // Set this to true until all // points have been classified bool left_over = true; diff --git a/deal.II/include/deal.II/numerics/solution_transfer.h b/deal.II/include/deal.II/numerics/solution_transfer.h index 0f73f989bb..8c5e354db4 100644 --- a/deal.II/include/deal.II/numerics/solution_transfer.h +++ b/deal.II/include/deal.II/numerics/solution_transfer.h @@ -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. diff --git a/deal.II/include/deal.II/numerics/time_dependent.h b/deal.II/include/deal.II/numerics/time_dependent.h index f5c1929aa6..531621bcb8 100644 --- a/deal.II/include/deal.II/numerics/time_dependent.h +++ b/deal.II/include/deal.II/numerics/time_dependent.h @@ -596,7 +596,7 @@ class TimeDependent * equally well use * bind2nd(mem_fun1(&X::unary_function), arg) * 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. */ diff --git a/deal.II/include/deal.II/numerics/vectors.h b/deal.II/include/deal.II/numerics/vectors.h index 823d6a45e3..0852961cf7 100644 --- a/deal.II/include/deal.II/numerics/vectors.h +++ b/deal.II/include/deal.II/numerics/vectors.h @@ -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 diff --git a/deal.II/source/base/convergence_table.cc b/deal.II/source/base/convergence_table.cc index be1e3f6715..7f0e2183c1 100644 --- a/deal.II/source/base/convergence_table.cc +++ b/deal.II/source/base/convergence_table.cc @@ -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 > &patches if (!flags.bicubic_patch) { - // aproximate normal + // approximate normal // vectors in patch std::vector > nrml; // only if smooth triangles are used diff --git a/deal.II/source/base/multithread_info.cc b/deal.II/source/base/multithread_info.cc index aab89d8c79..e60f66f28d 100644 --- a/deal.II/source/base/multithread_info.cc +++ b/deal.II/source/base/multithread_info.cc @@ -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]; diff --git a/deal.II/source/base/quadrature.cc b/deal.II/source/base/quadrature.cc index cb51865e7c..29f23cb939 100644 --- a/deal.II/source/base/quadrature.cc +++ b/deal.II/source/base/quadrature.cc @@ -149,7 +149,7 @@ Quadrature::Quadrature (const SubQuadrature &q1, double sum = 0; for (unsigned int i=0; i0.999999) && (sum<1.000001), ExcInternalError()); @@ -186,7 +186,7 @@ Quadrature<1>::Quadrature (const SubQuadrature&, double sum = 0; for (unsigned int i=0; i0.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 - // 4 + 2 + 2 = 8 differnt subfaces + // 4 + 2 + 2 = 8 different subfaces // for each face. const unsigned int total_subfaces_per_face=8; diff --git a/deal.II/source/dofs/dof_handler.cc b/deal.II/source/dofs/dof_handler.cc index 1be336cebb..fb4a98ac97 100644 --- a/deal.II/source/dofs/dof_handler.cc +++ b/deal.II/source/dofs/dof_handler.cc @@ -1780,7 +1780,7 @@ DoFHandler::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 diff --git a/deal.II/source/dofs/dof_handler_policy.cc b/deal.II/source/dofs/dof_handler_policy.cc index 435690e3d5..241199d891 100644 --- a/deal.II/source/dofs/dof_handler_policy.cc +++ b/deal.II/source/dofs/dof_handler_policy.cc @@ -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()); diff --git a/deal.II/source/fe/fe.cc b/deal.II/source/fe/fe.cc index 8a5811c4f0..15fe75d4ca 100644 --- a/deal.II/source/fe/fe.cc +++ b/deal.II/source/fe/fe.cc @@ -97,7 +97,7 @@ FiniteElement::InternalDataBase::~InternalDataBase () { // delete pointer and set it // to zero to avoid - // inadvertant use + // inadvertent use delete differences[i]; differences[i] = 0; }; diff --git a/deal.II/source/fe/fe_system.cc b/deal.II/source/fe/fe_system.cc index 38bccab0d1..a4eac7d0e5 100644 --- a/deal.II/source/fe/fe_system.cc +++ b/deal.II/source/fe/fe_system.cc @@ -42,7 +42,7 @@ template FESystem::InternalData::~InternalData() { // delete pointers and set them to - // zero to avoid inadvertant use + // zero to avoid inadvertent use for (unsigned int i=0; i::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 diff --git a/deal.II/source/fe/fe_tools.cc b/deal.II/source/fe/fe_tools.cc index beee6d889c..facc4b8efd 100644 --- a/deal.II/source/fe/fe_tools.cc +++ b/deal.II/source/fe/fe_tools.cc @@ -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(); diff --git a/deal.II/source/fe/mapping_q.cc b/deal.II/source/fe/mapping_q.cc index 73817630e1..5657c97f90 100644 --- a/deal.II/source/fe/mapping_q.cc +++ b/deal.II/source/fe/mapping_q.cc @@ -1263,7 +1263,7 @@ MappingQ::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::InternalData *q1_data = @@ -1302,7 +1302,7 @@ MappingQ::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::InternalData *q1_data = @@ -1339,7 +1339,7 @@ void MappingQ::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::InternalData *q1_data = diff --git a/deal.II/source/grid/grid_generator.cc b/deal.II/source/grid/grid_generator.cc index 26c57ceb8e..5db865c14e 100644 --- a/deal.II/source/grid/grid_generator.cc +++ b/deal.II/source/grid/grid_generator.cc @@ -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. diff --git a/deal.II/source/grid/grid_reordering.cc b/deal.II/source/grid/grid_reordering.cc index bbda1d4f87..429490e4f6 100644 --- a/deal.II/source/grid/grid_reordering.cc +++ b/deal.II/source/grid/grid_reordering.cc @@ -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]; diff --git a/deal.II/source/grid/intergrid_map.cc b/deal.II/source/grid/intergrid_map.cc index 97aabd511f..1aa14654ed 100644 --- a/deal.II/source/grid/intergrid_map.cc +++ b/deal.II/source/grid/intergrid_map.cc @@ -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 unsigned int get_n_levels (const GridClass &grid) diff --git a/deal.II/source/grid/tria.cc b/deal.II/source/grid/tria.cc index 693bab96cf..24215318ae 100644 --- a/deal.II/source/grid/tria.cc +++ b/deal.II/source/grid/tria.cc @@ -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::max_adjacent_cells () const // larger dimensions std::vector 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::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::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::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 && diff --git a/deal.II/source/grid/tria_accessor.cc b/deal.II/source/grid/tria_accessor.cc index 6d5ae33f82..db2550087f 100644 --- a/deal.II/source/grid/tria_accessor.cc +++ b/deal.II/source/grid/tria_accessor.cc @@ -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. diff --git a/deal.II/source/hp/dof_handler.cc b/deal.II/source/hp/dof_handler.cc index a4f8d14cc3..09b2fbef5d 100644 --- a/deal.II/source/hp/dof_handler.cc +++ b/deal.II/source/hp/dof_handler.cc @@ -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 diff --git a/deal.II/source/lac/solver_control.cc b/deal.II/source/lac/solver_control.cc index c9fe894f51..72431cf790 100644 --- a/deal.II/source/lac/solver_control.cc +++ b/deal.II/source/lac/solver_control.cc @@ -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; diff --git a/deal.II/source/multigrid/mg_transfer_block.cc b/deal.II/source/multigrid/mg_transfer_block.cc index 8d35e68253..e92e0246e0 100644 --- a/deal.II/source/multigrid/mg_transfer_block.cc +++ b/deal.II/source/multigrid/mg_transfer_block.cc @@ -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. diff --git a/deal.II/source/multigrid/mg_transfer_prebuilt.cc b/deal.II/source/multigrid/mg_transfer_prebuilt.cc index 596fe651ab..8f180f7ede 100644 --- a/deal.II/source/multigrid/mg_transfer_prebuilt.cc +++ b/deal.II/source/multigrid/mg_transfer_prebuilt.cc @@ -177,7 +177,7 @@ void MGTransferPrebuilt::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. diff --git a/deal.II/source/numerics/data_out.cc b/deal.II/source/numerics/data_out.cc index b5c20acde8..b3477e39e7 100644 --- a/deal.II/source/numerics/data_out.cc +++ b/deal.II/source/numerics/data_out.cc @@ -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 *data_postprocessor);