| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example_details.cpp | 5 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseUtil.h | 71 template<typename _Scalar, int _Flags = 0, typename _Index = int> class SparseMatrix;
118 typedef SparseMatrix<_Scalar, _Flags> type;
135 typedef SparseMatrix<_Scalar, _Flags> type;
146 * \sa SparseMatrix::setFromTriplets()
|
| SparseBlock.h | 104 * specialisation for SparseMatrix
108 class SparseInnerVectorSet<SparseMatrix<_Scalar, _Options, _Index>, Size>
109 : public SparseMatrixBase<SparseInnerVectorSet<SparseMatrix<_Scalar, _Options, _Index>, Size> >
111 typedef SparseMatrix<_Scalar, _Options, _Index> MatrixType;
162 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
|
| SparseProduct.h | 27 SparseMatrix<Scalar,0>,
31 SparseMatrix<Scalar,0>,
|
| SparseSparseProductWithPruning.h | 103 typedef SparseMatrix<typename ResultType::Scalar> SparseTemporaryType;
129 typedef SparseMatrix<typename ResultType::Scalar,ColMajor> ColMajorMatrix;
135 // typedef SparseMatrix<typename ResultType::Scalar> SparseTemporaryType;
|
| SparseMatrixBase.h | 105 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor> PlainObject;
233 "the transpose operation is supposed to be handled in SparseMatrix::operator=");
302 SparseMatrix<Scalar, RowMajorBit> trans = m;
303 s << static_cast<const SparseMatrixBase<SparseMatrix<Scalar, RowMajorBit> >&>(trans);
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 109 CALL_SUBTEST_1( sparse_product(SparseMatrix<double>(8, 8)) );
110 CALL_SUBTEST_2( sparse_product(SparseMatrix<std::complex<double> >(16, 16)) );
111 CALL_SUBTEST_1( sparse_product(SparseMatrix<double>(33, 33)) );
|
| eigen2_sparse_vector.cpp | 19 typedef SparseMatrix<Scalar> SparseMatrixType;
|
| sparse.h | 47 SparseMatrix<Scalar>& sparseMat,
|
| /external/ceres-solver/internal/ceres/ |
| dogleg_strategy.cc | 79 SparseMatrix* jacobian,
168 SparseMatrix* jacobian,
177 void DoglegStrategy::ComputeCauchyPoint(SparseMatrix* jacobian) {
512 SparseMatrix* jacobian,
637 bool DoglegStrategy::ComputeSubspaceModel(SparseMatrix* jacobian) {
|
| trust_region_minimizer_test.cc | 77 virtual SparseMatrix* CreateJacobian() const {
90 SparseMatrix* jacobian) {
227 scoped_ptr<SparseMatrix> jacobian(powell_evaluator.CreateJacobian());
|
| levenberg_marquardt_strategy.cc | 67 SparseMatrix* jacobian,
|
| program_evaluator.h | 55 // SparseMatrix* jacobian,
62 // SparseMatrix* CreateJacobian() const;
73 // SparseMatrix* jacobian);
121 SparseMatrix* CreateJacobian() const {
130 SparseMatrix* jacobian) {
|
| linear_least_squares_problems.cc | 507 bool DumpLinearLeastSquaresProblemToConsole(const SparseMatrix* A,
546 const SparseMatrix* A,
607 const SparseMatrix* A,
|
| block_jacobian_writer.cc | 149 SparseMatrix* BlockJacobianWriter::CreateJacobian() const {
|
| unsymmetric_linear_solver_test.cc | 68 scoped_ptr<SparseMatrix> transformed_A;
|
| /external/eigen/test/ |
| sparse_product.cpp | 198 CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,ColMajor> >()) );
199 CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,RowMajor> >()) );
200 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, ColMajor > >()) );
201 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, RowMajor > >()) );
202 CALL_SUBTEST_4( (sparse_product_regression_test<SparseMatrix<double,RowMajor>, Matrix<double, Dynamic, Dynamic, RowMajor> >()) );
|
| sparse_basic.cpp | 43 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value)
388 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(8, 8)) ));
389 CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, ColMajor>(s, s)) ));
390 CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, RowMajor>(s, s)) ));
391 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(s, s)) ));
392 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,ColMajor,long int>(s, s)) ));
393 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,RowMajor,long int>(s, s)) ));
|
| sparse.h | 59 SparseMatrix<Scalar,Opt2,Index>& sparseMat,
64 enum { IsRowMajor = SparseMatrix<Scalar,Opt2,Index>::IsRowMajor };
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 21 typedef SparseMatrix<Scalar,RowMajor> FactorType;
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MatrixMarketIterator.h | 46 typedef SparseMatrix<Scalar,ColMajor> MatrixType;
|
| /external/eigen/bench/ |
| sparse_trisolver.cpp | 37 typedef SparseMatrix<Scalar,UpperTriangular> EigenSparseTriMatrix;
38 typedef SparseMatrix<Scalar,RowMajorBit|UpperTriangular> EigenSparseTriMatrixRow;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 70 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
84 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType;
220 void _solve_sparse(const Rhs& b, SparseMatrix<DestScalar,DestOptions,DestIndex> &dest) const
316 typedef SparseMatrix<Scalar, ColMajor, Index> CholMatrixType;
329 typedef SparseMatrix<Scalar, ColMajor, Index> CholMatrixType;
355 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
371 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType;
443 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
459 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType;
541 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IterativeSolverBase.h | 198 void _solve_sparse(const Rhs& b, SparseMatrix<DestScalar,DestOptions,DestIndex> &dest) const
|
| /external/eigen/Eigen/src/misc/ |
| SparseSolve.h | 24 typedef SparseMatrix<typename Rhs::Scalar, Rhs::Options, typename Rhs::Index> ReturnType;
|
