| /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/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 25 typedef SparseMatrix<Scalar,RowMajor> FactorType;
|
| ConstrainedConjGrad.h | 124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols());
|
| /external/eigen/test/ |
| sparse_basic.cpp | 50 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value)
260 typedef SparseMatrix<bool, SparseMatrixType::Options, typename SparseMatrixType::StorageIndex> SpBool;
652 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(1, 1)) ));
653 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(8, 8)) ));
654 CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, ColMajor>(r, c)) ));
655 CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, RowMajor>(r, c)) ));
656 CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(r, c)) ));
657 CALL_SUBTEST_5(( sparse_basic(SparseMatrix<double,ColMajor,long int>(r, c)) ));
658 CALL_SUBTEST_5(( sparse_basic(SparseMatrix<double,RowMajor,long int>(r, c)) ));
666 CALL_SUBTEST_6(( sparse_basic(SparseMatrix<double,ColMajor,short int>(short(r), short(c))) ))
[all...] |
| sparseqr.cpp | 46 typedef SparseMatrix<Scalar,ColMajor> MatrixType;
|
| sparse.h | 59 SparseMatrix<Scalar,Opt2,StorageIndex>& sparseMat,
64 enum { IsRowMajor = SparseMatrix<Scalar,Opt2,StorageIndex>::IsRowMajor };
|
| sparse_product.cpp | 355 typedef SparseMatrix<Scalar, ColMajor> ColSpMat;
356 typedef SparseMatrix<Scalar, RowMajor> RowSpMat;
377 CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,ColMajor> >()) );
378 CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,RowMajor> >()) );
380 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, ColMajor > >()) );
381 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, RowMajor > >()) );
382 CALL_SUBTEST_3( (sparse_product<SparseMatrix<float,ColMajor,long int> >()) );
383 CALL_SUBTEST_4( (sparse_product_regression_test<SparseMatrix<double,RowMajor>, Matrix<double, Dynamic, Dynamic, RowMajor> >()) );
|
| eigensolver_selfadjoint.cpp | 229 SparseMatrix<double> A(2,2);
231 SelfAdjointEigenSolver<Eigen::SparseMatrix<double> > eig(A);
|
| sparse_vector.cpp | 19 typedef SparseMatrix<Scalar,0,StorageIndex> SparseMatrixType;
|
| sparse_solver.h | 274 typedef SparseMatrix<Scalar,ColMajor, StorageIndex> SpMat;
403 typedef SparseMatrix<Scalar,ColMajor, typename Mat::StorageIndex> SpMat;
536 typedef SparseMatrix<Scalar,ColMajor, typename Mat::StorageIndex> SpMat;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 67 typedef SparseMatrix<Scalar,ColMajor,StorageIndex> CholMatrixType;
279 typedef SparseMatrix<Scalar, ColMajor, StorageIndex> CholMatrixType;
293 typedef SparseMatrix<Scalar, ColMajor, StorageIndex> CholMatrixType;
320 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
339 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType;
411 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
430 typedef SparseMatrix<Scalar,ColMajor,StorageIndex> CholMatrixType;
512 typedef SparseMatrix<Scalar,ColMajor,StorageIndex> CholMatrixType;
|
| /external/eigen/bench/ |
| sparse_trisolver.cpp | 37 typedef SparseMatrix<Scalar,UpperTriangular> EigenSparseTriMatrix;
38 typedef SparseMatrix<Scalar,RowMajorBit|UpperTriangular> EigenSparseTriMatrixRow;
|
| BenchSparseUtil.h | 25 typedef SparseMatrix<Scalar> EigenSparseMatrix;
|
| sparse_cholesky.cpp | 41 // typedef SparseMatrix<Scalar,UpperTriangular> EigenSparseTriMatrix;
42 typedef SparseMatrix<Scalar,SelfAdjoint|LowerTriangular> EigenSparseSelfAdjointMatrix;
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 103 SparseMatrix<Scalar,_Options,Index> &s,
111 typedef SparseMatrix<Scalar,RowMajor,Index> FactorType;
|
| LevenbergMarquardt.h | 75 typedef SparseMatrix<Scalar, ColMajor, Index> JacobianType;
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 41 /** The integer type used to \b store indices within a SparseMatrix.
42 * For a \c SparseMatrix<Scalar,Options,IndexType> it an alias of the third template parameter \c IndexType. */
114 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor, StorageIndex> PlainObject;
255 SparseMatrix<Scalar, RowMajorBit, StorageIndex> trans = m;
256 s << static_cast<const SparseMatrixBase<SparseMatrix<Scalar, RowMajorBit, StorageIndex> >&>(trans);
|
| SparseAssign.h | 103 "the transpose operation is supposed to be handled in SparseMatrix::operator=");
185 static void run(SparseMatrix<Scalar,Options,StorageIndex> &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar> &/*func*/)
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MatrixMarketIterator.h | 47 typedef SparseMatrix<Scalar,ColMajor> MatrixType;
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 145 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
166 typedef SparseMatrix<Scalar> LUMatrixType;
167 typedef SparseMatrix<Scalar,ColMajor,int> UmfpackMatrixType;
239 * \sa SparseMatrix::makeCompressed().
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 305 void SelectSolvers(const SparseMatrix<Scalar>&A, unsigned int sym, Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statFile)
307 typedef SparseMatrix<Scalar, ColMajor> SpMat;
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLUImpl.h | 31 typedef SparseMatrix<Scalar,ColMajor,StorageIndex> MatrixType;
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 61 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
67 * \warning The input sparse matrix A must be in compressed mode (see SparseMatrix::makeCompressed()).
83 typedef SparseMatrix<Scalar,ColMajor,StorageIndex> QRMatrixType;
99 * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()).
110 * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()).
138 * SparseMatrix<double> R = qr.matrixR(); // column-major, not sorted!
139 * SparseMatrix<double,RowMajor> Rr = qr.matrixR(); // row-major, sorted
140 * SparseMatrix<double> Rc = Rr; // column-major, sorted
163 * To get a plain SparseMatrix representation of Q:
165 * SparseMatrix<double> Q
[all...] |
| /external/eigen/Eigen/src/SPQRSupport/ |
| SuiteSparseQRSupport.h | 50 * R is the sparse triangular factor. Use matrixQR() to get it as SparseMatrix.
53 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
69 typedef SparseMatrix<Scalar, ColMajor, StorageIndex> MatrixType;
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 246 typedef SparseMatrix<Scalar, 0, StorageIndex> ReturnType;
|
