From 3e0bbfeb712a74a6e178d082eb53d7de10243c21 Mon Sep 17 00:00:00 2001 From: Timo Heister Date: Thu, 11 Jul 2013 15:09:08 +0000 Subject: [PATCH] documentation fixes by Oleh Krehel git-svn-id: https://svn.dealii.org/trunk@29968 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-5/step-5.cc | 2 +- deal.II/examples/step-7/step-7.cc | 2 +- deal.II/examples/step-9/step-9.cc | 18 +++++++++--------- 3 files changed, 11 insertions(+), 11 deletions(-) diff --git a/deal.II/examples/step-5/step-5.cc b/deal.II/examples/step-5/step-5.cc index 18dfd8036e..6e4a5c34ee 100644 --- a/deal.II/examples/step-5/step-5.cc +++ b/deal.II/examples/step-5/step-5.cc @@ -533,7 +533,7 @@ void Step5::output_results (const unsigned int cycle) const // The second to last thing in this program is the definition of the // run() function. In contrast to the previous programs, we will -// compute on a sequence of meshes that after each iteration is globall +// compute on a sequence of meshes that after each iteration is globally // refined. The function therefore consists of a loop over 6 cycles. In each // cycle, we first print the cycle number, and then have to decide what to do // with the mesh. If this is not the first cycle, we simply refine the diff --git a/deal.II/examples/step-7/step-7.cc b/deal.II/examples/step-7/step-7.cc index 85393fd733..3e3eaed078 100644 --- a/deal.II/examples/step-7/step-7.cc +++ b/deal.II/examples/step-7/step-7.cc @@ -233,7 +233,7 @@ namespace Step7 // share the same connotation that points have and are only objects in a // more abstract space than the one spanned by the coordinate // directions. (In fact, gradients live in `reciprocal' space, since the - // dimension of their components is not that of a length, but one over + // dimension of their components is not that of a length, but of one over // length). template Tensor<1,dim> Solution::gradient (const Point &p, diff --git a/deal.II/examples/step-9/step-9.cc b/deal.II/examples/step-9/step-9.cc index b5589551e5..503e65e786 100644 --- a/deal.II/examples/step-9/step-9.cc +++ b/deal.II/examples/step-9/step-9.cc @@ -142,7 +142,7 @@ namespace Step9 // @sect3{Equation data declaration} // Next we declare a class that describes the advection field. This, of - // course, is a vector field with as many compents as there are space + // course, is a vector field with as many components as there are space // dimensions. One could now use a class derived from the // Function base class, as we have done for boundary values and // coefficients in previous examples, but there is another possibility in @@ -391,7 +391,7 @@ namespace Step9 // rather than the common vectors of doubles, as the additional accuracy is // not necessary for estimated values. // - // In addition to these two functions, the class declares to exceptions + // In addition to these two functions, the class declares two exceptions // which are raised when a cell has no neighbors in each of the space // directions (in which case the matrix described in the introduction would // be singular and can't be inverted), while the other one is used in the @@ -510,11 +510,11 @@ namespace Step9 // configured for multi-threading, then the number of CPUs is set to one.) // However, sometimes there might be reasons to use another value. For // example, you might want to use less processors than there are in your - // system in order not to use too many computational ressources. On the + // system in order not to use too many computational resources. On the // other hand, if there are several jobs running on a computer and you // want to get a higher percentage of CPU time, it might be worth to start // more threads than there are CPUs, as most operating systems assign - // roughly the same CPU ressources to all threads presently running. For + // roughly the same CPU resources to all threads presently running. For // this reason, the MultithreadInfo class contains a // read-write variable n_default_threads which is set to // n_cpus by default, but can be set to another value. This @@ -576,7 +576,7 @@ namespace Step9 // differ (begin_active returns an // active_iterator, while end returns a // raw_iterator), and in this case the C++ language requires - // us to specify the template type explicitely. For brevity, we first + // us to specify the template type explicitly. For brevity, we first // typedef this data type to an alias. typedef typename DoFHandler::active_cell_iterator active_cell_iterator; std::vector > @@ -611,8 +611,8 @@ namespace Step9 // When all the threads are running, the only thing we have to do is wait // for them to finish. This is necessary of course, as we can't proceed // with our tasks before the matrix and right hand side are - // assemblesd. Waiting for all the threads to finish can be done using the - // joint_all function in the ThreadGroup + // assembled. Waiting for all the threads to finish can be done using the + // join_all function in the ThreadGroup // container, which just calls join on each of the thread // objects it stores. // @@ -621,7 +621,7 @@ namespace Step9 threads.join_all (); - // After the matrix has been assembled in parallel, we stil have to + // After the matrix has been assembled in parallel, we still have to // eliminate hanging node constraints. This is something that can't be // done on each of the threads separately, so we have to do it now. hanging_node_constraints.condense (system_matrix); @@ -816,7 +816,7 @@ namespace Step9 // // On the other hand, we would now like to write the local // contributions to the global system of equations into the global - // objects. This needs some kind of synchronisation, as if we would + // objects. This needs some kind of synchronization, as if we would // not take care of the fact that multiple threads write into the // matrix at the same time, we might be surprised that one threads // reads data from the matrix that another thread is presently -- 2.39.5