| /external/eigen/doc/examples/ |
| D | TutorialLinAlgComputeTwice.cpp | 10 LLT<Matrix2f> llt; in main() local
16 llt.compute(A); in main()
17 cout << "The solution is:\n" << llt.solve(b) << endl; in main()
21 llt.compute(A); in main()
22 cout << "The solution is now:\n" << llt.solve(b) << endl; in main()
|
| /external/eigen/test/ |
| D | cholesky.cpp | 121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
128 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
130 m2.noalias() -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
131 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
361 LLT<MatrixType> llt; in cholesky_verify_assert() local
362 VERIFY_RAISES_ASSERT(llt.matrixL()) in cholesky_verify_assert()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | dense_normal_cholesky_solver.cc | 99 Eigen::LLT<Matrix, Eigen::Upper> llt = in SolveUsingEigen() local
100 lhs.selfadjointView<Eigen::Upper>().llt(); in SolveUsingEigen()
102 if (llt.info() != Eigen::Success) { in SolveUsingEigen()
110 VectorRef(x, num_cols) = llt.solve(rhs); in SolveUsingEigen()
|
| D | schur_eliminator_test.cc | 115 .llt() in ComputeReferenceSolution()
124 sol_expected = H.llt().solve(g); in ComputeReferenceSolution()
163 .llt() in EliminateSolveAndCompare()
|
| D | schur_complement_solver.cc | 137 Eigen::LLT<Matrix, Eigen::Upper> llt = in SolveReducedLinearSystem() local
140 .llt(); in SolveReducedLinearSystem()
141 if (llt.info() != Eigen::Success) { in SolveReducedLinearSystem()
148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows)); in SolveReducedLinearSystem()
|
| D | implicit_schur_complement_test.cc | 112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs); in ReducedLinearSystemAndSolution()
162 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs); in TestImplicitSchurComplement()
|
| D | schur_jacobi_preconditioner.cc | 121 .llt() in RightMultiply()
|
| D | block_jacobi_preconditioner.cc | 116 .llt() in UpdateImpl()
|
| D | implicit_schur_complement.cc | 161 .llt() in AddDiagonalAndInvert()
|
| D | incomplete_lq_factorization_test.cc | 108 Matrix expected_l_matrix = (mref * mref.transpose()).llt().matrixL(); in TEST()
|
| /external/wpa_supplicant_8/src/fst/ |
| D | fst_iface.c | 35 if (!i->cfg.llt) { in fst_iface_create()
37 i->cfg.llt = FST_DEFAULT_LLT_CFG_VALUE; in fst_iface_create()
|
| D | fst_session.c | 507 fst_session_set_llt(s, FST_LLT_VAL_TO_MS(le_to_host32(req->llt))); in fst_session_handle_setup_request()
819 void fst_session_set_llt(struct fst_session *s, u32 llt) in fst_session_set_llt() argument
821 s->data.llt_ms = llt; in fst_session_set_llt()
914 req.llt = host_to_le32(FST_LLT_MS_TO_VAL(s->data.llt_ms)); in fst_session_initiate_setup()
1293 long int llt = strtol(llt_str, &endp, 0); in fst_session_set_str_llt() local
1295 if (*endp || llt < 0 || (unsigned long int) llt > FST_MAX_LLT_MS) { in fst_session_set_str_llt()
1301 fst_session_set_llt(s, (u32) llt); in fst_session_set_str_llt()
1395 req.llt = host_to_le32(FST_LLT_MS_DEFAULT); in fst_test_req_send_fst_request()
|
| D | fst_defs.h | 50 u32 llt; member
|
| D | fst_session.h | 28 void fst_session_set_llt(struct fst_session *s, u32 llt);
|
| D | fst.h | 213 u32 llt; member
|
| D | fst_iface.h | 61 return i->cfg.llt; in fst_iface_get_llt()
|
| D | fst.c | 83 cfg->group_id, cfg->priority, cfg->llt); in fst_attach()
|
| /external/eigen/failtest/ |
| D | llt_int.cpp | 13 LLT<Matrix<SCALAR,Dynamic,Dynamic> > llt(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10)); in main() local
|
| /external/eigen/doc/ |
| D | A05_PortingFrom2To3.dox | 208 <tr><td>\code A.llt().solve(B,&X);\endcode</td>
209 <td>\code X = A.llt().solve(B);
210 X = A.selfadjointView<Lower>.llt().solve(B);
211 X = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
215 <tr><td>\code A.llt().solveInPlace(B);\endcode</td>
216 <td>\code B = A.llt().solve(B);
217 B = A.selfadjointView<Lower>.llt().solve(B);
218 B = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
|
| /external/eigen/doc/snippets/ |
| D | LLT_solve.cpp | 7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
|
| /external/eigen/Eigen/ |
| D | Cholesky | 14 * - MatrixBase::llt(),
|
| /external/eigen/unsupported/test/ |
| D | mpreal_support.cpp | 38 X = S.selfadjointView<Lower>().llt().solve(B); in test_mpreal_support()
|
| /external/eigen/test/eigen2/ |
| D | eigen2_cholesky.cpp | 54 symm.llt().solve(vecB, &vecX); in cholesky()
|
| /external/eigen/bench/btl/libs/eigen2/ |
| D | eigen2_interface.hh | 145 C = X.llt().matrixL(); in cholesky()
|
| /external/eigen/Eigen/src/Cholesky/ |
| D | LLT.h | 481 MatrixBase<Derived>::llt() const
491 SelfAdjointView<MatrixType, UpLo>::llt() const
|