Searched refs:ColMajor (Results 51 - 75 of 113) sorted by last modified time

12345

/external/eigen/Eigen/src/SparseCore/
H A DSparseBlock.h132 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
H A DSparseDenseProduct.h161 int LhsStorageOrder = ((SparseLhsType::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor,
190 struct sparse_time_dense_product_impl<SparseLhsType,DenseRhsType,DenseResType, ColMajor, true>
231 struct sparse_time_dense_product_impl<SparseLhsType,DenseRhsType,DenseResType, ColMajor, false>
H A DSparseMatrix.h34 * is ColMajor or RowMajor. The default is 0 which means column-major.
854 EIGEN_STATIC_ASSERT((Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS);
943 SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,Index> trMat(mat.rows(),mat.cols());
H A DSparseMatrixBase.h108 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor, Index> PlainObject;
H A DSparsePermutation.h26 SrcStorageOrder = MatrixTypeNestedCleaned::Flags&RowMajorBit ? RowMajor : ColMajor,
32 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> >::type ReturnType;
44 SrcStorageOrder = MatrixTypeNestedCleaned::Flags&RowMajorBit ? RowMajor : ColMajor,
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
H A DSparseSelfAdjointView.h129 template<typename DestScalar> void evalTo(DynamicSparseMatrix<DestScalar,ColMajor,Index>& _dest) const
132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
202 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint();
408 SrcOrder = MatrixType::IsRowMajor ? RowMajor : ColMajor,
489 SparseMatrix<DestScalar,(Options&RowMajor)==RowMajor ? ColMajor : RowMajor, DstIndex> tmp;
H A DSparseSparseProductWithPruning.h83 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,ColMajor>
97 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,RowMajor>
103 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> SparseTemporaryType;
124 struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,ColMajor>
129 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixLhs;
130 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixRhs;
H A DSparseUtil.h112 typedef SparseVector<_Scalar, ColMajor, _Index> type;
118 enum { _Options = ((traits<T>::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor };
133 enum { _Options = ((traits<T>::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor };
H A DSparseVector.h340 EIGEN_STATIC_ASSERT((_Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS);
H A DTriangularSolver.h100 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,ColMajor>
132 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,ColMajor>
208 struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
/external/eigen/Eigen/src/SparseLU/
H A DSparseLU.h46 * SparseMatrix<double, ColMajor> A;
47 * SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<Index> > solver;
81 typedef SparseMatrix<Scalar,ColMajor,Index> NCMatrix;
144 SparseLUMatrixUReturnType<SCMatrix,MappedSparseMatrix<Scalar,ColMajor,Index> > matrixU() const
146 return SparseLUMatrixUReturnType<SCMatrix, MappedSparseMatrix<Scalar,ColMajor,Index> >(m_Lstore, m_Ustore);
337 MappedSparseMatrix<Scalar,ColMajor,Index> m_Ustore; // The upper triangular matrix
649 new (&m_Ustore) MappedSparseMatrix<Scalar, ColMajor, Index> ( m, n, m_nnzU, m_glu.xusub.data(), m_glu.usub.data(), m_glu.ucol.data() );
H A DSparseLUImpl.h29 typedef SparseMatrix<Scalar,ColMajor,Index> MatrixType;
/external/eigen/Eigen/src/SparseQR/
H A DSparseQR.h73 typedef SparseMatrix<Scalar,ColMajor,Index> QRMatrixType;
/external/eigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h275 || (Flags&ColMajor)==ColMajor && sluMat.Stype == SLU_NC);
/external/eigen/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h135 typedef SparseMatrix<Scalar,ColMajor,int> UmfpackMatrixType;
/external/eigen/bench/spbench/
H A Dsp_solver.cpp22 SparseMatrix<double, ColMajor> A;
23 typedef SparseMatrix<double, ColMajor>::Index Index;
28 //SparseLU<SparseMatrix<double, ColMajor> > solver;
29 // SuperLU<SparseMatrix<double, ColMajor> > solver;
30 ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver;
49 SparseMatrix<double, ColMajor> temp;
H A Dspbenchsolver.h307 typedef SparseMatrix<Scalar, ColMajor> SpMat;
H A Dtest_sparseLU.cpp21 SparseMatrix<scalar, ColMajor> A;
22 typedef SparseMatrix<scalar, ColMajor>::Index Index;
26 // SparseLU<SparseMatrix<scalar, ColMajor>, AMDOrdering<int> > solver;
28 // SparseLU<SparseMatrix<scalar, ColMajor>, MetisOrdering<int> > solver;
31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver;
51 SparseMatrix<scalar, ColMajor> temp;
/external/eigen/blas/
H A DBandTriangularSolver.h59 struct band_solve_triangular_selector<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ColMajor>
61 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
H A DGeneralRank1Update.h20 struct general_rank1_update<Scalar,Index,ColMajor,ConjLhs,ConjRhs>
38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
H A DPackedSelfadjointProduct.h22 struct selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
H A DPackedTriangularMatrixVector.h19 struct packed_triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor>
H A DPackedTriangularSolverVector.h48 struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor>
81 Conjugate,StorageOrder==RowMajor?ColMajor:RowMajor
H A Dcommon.h96 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> PlainMatrixType;
97 typedef Map<Matrix<Scalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > MatrixType;
102 Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >
105 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
H A Dlevel2_cplx_impl.h30 func[UP] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run);
31 func[LO] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Lower,false,false>::run);
122 func[UP] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run);
123 func[LO] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Lower,false,Conj>::run);
228 func[UP] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run);
229 func[LO] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Lower,false,Conj>::run);
351 internal::general_rank1_update<Scalar,int,ColMajor,false,false>::run(*m, *n, a, *lda, x_cpy, y_cpy, alpha);
388 internal::general_rank1_update<Scalar,int,ColMajor,false,Conj>::run(*m, *n, a, *lda, x_cpy, y_cpy, alpha);

Completed in 128 milliseconds

12345