/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() 359 LLT<MatrixType> llt; in cholesky_verify_assert() local 360 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()
|
D | schur_eliminator_impl.h | 274 .llt() in Eliminate() 364 ete.llt().solveInPlace(y_block); in BackSubstitute()
|
/external/eigen/doc/snippets/ |
D | LLT_solve.cpp | 7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
|
/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>
|
D | AsciiQuickReference.txt | 191 x = A.llt() .solve(b)); // A sym. p.d. #include <Eigen/Cholesky> 196 // .llt() -> .matrixL()
|
D | UsingIntelMKL.dox | 98 v1 = m2.selfadjointView<Upper>().llt().solve(v2);
|
D | TutorialLinearAlgebra.dox | 84 <td>llt()</td>
|
D | QuickReference.dox | 660 m2 = m1.selfadjointView<Eigen::Upper>().llt().solve(m2); 723 mat2 = mat1.selfadjointView<Upper or Lower>().llt().solve(mat2)
|
/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()
|
D | eigen2_sparse_solvers.cpp | 83 refMat2.llt().solve(b, &refX); in sparse_solvers()
|
/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 | 473 MatrixBase<Derived>::llt() const 483 SelfAdjointView<MatrixType, UpLo>::llt() const
|
/external/eigen/Eigen/src/Core/ |
D | SelfAdjointView.h | 152 const LLT<PlainObject, UpLo> llt() const;
|
D | MatrixBase.h | 367 const LLT<PlainObject> llt() const;
|