aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc/TopicLinearAlgebraDecompositions.dox
diff options
context:
space:
mode:
authorGravatar luz.paz <luzpaz@users.noreply.github.com>2018-03-11 10:01:44 -0400
committerGravatar luz.paz <luzpaz@users.noreply.github.com>2018-03-11 10:01:44 -0400
commite3912f5e63b0c08a0f592ad425e926a5d61e1b8a (patch)
treec82a9386d11ff2b4f335c6de040afc1c32990d2b /doc/TopicLinearAlgebraDecompositions.dox
parent624df5094597ef4427ba8877dcf00804493160fe (diff)
MIsc. source and comment typos
Found using `codespell` and `grep` from downstream FreeCAD
Diffstat (limited to 'doc/TopicLinearAlgebraDecompositions.dox')
-rw-r--r--doc/TopicLinearAlgebraDecompositions.dox2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/TopicLinearAlgebraDecompositions.dox b/doc/TopicLinearAlgebraDecompositions.dox
index 491470627..991f964cc 100644
--- a/doc/TopicLinearAlgebraDecompositions.dox
+++ b/doc/TopicLinearAlgebraDecompositions.dox
@@ -248,7 +248,7 @@ To get an overview of the true relative speed of the different decomposition, ch
<dt><b>Blocking</b></dt>
<dd>Means the algorithm can work per block, whence guaranteeing a good scaling of the performance for large matrices.</dd>
<dt><b>Implicit Multi Threading (MT)</b></dt>
- <dd>Means the algorithm can take advantage of multicore processors via OpenMP. "Implicit" means the algortihm itself is not parallelized, but that it relies on parallelized matrix-matrix product rountines.</dd>
+ <dd>Means the algorithm can take advantage of multicore processors via OpenMP. "Implicit" means the algortihm itself is not parallelized, but that it relies on parallelized matrix-matrix product routines.</dd>
<dt><b>Explicit Multi Threading (MT)</b></dt>
<dd>Means the algorithm is explicitly parallelized to take advantage of multicore processors via OpenMP.</dd>
<dt><b>Meta-unroller</b></dt>