| /external/eigen/doc/snippets/ |
| H A D | LLT_example.cpp | 6 MatrixXd L = lltOfA.matrixL(); // retrieve factor L in the decomposition
7 // The previous two lines can also be written as "L = A.llt().matrixL()"
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| H A D | GeneralizedSelfAdjointEigenSolver.h | 186 cholB.matrixL().template solveInPlace<OnTheLeft>(matC);
199 matC = matC * cholB.matrixL();
212 matC = matC * cholB.matrixL();
219 Base::m_eivec = cholB.matrixL() * Base::m_eivec;
|
| /external/eigen/test/ |
| H A D | cholesky.cpp | 113 VERIFY_IS_APPROX(MatrixType(chollo.matrixL().transpose().conjugate()), MatrixType(chollo.matrixU()));
114 VERIFY_IS_APPROX(MatrixType(chollo.matrixU().transpose().conjugate()), MatrixType(chollo.matrixL()));
115 VERIFY_IS_APPROX(MatrixType(cholup.matrixL().transpose().conjugate()), MatrixType(cholup.matrixU()));
116 VERIFY_IS_APPROX(MatrixType(cholup.matrixU().transpose().conjugate()), MatrixType(cholup.matrixL()));
160 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixL().transpose().conjugate()), MatrixType(ldltlo.matrixU()));
161 VERIFY_IS_APPROX(MatrixType(ldltlo.matrixU().transpose().conjugate()), MatrixType(ldltlo.matrixL()));
162 VERIFY_IS_APPROX(MatrixType(ldltup.matrixL().transpose().conjugate()), MatrixType(ldltup.matrixU()));
163 VERIFY_IS_APPROX(MatrixType(ldltup.matrixU().transpose().conjugate()), MatrixType(ldltup.matrixL()));
360 VERIFY_RAISES_ASSERT(llt.matrixL())
366 VERIFY_RAISES_ASSERT(ldlt.matrixL())
[all...] |
| /external/eigen/bench/ |
| H A D | benchCholesky.cpp | 60 acc += cholnosqrt.matrixL().coeff(r,c);
71 acc += chol.matrixL().coeff(r,c);
|
| H A D | sparse_cholesky.cpp | 73 std::cout << " nnz: " << sm1.nonZeros() << " => " << chol.matrixL().nonZeros() << "\n";
74 // std::cout << "sparse\n" << chol.matrixL() << "%\n";
119 if (!internal::isMuchSmallerThan(internal::abs(chol.matrixL()(i,j)), 0.1))
122 // std::cout << "dense:\n" << m1 << "\n\n" << chol.matrixL() << endl;
|
| /external/eigen/test/eigen2/ |
| H A D | eigen2_cholesky.cpp | 72 //VERIFY_IS_APPROX(symm, ldlt.matrixL() * ldlt.vectorD().asDiagonal() * ldlt.matrixL().adjoint());
82 VERIFY_IS_APPROX(symm, chol.matrixL() * chol.matrixL().adjoint());
|
| /external/eigen/Eigen/src/Cholesky/ |
| H A D | LLT.h | 104 inline typename Traits::MatrixL matrixL() const function in class:Eigen::LLT
454 matrixL().solveInPlace(bAndX);
465 return matrixL() * matrixL().adjoint().toDenseMatrix();
|
| H A D | LDLT.h | 127 inline typename Traits::MatrixL matrixL() const function in class:Eigen::LDLT
498 dec().matrixL().solveInPlace(dst);
575 res = matrixL() * res;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| H A D | SimplicialCholesky.h | 167 derived().matrixL().solveInPlace(dest);
328 inline const MatrixL matrixL() const { function in class:Eigen::SimplicialLLT
423 inline const MatrixL matrixL() const { function in class:Eigen::SimplicialLDLT
|
| /external/ceres-solver/internal/ceres/ |
| H A D | incomplete_lq_factorization_test.cc | 108 Matrix expected_l_matrix = (mref * mref.transpose()).llt().matrixL();
|
| /external/eigen/bench/btl/libs/eigen2/ |
| H A D | eigen2_interface.hh | 145 C = X.llt().matrixL();
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| H A D | UmfPackSupport.h | 167 inline const LUMatrixType& matrixL() const function in class:Eigen::UmfPackLU
|
| /external/eigen/Eigen/src/SparseLU/ |
| H A D | SparseLU.h | 131 * y = b; matrixL().solveInPlace(y);
134 SparseLUMatrixLReturnType<SCMatrix> matrixL() const function in class:Eigen::SparseLU
238 this->matrixL().solveInPlace(X);
|
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| H A D | ArpackSelfAdjointEigenSolver.h | 772 Matrix<Scalar, Dynamic, 1>::Map(out, n) = OP.matrixL().solve(Matrix<Scalar, Dynamic, 1>::Map(out, n));
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| H A D | SuperLUSupport.h | 534 inline const LMatrixType& matrixL() const function in class:Eigen::SuperLU
|