| /external/eigen/test/eigen2/ |
| eigen2_sparse_solvers.cpp | 15 SparseMatrix<Scalar>& sparseMat)
48 SparseMatrix<Scalar> m2(rows, cols);
75 SparseMatrix<Scalar> m2(rows, cols);
84 typedef SparseMatrix<Scalar,LowerTriangular|SelfAdjoint> SparseSelfAdjointMatrix;
116 SparseMatrix<Scalar> m2(rows, cols);
128 typedef SparseMatrix<Scalar,UpperTriangular|SelfAdjoint> SparseSelfAdjointMatrix;
139 SparseMatrix<Scalar> m2(rows, cols);
153 // // SparseLU<SparseMatrix<Scalar> > (m2).solve(b,&x);
158 SparseLU<SparseMatrix<Scalar>,SuperLU> slu(m2);
175 SparseLU<SparseMatrix<Scalar>,UmfPack> slu(m2)
[all...] |
| eigen2_sparse_basic.cpp | 13 bool test_random_setter(SparseMatrix<Scalar,Options>& sm, const DenseType& ref, const std::vector<Vector2i>& nonzeroCoords)
15 typedef SparseMatrix<Scalar,Options> SparseType;
74 if(ei_is_same_type<SparseMatrixType,SparseMatrix<Scalar,Flags> >::ret)
311 CALL_SUBTEST_1( sparse_basic(SparseMatrix<double>(8, 8)) );
312 CALL_SUBTEST_2( sparse_basic(SparseMatrix<std::complex<double> >(16, 16)) );
313 CALL_SUBTEST_1( sparse_basic(SparseMatrix<double>(33, 33)) );
|
| /external/ceres-solver/internal/ceres/ |
| dense_jacobian_writer.h | 63 SparseMatrix* CreateJacobian() const {
72 SparseMatrix* jacobian) {
|
| block_sparse_matrix.h | 31 // Implementation of the SparseMatrix interface for block sparse
48 // This class implements the SparseMatrix interface for storing and
56 class BlockSparseMatrix : public SparseMatrix {
69 // Implementation of SparseMatrix interface.
|
| cgnr_linear_operator.h | 42 class SparseMatrix;
|
| dense_sparse_matrix.h | 31 // A dense matrix implemented under the SparseMatrix interface.
47 class DenseSparseMatrix : public SparseMatrix {
59 // SparseMatrix interface.
|
| scratch_evaluate_preparer.cc | 60 SparseMatrix* /* jacobian */,
|
| minimizer.h | 45 class SparseMatrix;
176 SparseMatrix* jacobian;
|
| compressed_row_sparse_matrix.h | 49 class CompressedRowSparseMatrix : public SparseMatrix {
53 // incrementally, so we use them to initialize SparseMatrix
80 // SparseMatrix interface.
|
| triplet_sparse_matrix.h | 42 // An implementation of the SparseMatrix interface to store and
46 class TripletSparseMatrix : public SparseMatrix {
56 // Implementation of the SparseMatrix interface.
|
| compressed_row_jacobian_writer.cc | 43 SparseMatrix* CompressedRowJacobianWriter::CreateJacobian() const {
158 SparseMatrix* base_jacobian) {
|
| dense_sparse_matrix_test.cc | 48 void CompareMatrices(const SparseMatrix* a, const SparseMatrix* b) {
|
| evaluator_test.cc | 130 scoped_ptr<SparseMatrix> jacobian(evaluator->CreateJacobian());
184 void SetSparseMatrixConstant(SparseMatrix* sparse_matrix, double value) {
506 scoped_ptr<SparseMatrix> jacobian(evaluator->CreateJacobian());
579 scoped_ptr<SparseMatrix> jacobian(evaluator->CreateJacobian());
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrix.h | 17 * \class SparseMatrix
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)> TransposedSparseMatrix
[all...] |
| SparseRedux.h | 28 typename internal::traits<SparseMatrix<_Scalar,_Options,_Index> >::Scalar
29 SparseMatrix<_Scalar,_Options,_Index>::sum() const
|
| 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
[all...] |
| SparsePermutation.h | 31 SparseMatrix<Scalar,SrcStorageOrder,Index>,
32 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> >::type ReturnType;
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
|
| SparseSelfAdjointView.h | 42 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
45 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
100 template<typename DestScalar,int StorageOrder> void evalTo(SparseMatrix<DestScalar,StorageOrder,Index>& _dest) const
108 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
178 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint();
290 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm)
294 typedef SparseMatrix<Scalar,DestOrder,Index> Dest;
377 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DstOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm)
381 SparseMatrix<Scalar,DstOrder,Index>& dest(_dest.derived());
462 void evalTo(SparseMatrix<DestScalar,Options,DstIndex>& _dest) cons
[all...] |
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 4 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 90 SparseMatrix<double> SM_a(2,3);
91 SparseMatrix<double> SM_b(3,2);
104 SparseMatrix<double,RowMajor> SM_row_a(SM_a), SM_row_b(SM_b);
125 SparseMatrix<double> SM_ab(1,20);
129 SparseMatrix<double,RowMajor> SM_ab2(10,3);
|
| /external/eigen/test/ |
| sparse_solvers.cpp | 15 SparseMatrix<Scalar>& sparseMat)
48 SparseMatrix<Scalar> m2(rows, cols);
63 SparseMatrix<Scalar> cm2(m2);
80 SparseMatrix<Scalar> matB(rows, rows);
|
| sparse_permutations.cpp | 20 typedef SparseMatrix<Scalar, OtherStorage, Index> OtherSparseMatrixType;
174 CALL_SUBTEST(( sparse_permutations<ColMajor>(SparseMatrix<Scalar, ColMajor>(size,size)) ));
175 CALL_SUBTEST(( sparse_permutations<ColMajor>(SparseMatrix<Scalar, RowMajor>(size,size)) ));
176 CALL_SUBTEST(( sparse_permutations<RowMajor>(SparseMatrix<Scalar, ColMajor>(size,size)) ));
177 CALL_SUBTEST(( sparse_permutations<RowMajor>(SparseMatrix<Scalar, RowMajor>(size,size)) ));
|
| /external/eigen/bench/ |
| sparse_setter.cpp | 197 SparseMatrix<Scalar> mat(SIZE,SIZE);
250 SparseMatrix<Scalar> mat = setter;
258 SparseMatrix<Scalar> mat(SIZE,SIZE);
260 RandomSetter<SparseMatrix<Scalar>, StdMapTraits > setter(mat);
274 SparseMatrix<Scalar> mat(SIZE,SIZE);
276 RandomSetter<SparseMatrix<Scalar>, GoogleDenseHashMapTraits> setter(mat);
287 SparseMatrix<Scalar> mat(SIZE,SIZE);
289 RandomSetter<SparseMatrix<Scalar>, GoogleSparseHashMapTraits> setter(mat);
408 SparseMatrix<Scalar> mat(SIZE,SIZE);
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 52 cholmod_sparse viewAsCholmod(SparseMatrix<_Scalar,_Options,_Index>& mat)
54 typedef SparseMatrix<_Scalar,_Options,_Index> MatrixType;
94 const cholmod_sparse viewAsCholmod(const SparseMatrix<_Scalar,_Options,_Index>& mat)
103 cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<SparseMatrix<_Scalar,_Options,_Index>, UpLo>& mat)
305 void _solve(const SparseMatrix<RhsScalar,RhsOptions,RhsIndex> &b, SparseMatrix<DestScalar,DestOptions,DestIndex> &dest) const
347 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
351 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
394 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
398 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 49 typedef SparseMatrix<Scalar,RowMajor> FactorType;
50 typedef SparseMatrix<Scalar,ColMajor> PermutType;
224 SparseMatrix<Scalar,ColMajor, Index> mat1 = amat;
225 SparseMatrix<Scalar,ColMajor, Index> mat2 = amat.transpose();
229 SparseMatrix<Scalar,ColMajor, Index> AtA = mat2 + mat1;
256 SparseMatrix<Scalar,RowMajor, Index> mat;
|
