diff options
author | Benoit Jacob <jacob.benoit.1@gmail.com> | 2009-05-19 21:54:29 +0200 |
---|---|---|
committer | Benoit Jacob <jacob.benoit.1@gmail.com> | 2009-05-19 21:54:29 +0200 |
commit | a697cb409440c3d01eda44f84abe2f1d924270ce (patch) | |
tree | 41fadb7d1e3a5f6827b16f84a0b547bce82dc107 | |
parent | 066acca179aa1aeb49581cb787895a2d51fd05e6 (diff) |
fix comments (old comments that were copied from LU)
-rw-r--r-- | Eigen/src/LU/PartialLU.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Eigen/src/LU/PartialLU.h b/Eigen/src/LU/PartialLU.h index 7fdbeac38..3a6e9f286 100644 --- a/Eigen/src/LU/PartialLU.h +++ b/Eigen/src/LU/PartialLU.h @@ -225,8 +225,8 @@ void PartialLU<MatrixType>::solve( /* The decomposition PA = LU can be rewritten as A = P^{-1} L U. * So we proceed as follows: * Step 1: compute c = Pb. - * Step 2: replace c by the solution x to Lx = c. Exists because L is invertible. - * Step 3: replace c by the solution x to Ux = c. Check if a solution really exists. + * Step 2: replace c by the solution x to Lx = c. + * Step 3: replace c by the solution x to Ux = c. */ const int size = m_lu.rows(); |