| /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/ceres-solver/internal/ceres/ |
| dense_normal_cholesky_solver.cc | 99 Eigen::LLT<Matrix, Eigen::Upper> llt = local
100 lhs.selfadjointView<Eigen::Upper>().llt();
102 if (llt.info() != Eigen::Success) {
104 summary.message = "Eigen LLT decomposition failed.";
110 VectorRef(x, num_cols) = llt.solve(rhs);
|
| schur_complement_solver.cc | 137 Eigen::LLT<Matrix, Eigen::Upper> llt = local
140 .llt();
141 if (llt.info() != Eigen::Success) {
148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows));
|
| /external/wpa_supplicant_8/src/fst/ |
| fst.h | 213 u32 llt; member in struct:fst_iface_cfg
|
| fst_defs.h | 50 u32 llt; member in struct:fst_setup_req
|
| fst_session.c | 507 fst_session_set_llt(s, FST_LLT_VAL_TO_MS(le_to_host32(req->llt)));
611 "%s: FST Setup established for %s (llt=%u)",
819 void fst_session_set_llt(struct fst_session *s, u32 llt)
821 s->data.llt_ms = llt;
909 "initiating FST setup for %s (llt=%u ms)",
914 req.llt = host_to_le32(FST_LLT_MS_TO_VAL(s->data.llt_ms));
1013 "%s: FST Setup Request accepted for %s (llt=%u)",
1293 long int llt = strtol(llt_str, &endp, 0); local
[all...] |
| /external/eigen/test/ |
| cholesky.cpp | 65 LLT.h LDLT.h
94 LLT<SquareMatrixType,Lower> chollo(symmLo);
102 LLT<SquareMatrixType,Upper> cholup(symmUp);
121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB);
128 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
130 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB)
361 LLT<MatrixType> llt; local
[all...] |
| /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.")
481 MatrixBase<Derived>::llt() const function in class:Eigen::MatrixBase
491 SelfAdjointView<MatrixType, UpLo>::llt() const function in class:Eigen::SelfAdjointView
[all...] |
