| /external/eigen/failtest/ |
| sparse_ref_1.cpp | 11 void call_ref(Ref<SparseMatrix<float> > a) { }
15 SparseMatrix<float> a(10,10);
16 CV_QUALIFIER SparseMatrix<float>& ac(a);
|
| sparse_ref_3.cpp | 6 void call_ref(Ref<SparseMatrix<float> > a) { }
8 void call_ref(const Ref<const SparseMatrix<float> > &a) { }
13 SparseMatrix<float> a(10,10);
|
| sparse_ref_5.cpp | 5 void call_ref(Ref<SparseMatrix<float> > a) { }
9 SparseMatrix<float> a(10,10);
10 SparseMatrixBase<SparseMatrix<float> > &ac(a);
|
| sparse_storage_mismatch.cpp | 4 typedef SparseMatrix<double,ColMajor> Mat1;
6 typedef SparseMatrix<double,RowMajor> Mat2;
8 typedef SparseMatrix<double,ColMajor> Mat2;
|
| sparse_ref_4.cpp | 5 void call_ref(Ref<SparseMatrix<float> > a) {}
9 SparseMatrix<float> A(10,10);
|
| sparse_ref_2.cpp | 5 void call_ref(Ref<SparseMatrix<float> > a) { }
9 SparseMatrix<float> A(10,10);
|
| /external/eigen/test/ |
| cholmod_support.cpp | 17 CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(CholmodSupernodalLLt);
18 CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(CholmodSupernodalLLt);
19 CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(CholmodSimplicialLLt);
20 CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(CholmodSimplicialLLt);
21 CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(CholmodLDLt);
22 CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(CholmodLDLt);
24 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower;
25 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper;
26 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
27 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper
[all...] |
| lscg.cpp | 15 LeastSquaresConjugateGradient<SparseMatrix<T> > lscg_colmajor_diag;
16 LeastSquaresConjugateGradient<SparseMatrix<T>, IdentityPreconditioner> lscg_colmajor_I;
17 LeastSquaresConjugateGradient<SparseMatrix<T,RowMajor> > lscg_rowmajor_diag;
18 LeastSquaresConjugateGradient<SparseMatrix<T,RowMajor>, IdentityPreconditioner> lscg_rowmajor_I;
|
| superlu_support.cpp | 17 SuperLU<SparseMatrix<double> > superlu_double_colmajor;
18 SuperLU<SparseMatrix<std::complex<double> > > superlu_cplxdouble_colmajor;
|
| umfpack_support.cpp | 17 UmfPackLU<SparseMatrix<T, ColMajor> > umfpack_colmajor;
18 UmfPackLU<SparseMatrix<T, RowMajor> > umfpack_rowmajor;
|
| pardiso_support.cpp | 10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower;
11 PardisoLLT < SparseMatrix<T, RowMajor>, Upper> pardiso_llt_upper;
12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower;
13 PardisoLDLT < SparseMatrix<T, RowMajor>, Upper> pardiso_ldlt_upper;
14 PardisoLU < SparseMatrix<T, RowMajor> > pardiso_lu;
|
| bicgstab.cpp | 15 BiCGSTAB<SparseMatrix<T,0,I>, DiagonalPreconditioner<T> > bicgstab_colmajor_diag;
16 BiCGSTAB<SparseMatrix<T,0,I>, IdentityPreconditioner > bicgstab_colmajor_I;
17 BiCGSTAB<SparseMatrix<T,0,I>, IncompleteLUT<T,I> > bicgstab_colmajor_ilut;
18 //BiCGSTAB<SparseMatrix<T>, SSORPreconditioner<T> > bicgstab_colmajor_ssor;
|
| sparselu.cpp | 24 SparseLU<SparseMatrix<T, ColMajor> /*, COLAMDOrdering<int>*/ > sparselu_colamd; // COLAMDOrdering is the default
25 SparseLU<SparseMatrix<T, ColMajor>, AMDOrdering<int> > sparselu_amd;
26 SparseLU<SparseMatrix<T, ColMajor, long int>, NaturalOrdering<long int> > sparselu_natural;
|
| pastix_support.cpp | 19 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower;
20 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower;
21 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_llt_upper;
22 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_ldlt_upper;
23 PastixLU< SparseMatrix<T, ColMajor> > pastix_lu;
44 PastixLU< SparseMatrix<T, ColMajor> > pastix_lu;
|
| metis_support.cpp | 17 SparseLU<SparseMatrix<T, ColMajor>, MetisOrdering<int> > sparselu_metis;
|
| sparse_ref.cpp | 45 EIGEN_DONT_INLINE void call_ref_1(Ref<SparseMatrix<float> > a, const B &b) { VERIFY_IS_EQUAL(a.toDense(),b.toDense()); }
48 EIGEN_DONT_INLINE void call_ref_2(const Ref<const SparseMatrix<float> >& a, const B &b) { VERIFY_IS_EQUAL(a.toDense(),b.toDense()); }
51 EIGEN_DONT_INLINE void call_ref_3(const Ref<const SparseMatrix<float>, StandardCompressedFormat>& a, const B &b) {
64 SparseMatrix<float> A = MatrixXf::Random(10,10).sparseView(0.5,1);
65 SparseMatrix<float,RowMajor> B = MatrixXf::Random(10,10).sparseView(0.5,1);
66 SparseMatrix<float> C = MatrixXf::Random(10,10).sparseView(0.5,1);
68 const SparseMatrix<float>& Ac(A);
69 Block<SparseMatrix<float> > Ab(A,0,1, 3,3);
70 const Block<SparseMatrix<float> > Abc(A,0,1,3,3);
73 SparseMatrix<float> AA = A*A
[all...] |
| incomplete_cholesky.cpp | 17 typedef SparseMatrix<T,0,I> SparseMatrixType;
45 Eigen::SparseMatrix<double> m( N, N );
55 Eigen::SparseMatrix<double> A;
58 Eigen::ConjugateGradient<Eigen::SparseMatrix<double>,
|
| /external/eigen/unsupported/test/ |
| dgmres.cpp | 16 DGMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > dgmres_colmajor_diag;
17 DGMRES<SparseMatrix<T>, IdentityPreconditioner > dgmres_colmajor_I;
18 DGMRES<SparseMatrix<T>, IncompleteLUT<T> > dgmres_colmajor_ilut;
19 //GMRES<SparseMatrix<T>, SSORPreconditioner<T> > dgmres_colmajor_ssor;
|
| gmres.cpp | 16 GMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > gmres_colmajor_diag;
17 GMRES<SparseMatrix<T>, IdentityPreconditioner > gmres_colmajor_I;
18 GMRES<SparseMatrix<T>, IncompleteLUT<T> > gmres_colmajor_ilut;
19 //GMRES<SparseMatrix<T>, SSORPreconditioner<T> > gmres_colmajor_ssor;
|
| minres.cpp | 18 MINRES<SparseMatrix<T>, Lower, IdentityPreconditioner > minres_colmajor_lower_I;
19 MINRES<SparseMatrix<T>, Upper, IdentityPreconditioner > minres_colmajor_upper_I;
22 MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_lower_diag;
23 MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_upper_diag;
24 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
| /external/eigen/doc/snippets/ |
| BiCGSTAB_simple.cpp | 3 SparseMatrix<double> A(n,n);
5 BiCGSTAB<SparseMatrix<double> > solver;
|
| BiCGSTAB_step_by_step.cpp | 3 SparseMatrix<double> A(n,n);
5 BiCGSTAB<SparseMatrix<double> > solver(A);
|
| SparseMatrix_coeffs.cpp | 0 SparseMatrix<double> A(3,3);
|
| /external/eigen/Eigen/src/SparseCore/ |
| MappedSparseMatrix.h | 15 /** \deprecated Use Map<SparseMatrix<> >
27 struct traits<MappedSparseMatrix<_Scalar, _Flags, _StorageIndex> > : traits<SparseMatrix<_Scalar, _Flags, _StorageIndex> >
33 : public Map<SparseMatrix<_Scalar, _Flags, _StorageIndex> >
35 typedef Map<SparseMatrix<_Scalar, _Flags, _StorageIndex> > Base;
|
| SparseMap.h | 18 struct traits<Map<SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
19 : public traits<SparseMatrix<MatScalar,MatOptions,MatIndex> >
21 typedef SparseMatrix<MatScalar,MatOptions,MatIndex> PlainObjectType;
29 struct traits<Map<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
30 : public traits<SparseMatrix<MatScalar,MatOptions,MatIndex> >
32 typedef SparseMatrix<MatScalar,MatOptions,MatIndex> PlainObjectType;
94 /** \copydoc SparseMatrix::valuePtr */
96 /** \copydoc SparseMatrix::innerIndexPtr */
98 /** \copydoc SparseMatrix::outerIndexPtr */
100 /** \copydoc SparseMatrix::innerNonZeroPtr *
[all...] |
