diff options
| author |  Christoph Hertzberg <chtz@informatik.uni-bremen.de> | 2019-05-13 19:02:30 +0200 |
|---|---|---|
| committer | Christoph Hertzberg <chtz@informatik.uni-bremen.de> | 2019-05-13 19:02:30 +0200 |
| commit | 5f32b79edc47c5d010755889a091d0b3a39a0f14 (patch) | |
| tree | 2f05adfed2c6541c3b808f19f72c88c2ac8c00bd /Eigen/src/SparseLU | |
| parent | ad372084f5eac947d93111ed118137076789973f (diff) | |
Collapsed revision from PR-641
* SparseLU.h - corrected example, it didn't compile
* Changed encoding back to UTF8
Diffstat (limited to 'Eigen/src/SparseLU')
| -rw-r--r-- | Eigen/src/SparseLU/SparseLU.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h index b23125e49..090993adc 100644 --- a/Eigen/src/SparseLU/SparseLU.h +++ b/Eigen/src/SparseLU/SparseLU.h @@ -43,8 +43,8 @@ template <typename MatrixLType, typename MatrixUType> struct SparseLUMatrixURetu * Simple example with key steps * \code * VectorXd x(n), b(n); - * SparseMatrix<double, ColMajor> A; - * SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<Index> > solver; + * SparseMatrix<double> A; + * SparseLU<SparseMatrix<double>, COLAMDOrdering<int> > solver; * // fill A and b; * // Compute the ordering permutation vector from the structural pattern of A * solver.analyzePattern(A); |