diff options
author | Gael Guennebaud <g.gael@free.fr> | 2013-08-12 13:37:47 +0200 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2013-08-12 13:37:47 +0200 |
commit | 956251b738a4d955fb4322c2bc5dc5170d9b8367 (patch) | |
tree | 73aa3d0627603a64d6f71b52c4cb4912e54e7d20 /doc/TutorialSparse.dox | |
parent | 6f5f488a80307adc6299839c4d35fb1a82b5fe37 (diff) |
bug #638: fix typos in sparse tutorial
Diffstat (limited to 'doc/TutorialSparse.dox')
-rw-r--r-- | doc/TutorialSparse.dox | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/TutorialSparse.dox b/doc/TutorialSparse.dox index dbfb4a9eb..835c59354 100644 --- a/doc/TutorialSparse.dox +++ b/doc/TutorialSparse.dox @@ -83,7 +83,7 @@ There is no notion of compressed/uncompressed mode for a SparseVector. \section TutorialSparseExample First example -Before describing each individual class, let's start with the following typical example: solving the Lapace equation \f$ \nabla u = 0 \f$ on a regular 2D grid using a finite difference scheme and Dirichlet boundary conditions. +Before describing each individual class, let's start with the following typical example: solving the Laplace equation \f$ \nabla u = 0 \f$ on a regular 2D grid using a finite difference scheme and Dirichlet boundary conditions. Such problem can be mathematically expressed as a linear problem of the form \f$ Ax=b \f$ where \f$ x \f$ is the vector of \c m unknowns (in our case, the values of the pixels), \f$ b \f$ is the right hand side vector resulting from the boundary conditions, and \f$ A \f$ is an \f$ m \times m \f$ matrix containing only a few non-zero elements resulting from the discretization of the Laplacian operator. <table class="manual"> |