| /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_amd; in test_simplicial_cholesky_T()
15 SimplicialCholesky<SparseMatrix<T>, Upper> chol_colmajor_upper_amd; in test_simplicial_cholesky_T()
16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower_amd; in test_simplicial_cholesky_T()
17 SimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper_amd; in test_simplicial_cholesky_T()
18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower_amd; in test_simplicial_cholesky_T()
19 SimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper_amd; in test_simplicial_cholesky_T()
20 SimplicialLDLT<SparseMatrix<T>, Lower, NaturalOrdering<int> > ldlt_colmajor_lower_nat; in test_simplicial_cholesky_T()
21 SimplicialLDLT<SparseMatrix<T>, Upper, NaturalOrdering<int> > ldlt_colmajor_upper_nat; 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 | sparselu.cpp | 40 …SparseLU<SparseMatrix<T, ColMajor> /*, COLAMDOrdering<int>*/ > sparselu_colamd; // COLAMDOrdering … in test_sparselu_T()
41 SparseLU<SparseMatrix<T, ColMajor>, AMDOrdering<int> > sparselu_amd; in test_sparselu_T()
42 SparseLU<SparseMatrix<T, ColMajor, long int>, NaturalOrdering<long int> > sparselu_natural; in test_sparselu_T()
|
| /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…
626 const Diagonal<const SparseMatrix> diagonal() const { return *this; }
[all …]
|
| D | ConservativeSparseSparseProduct.h | 137 …typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatr…
138 …typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatr…
152 …typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatr…
165 …typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatr…
178 …typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatr…
193 …typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatr…
205 …typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatr…
218 …typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatr…
231 …typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatr…
232 …typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatr…
|
| D | SparseSelfAdjointView.h | 42 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder…
45 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestO…
124 …template<typename DestScalar,int StorageOrder> void evalTo(SparseMatrix<DestScalar,StorageOrder,In…
132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
202 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint();
314 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestO…
318 typedef SparseMatrix<Scalar,DestOrder,Index> Dest;
401 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DstOrder,…
405 SparseMatrix<Scalar,DstOrder,Index>& dest(_dest.derived());
486 void evalTo(SparseMatrix<DestScalar,Options,DstIndex>& _dest) const
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | preconditioner.h | 45 class SparseMatrix; variable
154 typedef TypedPreconditioner<SparseMatrix> SparseMatrixPreconditioner; //…
162 explicit SparseMatrixPreconditionerWrapper(const SparseMatrix* matrix);
170 virtual bool UpdateImpl(const SparseMatrix& A, const double* D);
171 const SparseMatrix* matrix_;
|
| D | dogleg_strategy.h | 62 SparseMatrix* jacobian,
84 SparseMatrix* jacobian,
86 void ComputeCauchyPoint(SparseMatrix* jacobian);
87 void ComputeGradient(SparseMatrix* jacobian, const double* residuals);
89 bool ComputeSubspaceModel(SparseMatrix* jacobian);
|
| D | evaluator.h | 50 class SparseMatrix; variable
118 virtual SparseMatrix* CreateJacobian() const = 0;
146 SparseMatrix* jacobian) = 0;
155 SparseMatrix* jacobian) { in Evaluate()
|
| D | dynamic_compressed_row_jacobian_writer.h | 44 class SparseMatrix; variable
64 SparseMatrix* CreateJacobian() const;
74 SparseMatrix* base_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 | 44 class SparseMatrix; variable
95 SparseMatrix* CreateJacobian() const;
100 SparseMatrix* base_jacobian);
|
| D | sparse_matrix.cc | 36 SparseMatrix::~SparseMatrix() { in ~SparseMatrix()
|
| /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 | dgmres.cpp | 16 DGMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > dgmres_colmajor_diag; in test_dgmres_T()
17 DGMRES<SparseMatrix<T>, IdentityPreconditioner > dgmres_colmajor_I; in test_dgmres_T()
18 DGMRES<SparseMatrix<T>, IncompleteLUT<T> > dgmres_colmajor_ilut; in test_dgmres_T()
|
| 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 | sparse_extra.cpp | 18 bool test_random_setter(SparseMatrix<Scalar,Options>& sm, const DenseType& ref, const std::vector<V… in test_random_setter()
78 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value) in sparse_extra()
137 CALL_SUBTEST_1( sparse_extra(SparseMatrix<double>(8, 8)) ); in test_sparse_extra()
138 CALL_SUBTEST_2( sparse_extra(SparseMatrix<std::complex<double> >(s, s)) ); in test_sparse_extra()
139 CALL_SUBTEST_1( sparse_extra(SparseMatrix<double>(s, s)) ); in test_sparse_extra()
|
| D | kronecker_product.cpp | 91 SparseMatrix<double> SM_a(2,3); in test_kronecker_product()
100 SparseMatrix<double> SM_b(3,2); in test_kronecker_product()
108 SparseMatrix<double,RowMajor> SM_row_a(SM_a), SM_row_b(SM_b); in test_kronecker_product()
129 SparseMatrix<double> SM_ab = kroneckerProduct(SM_a,DM_b); in test_kronecker_product()
131 SparseMatrix<double,RowMajor> SM_ab2 = kroneckerProduct(SM_a,DM_b); in test_kronecker_product()
|
| /external/eigen/bench/spbench/ |
| D | test_sparseLU.cpp | 21 SparseMatrix<scalar, ColMajor> A; in main()
22 typedef SparseMatrix<scalar, ColMajor>::Index Index; in main()
31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; in main()
51 SparseMatrix<scalar, ColMajor> temp; in main()
|
| D | sp_solver.cpp | 22 SparseMatrix<double, ColMajor> A; in main()
23 typedef SparseMatrix<double, ColMajor>::Index Index; in main()
30 …ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; in main()
49 SparseMatrix<double, ColMajor> temp; in main()
|
| /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()
|