/external/eigen/test/ |
D | cholmod_support.cpp | 16 …CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(… in test_cholmod_T() 17 …CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(… in test_cholmod_T() 18 …CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(C… in test_cholmod_T() 19 …CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(C… in test_cholmod_T() 20 …CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(… in test_cholmod_T() 21 …CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(… in test_cholmod_T() 23 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower; in test_cholmod_T() 24 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper; in test_cholmod_T() 25 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower; in test_cholmod_T() 26 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper; in test_cholmod_T() [all …]
|
D | simplicial_cholesky.cpp | 14 SimplicialCholesky<SparseMatrix<T>, Lower> chol_colmajor_lower; in test_simplicial_cholesky_T() 15 SimplicialCholesky<SparseMatrix<T>, Upper> chol_colmajor_upper; in test_simplicial_cholesky_T() 16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower; in test_simplicial_cholesky_T() 17 SimplicialLDLT<SparseMatrix<T>, Upper> llt_colmajor_upper; in test_simplicial_cholesky_T() 18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower; in test_simplicial_cholesky_T() 19 SimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper; in test_simplicial_cholesky_T()
|
D | pastix_support.cpp | 17 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower; in test_pastix_T() 18 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower; in test_pastix_T() 19 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_llt_upper; in test_pastix_T() 20 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_ldlt_upper; in test_pastix_T() 21 PastixLU< SparseMatrix<T, ColMajor> > pastix_lu; in test_pastix_T() 34 PastixLU< SparseMatrix<T, ColMajor> > pastix_lu; in test_pastix_T_LU()
|
D | pardiso_support.cpp | 10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower; in test_pardiso_T() 11 PardisoLLT < SparseMatrix<T, RowMajor>, Upper> pardiso_llt_upper; in test_pardiso_T() 12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower; in test_pardiso_T() 13 PardisoLDLT < SparseMatrix<T, RowMajor>, Upper> pardiso_ldlt_upper; in test_pardiso_T() 14 PardisoLU < SparseMatrix<T, RowMajor> > pardiso_lu; in test_pardiso_T()
|
D | conjugate_gradient.cpp | 15 ConjugateGradient<SparseMatrix<T>, Lower> cg_colmajor_lower_diag; in test_conjugate_gradient_T() 16 ConjugateGradient<SparseMatrix<T>, Upper> cg_colmajor_upper_diag; in test_conjugate_gradient_T() 17 ConjugateGradient<SparseMatrix<T>, Lower, IdentityPreconditioner> cg_colmajor_lower_I; in test_conjugate_gradient_T() 18 ConjugateGradient<SparseMatrix<T>, Upper, IdentityPreconditioner> cg_colmajor_upper_I; in test_conjugate_gradient_T()
|
D | bicgstab.cpp | 15 BiCGSTAB<SparseMatrix<T>, DiagonalPreconditioner<T> > bicgstab_colmajor_diag; in test_bicgstab_T() 16 BiCGSTAB<SparseMatrix<T>, IdentityPreconditioner > bicgstab_colmajor_I; in test_bicgstab_T() 17 BiCGSTAB<SparseMatrix<T>, IncompleteLUT<T> > bicgstab_colmajor_ilut; in test_bicgstab_T()
|
D | superlu_support.cpp | 16 SuperLU<SparseMatrix<double> > superlu_double_colmajor; in test_superlu_support() 17 SuperLU<SparseMatrix<std::complex<double> > > superlu_cplxdouble_colmajor; in test_superlu_support()
|
D | umfpack_support.cpp | 16 UmfPackLU<SparseMatrix<T, ColMajor> > umfpack_colmajor; in test_umfpack_support_T() 17 UmfPackLU<SparseMatrix<T, RowMajor> > umfpack_rowmajor; in test_umfpack_support_T()
|
D | sparse_solvers.cpp | 15 SparseMatrix<Scalar>& sparseMat) in initSPD() 48 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() 63 SparseMatrix<Scalar> cm2(m2); in sparse_solvers() 80 SparseMatrix<Scalar> matB(rows, rows); in sparse_solvers()
|
/external/ceres-solver/internal/ceres/ |
D | dogleg_strategy.h | 62 SparseMatrix* jacobian, 82 LinearSolver::Summary ComputeGaussNewtonStep(SparseMatrix* jacobian, 84 void ComputeCauchyPoint(SparseMatrix* jacobian); 85 void ComputeGradient(SparseMatrix* jacobian, const double* residuals); 87 bool ComputeSubspaceModel(SparseMatrix* jacobian);
|
D | block_jacobian_writer.h | 50 class SparseMatrix; variable 63 SparseMatrix* CreateJacobian() const; 68 SparseMatrix* /* jacobian */) { in Write() argument
|
D | compressed_row_jacobian_writer.h | 43 class SparseMatrix; variable 61 SparseMatrix* CreateJacobian() const; 66 SparseMatrix* base_jacobian);
|
D | evaluator.h | 47 class SparseMatrix; variable 114 virtual SparseMatrix* CreateJacobian() const = 0; 129 SparseMatrix* jacobian) = 0;
|
D | sparse_matrix.cc | 36 SparseMatrix::~SparseMatrix() { in ~SparseMatrix()
|
D | block_evaluate_preparer.h | 45 class SparseMatrix; variable 62 SparseMatrix* jacobian,
|
D | scratch_evaluate_preparer.h | 45 class SparseMatrix; variable 57 SparseMatrix* jacobian,
|
D | trust_region_minimizer.h | 55 void EstimateScale(const SparseMatrix& jacobian, double* scale) const; 58 const SparseMatrix* jacobian,
|
D | sparse_matrix.h | 67 class SparseMatrix : public LinearOperator { 69 virtual ~SparseMatrix();
|
/external/eigen/Eigen/src/SparseCore/ |
D | SparseMatrix.h | 43 struct traits<SparseMatrix<_Scalar, _Options, _Index> > 61 struct traits<Diagonal<const SparseMatrix<_Scalar, _Options, _Index>, DiagIndex> > 63 typedef SparseMatrix<_Scalar, _Options, _Index> MatrixType; 85 class SparseMatrix 86 : public SparseMatrixBase<SparseMatrix<_Scalar, _Options, _Index> > 89 EIGEN_SPARSE_PUBLIC_INTERFACE(SparseMatrix) 90 EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseMatrix, +=) 91 EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseMatrix, -=) 102 …typedef SparseMatrix<Scalar,(Flags&~RowMajorBit)|(IsRowMajor?RowMajorBit:0)> TransposedSparseMatri… 540 const Diagonal<const SparseMatrix> diagonal() const { return *this; } [all …]
|
D | ConservativeSparseSparseProduct.h | 137 typedef SparseMatrix<typename ResultType::Scalar,RowMajor> RowMajorMatrix; 138 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix; 152 typedef SparseMatrix<typename ResultType::Scalar,RowMajor> RowMajorMatrix; 165 typedef SparseMatrix<typename ResultType::Scalar,RowMajor> RowMajorMatrix; 178 typedef SparseMatrix<typename ResultType::Scalar,RowMajor> RowMajorMatrix; 193 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix; 205 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix; 218 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix; 231 typedef SparseMatrix<typename ResultType::Scalar,RowMajor> RowMajorMatrix; 232 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix;
|
/external/eigen/test/eigen2/ |
D | eigen2_sparse_solvers.cpp | 15 SparseMatrix<Scalar>& sparseMat) in initSPD() 48 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() 75 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() 84 typedef SparseMatrix<Scalar,LowerTriangular|SelfAdjoint> SparseSelfAdjointMatrix; in sparse_solvers() 116 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() 128 typedef SparseMatrix<Scalar,UpperTriangular|SelfAdjoint> SparseSelfAdjointMatrix; in sparse_solvers() 139 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() 158 SparseLU<SparseMatrix<Scalar>,SuperLU> slu(m2); in sparse_solvers() 175 SparseLU<SparseMatrix<Scalar>,UmfPack> slu(m2); in sparse_solvers()
|
/external/eigen/unsupported/test/ |
D | sparse_extra.cpp | 18 bool test_random_setter(SparseMatrix<Scalar,Options>& sm, const DenseType& ref, const std::vector<V… in test_random_setter() 20 typedef SparseMatrix<Scalar,Options> SparseType; in test_random_setter() 79 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value) in sparse_extra() 138 CALL_SUBTEST_1( sparse_extra(SparseMatrix<double>(8, 8)) ); in test_sparse_extra() 139 CALL_SUBTEST_2( sparse_extra(SparseMatrix<std::complex<double> >(s, s)) ); in test_sparse_extra() 140 CALL_SUBTEST_1( sparse_extra(SparseMatrix<double>(s, s)) ); in test_sparse_extra()
|
D | gmres.cpp | 16 GMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > gmres_colmajor_diag; in test_gmres_T() 17 GMRES<SparseMatrix<T>, IdentityPreconditioner > gmres_colmajor_I; in test_gmres_T() 18 GMRES<SparseMatrix<T>, IncompleteLUT<T> > gmres_colmajor_ilut; in test_gmres_T()
|
D | kronecker_product.cpp | 90 SparseMatrix<double> SM_a(2,3); in test_kronecker_product() 91 SparseMatrix<double> SM_b(3,2); in test_kronecker_product() 104 SparseMatrix<double,RowMajor> SM_row_a(SM_a), SM_row_b(SM_b); in test_kronecker_product() 125 SparseMatrix<double> SM_ab(1,20); in test_kronecker_product() 129 SparseMatrix<double,RowMajor> SM_ab2(10,3); in test_kronecker_product()
|
/external/eigen/bench/ |
D | sparse_setter.cpp | 197 SparseMatrix<Scalar> mat(SIZE,SIZE); in setinnerrand_eigen() 250 SparseMatrix<Scalar> mat = setter; in setrand_eigen_compact() 258 SparseMatrix<Scalar> mat(SIZE,SIZE); in setrand_eigen_gnu_hash() 260 RandomSetter<SparseMatrix<Scalar>, StdMapTraits > setter(mat); in setrand_eigen_gnu_hash() 274 SparseMatrix<Scalar> mat(SIZE,SIZE); in setrand_eigen_google_dense() 276 RandomSetter<SparseMatrix<Scalar>, GoogleDenseHashMapTraits> setter(mat); in setrand_eigen_google_dense() 287 SparseMatrix<Scalar> mat(SIZE,SIZE); in setrand_eigen_google_sparse() 289 RandomSetter<SparseMatrix<Scalar>, GoogleSparseHashMapTraits> setter(mat); in setrand_eigen_google_sparse() 408 SparseMatrix<Scalar> mat(SIZE,SIZE); in setrand_scipy()
|