Home
last modified time | relevance | path

Searched refs:LLT (Results 1 – 25 of 26) sorted by relevance

12

/external/eigen/Eigen/src/Cholesky/
DLLT.h52 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/
DOrderingMethods22 * the sparse matrix decomposition (LLT, LU, QR).
26 * the nonzeros elements in LLT(A*P) will be much smaller than that in LLT(A).
DCholesky31 #include "src/Cholesky/LLT.h"
DCholmodSupport24 * - class CholmodSupernodalLLT: a supernodal LLT Cholesky factorization.
/external/eigen/test/
Dnomalloc.cpp121 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()
Dcholesky.cpp87 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()
Dinplace_decomposition.cpp86 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/
DDenseDecompositionBenchmark.dox13 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…
DSparseLinearSystems.dox145 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…
DInplaceDecomposition.dox104 - class LLT
DTutorialLinearAlgebra.dox89 <td>LLT</td>
117 choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a ge…
DTopicAliasing.dox121 <tr class="alt"> <td> LLT::solve() </td> <td> LLT::solveInPlace() </td> </tr>
DTopicLinearAlgebraDecompositions.dox91 <td>LLT</td>
DTutorialSparse.dox12 …/td><td>\code#include <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky f…
/external/eigen/failtest/
Dllt_int.cpp13 LLT<Matrix<SCALAR,Dynamic,Dynamic> > llt(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10)); in main()
/external/eigen/doc/snippets/
DLLT_example.cpp5 LLT<MatrixXd> lltOfA(A); // compute the Cholesky decomposition of A
/external/eigen/doc/examples/
DTutorialLinAlgComputeTwice.cpp10 LLT<Matrix2f> llt; in main()
/external/eigen/Eigen/src/Eigenvalues/
DGeneralizedSelfAdjointEigenSolver.h175 LLT<MatrixType> cholB(matB); in compute()
/external/eigen/bench/spbench/
Dspbench.dtd4 <!ELEMENT TYPE (#PCDATA)> <!-- One of LU, LLT, LDLT, ITER -->
/external/eigen/bench/
DbenchCholesky.cpp70 LLT<SquareMatrixType> chol(covMat); in benchLLT()
Dsparse_cholesky.cpp113 LLT<DenseMatrix> chol(m1); in main()
Ddense_solvers.cpp48 LLT<MatSquare> llt(size); in bench()
/external/eigen/Eigen/src/Core/
DSelfAdjointView.h235 const LLT<PlainObject, UpLo> llt() const;
DMatrixBase.h357 inline const LLT<PlainObject> llt() const;
/external/eigen/Eigen/src/Core/util/
DForwardDeclarations.h260 template<typename MatrixType, int UpLo = Lower> class LLT;

12