aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/LU/LU.h
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2008-10-20 17:03:09 +0000
committerGravatar Gael Guennebaud <g.gael@free.fr>2008-10-20 17:03:09 +0000
commit5066fe8bbe7b7f3a3a5ed89d5d72603218d00cac (patch)
tree9e6a5fd4a6f9549905405123ec0c96275b411571 /Eigen/src/LU/LU.h
parente1c50a3cb17a0375761aab55065aab85596d8407 (diff)
* sparse LU: add extraction of L,U,P, and Q, as well as determinant
for both backends. * extended a bit the sparse unit tests
Diffstat (limited to 'Eigen/src/LU/LU.h')
-rw-r--r--Eigen/src/LU/LU.h5
1 files changed, 1 insertions, 4 deletions
diff --git a/Eigen/src/LU/LU.h b/Eigen/src/LU/LU.h
index 554d8bd3c..fda369499 100644
--- a/Eigen/src/LU/LU.h
+++ b/Eigen/src/LU/LU.h
@@ -190,10 +190,7 @@ template<typename MatrixType> class LU
* \sa MatrixBase::solveTriangular(), kernel(), computeKernel(), inverse(), computeInverse()
*/
template<typename OtherDerived, typename ResultType>
- bool solve(
- const MatrixBase<OtherDerived>& b,
- ResultType *result
- ) const;
+ bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const;
/** \returns the determinant of the matrix of which
* *this is the LU decomposition. It has only linear complexity