| /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/wpa_supplicant_8/src/fst/ |
| fst.h | 213 u32 llt; member in struct:fst_iface_cfg
|
| fst_defs.h | 50 le32 llt; member in struct:fst_setup_req
|
| fst_session.c | 488 fst_session_set_llt(s, FST_LLT_VAL_TO_MS(le_to_host32(req->llt)));
592 "%s: FST Setup established for %s (llt=%u)",
798 void fst_session_set_llt(struct fst_session *s, u32 llt)
800 s->data.llt_ms = llt;
888 "initiating FST setup for %s (llt=%u ms)",
893 req.llt = host_to_le32(FST_LLT_MS_TO_VAL(s->data.llt_ms));
992 "%s: FST Setup Request accepted for %s (llt=%u)",
1272 long int llt = strtol(llt_str, &endp, 0); local
[all...] |
| /external/eigen/test/ |
| cholesky.cpp | 62 LLT.h LDLT.h
87 LLT<SquareMatrixType,Lower> chollo(symmLo);
103 LLT<SquareMatrixType,Upper> cholup(symmUp);
131 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
132 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
134 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
135 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
137 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB);
138 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
140 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB)
461 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,
46 * \sa MatrixBase::llt(), SelfAdjointView::llt(), class LDLT
52 template<typename _MatrixType, int _UpLo> class LLT
78 * perform decompositions via LLT::compute(const MatrixType&).
80 LLT() : m_matrix(), m_isInitialized(false) {}
86 * \sa LLT()
88 explicit LLT(Index size) : m_matrix(size, size),
92 explicit LLT(const EigenBase<InputType>& matrix
516 MatrixBase<Derived>::llt() const function in class:Eigen::MatrixBase
527 SelfAdjointView<MatrixType, UpLo>::llt() const function in class:Eigen::SelfAdjointView
[all...] |
