/external/eigen/Eigen/src/Cholesky/ |
D | LLT.h | 52 template<typename _MatrixType, int _UpLo> class LLT 80 LLT() : m_matrix(), m_isInitialized(false) {} in LLT() function 88 explicit LLT(Index size) : m_matrix(size, size), in LLT() function 92 explicit LLT(const EigenBase<InputType>& matrix) in LLT() function 107 explicit LLT(EigenBase<InputType>& matrix) in LLT() function 139 inline const Solve<LLT, Rhs> 145 return Solve<LLT, Rhs>(*this, b.derived()); in solve() 152 LLT& compute(const EigenBase<InputType>& matrix); 193 const LLT& adjoint() const { return *this; }; in adjoint() 199 LLT rankUpdate(const VectorType& vec, const RealScalar& sigma = 1); [all …]
|
/external/eigen/Eigen/ |
D | OrderingMethods | 22 * the sparse matrix decomposition (LLT, LU, QR). 26 * the nonzeros elements in LLT(A*P) will be much smaller than that in LLT(A).
|
D | Cholesky | 31 #include "src/Cholesky/LLT.h"
|
D | CholmodSupport | 24 * - class CholmodSupernodalLLT: a supernodal LLT Cholesky factorization.
|
/external/eigen/test/ |
D | nomalloc.cpp | 121 Eigen::LLT<Matrix> LLT; LLT.compute(A); in ctms_decompositions() local 122 X = LLT.solve(B); in ctms_decompositions() 123 x = LLT.solve(b); in ctms_decompositions()
|
D | cholesky.cpp | 87 LLT<SquareMatrixType,Lower> chollo(symmLo); in cholesky() 103 LLT<SquareMatrixType,Upper> cholup(symmUp); in cholesky() 281 CALL_SUBTEST(( test_chol_update<SquareMatrixType,LLT>(symm) )); in cholesky() 316 LLT<RealMatrixType,Lower> chollo(symmLo); in cholesky_cplx() 461 LLT<MatrixType> llt; in cholesky_verify_assert() 503 CALL_SUBTEST_9( LLT<MatrixXf>(10) ); in test_cholesky()
|
D | inplace_decomposition.cpp | 86 CALL_SUBTEST_1(( inplace<LLT<Ref<MatrixXd> >, MatrixXd>(true,true) )); in test_inplace_decomposition() 87 CALL_SUBTEST_1(( inplace<LLT<Ref<Matrix4d> >, Matrix4d>(true,true) )); in test_inplace_decomposition()
|
/external/eigen/doc/ |
D | DenseDecompositionBenchmark.dox | 13 Timings are in \b milliseconds, and factors are relative to the LLT decomposition which is the fast… 18 <tr><td>LLT</td><td>0.05</td><td>0.42</td><td>5.83</td><td>374.55</td><td>6.79 <sup><a href="#note_… 33 + LLT is always the fastest solvers. 35 … implementing a cache-friendly blocking strategy scale well. Those include LLT, PartialPivLU, Hous…
|
D | SparseLinearSystems.dox | 145 In the compute() function, the matrix is generally factorized: LLT for self-adjoint matrices, LDLT … 193 …LDLT <TH> CHOLMOD LDLT <TH > PASTIX LDLT <TH > LLT <TH > CHOLMOD SP LLT <TH > CHOLMOD LLT <TH > PA…
|
D | InplaceDecomposition.dox | 104 - class LLT
|
D | TutorialLinearAlgebra.dox | 89 <td>LLT</td> 117 choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a ge…
|
D | TopicAliasing.dox | 121 <tr class="alt"> <td> LLT::solve() </td> <td> LLT::solveInPlace() </td> </tr>
|
D | TopicLinearAlgebraDecompositions.dox | 91 <td>LLT</td>
|
D | TutorialSparse.dox | 12 …/td><td>\code#include <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky f…
|
/external/eigen/failtest/ |
D | llt_int.cpp | 13 LLT<Matrix<SCALAR,Dynamic,Dynamic> > llt(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10)); in main()
|
/external/eigen/doc/snippets/ |
D | LLT_example.cpp | 5 LLT<MatrixXd> lltOfA(A); // compute the Cholesky decomposition of A
|
/external/eigen/doc/examples/ |
D | TutorialLinAlgComputeTwice.cpp | 10 LLT<Matrix2f> llt; in main()
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | GeneralizedSelfAdjointEigenSolver.h | 175 LLT<MatrixType> cholB(matB); in compute()
|
/external/eigen/bench/spbench/ |
D | spbench.dtd | 4 <!ELEMENT TYPE (#PCDATA)> <!-- One of LU, LLT, LDLT, ITER -->
|
/external/eigen/bench/ |
D | benchCholesky.cpp | 70 LLT<SquareMatrixType> chol(covMat); in benchLLT()
|
D | sparse_cholesky.cpp | 113 LLT<DenseMatrix> chol(m1); in main()
|
D | dense_solvers.cpp | 48 LLT<MatSquare> llt(size); in bench()
|
/external/eigen/Eigen/src/Core/ |
D | SelfAdjointView.h | 235 const LLT<PlainObject, UpLo> llt() const;
|
D | MatrixBase.h | 357 inline const LLT<PlainObject> llt() const;
|
/external/eigen/Eigen/src/Core/util/ |
D | ForwardDeclarations.h | 260 template<typename MatrixType, int UpLo = Lower> class LLT;
|