| /external/eigen/doc/examples/ |
| TutorialLinAlgComputeTwice.cpp | 10 LLT<Matrix2f> llt; local
15 cout << "Computing LLT decomposition..." << endl;
16 llt.compute(A);
17 cout << "The solution is:\n" << llt.solve(b) << endl;
20 cout << "Computing LLT decomposition..." << endl;
21 llt.compute(A);
22 cout << "The solution is now:\n" << llt.solve(b) << endl;
|
| /external/eigen/doc/snippets/ |
| LLT_solve.cpp | 7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
|
| /external/eigen/test/ |
| cholesky.cpp | 65 LLT.h LDLT.h
94 LLT<SquareMatrixType,Lower> chollo(symmLo);
102 LLT<SquareMatrixType,Upper> cholup(symmUp);
173 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
174 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
176 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
177 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
179 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB);
180 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
182 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB)
269 LLT<MatrixType> llt; local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement_test.cc | 112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs);
159 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
|
| schur_eliminator_test.cc | 115 .llt()
124 sol_expected = H.llt().solve(g);
163 .llt()
|
| block_jacobi_preconditioner.cc | 114 .llt()
|
| dense_normal_cholesky_solver.cc | 100 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
|
| schur_jacobi_preconditioner.cc | 131 .llt()
|
| implicit_schur_complement.cc | 164 .llt()
|
| incomplete_lq_factorization_test.cc | 108 Matrix expected_l_matrix = (mref * mref.transpose()).llt().matrixL();
|
| schur_complement_solver.cc | 137 .llt()
|
| schur_eliminator_impl.h | 271 .llt()
361 ete.llt().solveInPlace(y_block);
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 39 X = S.selfadjointView<Lower>().llt().solve(B);
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 22 LLT.h LDLT.h
54 symm.llt().solve(vecB, &vecX);
80 LLT<SquareMatrixType> chol(symm);
94 LLT<SquareMatrixType> chol(symm);
|
| eigen2_sparse_solvers.cpp | 72 // test LLT
83 refMat2.llt().solve(b, &refX);
89 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: default");
94 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: cholmod");
101 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (IncompleteFactorization)");
104 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalMultifrontal)");
107 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalLeftLooking)");
|
| /external/eigen/bench/btl/libs/eigen2/ |
| eigen2_interface.hh | 145 C = X.llt().matrixL();
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 21 * \class LLT
37 * Remember that Cholesky decompositions are not rank-revealing. This LLT decomposition is only stable on positive definite matrices,
44 * \sa MatrixBase::llt(), class LDLT
50 template<typename _MatrixType, int _UpLo> class LLT
76 * perform decompositions via LLT::compute(const MatrixType&).
78 LLT() : m_matrix(), m_isInitialized(false) {}
84 * \sa LLT()
86 LLT(Index size) : m_matrix(size, size),
89 LLT(const MatrixType& matrix)
99 eigen_assert(m_isInitialized && "LLT is not initialized.")
471 MatrixBase<Derived>::llt() const function in class:Eigen::MatrixBase
481 SelfAdjointView<MatrixType, UpLo>::llt() const function in class:Eigen::SelfAdjointView
[all...] |
| /external/eigen/Eigen/src/Core/ |
| SelfAdjointView.h | 152 const LLT<PlainObject, UpLo> llt() const;
|
| MatrixBase.h | 364 const LLT<PlainObject> llt() const;
|
