| /external/eigen/Eigen/src/Core/ |
| PermutationMatrix.h | 43 * \sa class PermutationMatrix, class PermutationWrapper
64 typedef PermutationMatrix<IndicesType::SizeAtCompileTime,IndicesType::MaxSizeAtCompileTime,StorageIndex>
284 struct traits<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex> >
294 /** \class PermutationMatrix
308 class PermutationMatrix : public PermutationBase<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex> >
310 typedef PermutationBase<PermutationMatrix> Base;
311 typedef internal::traits<PermutationMatrix> Traits;
314 typedef const PermutationMatrix& Nested;
321 inline PermutationMatrix()
[all...] |
| Transpositions.h | 121 : traits<PermutationMatrix<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> >
142 * Compared to the class PermutationMatrix, such a sequence of transpositions is what is
154 * \sa class PermutationMatrix
222 : traits<PermutationMatrix<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> >
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Ordering.h | 55 typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> PermutationType;
98 typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> PermutationType;
121 typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> PermutationType;
|
| Amd.h | 94 void minimum_degree_ordering(SparseMatrix<Scalar,ColMajor,StorageIndex>& C, PermutationMatrix<Dynamic,Dynamic,StorageIndex>& perm)
|
| /external/eigen/test/ |
| permutationmatrices.cpp | 21 typedef PermutationMatrix<Rows> LeftPermutationType;
24 typedef PermutationMatrix<Cols> RightPermutationType;
127 typedef PermutationMatrix<Dynamic> Perm;
|
| prec_inverse_4x4.cpp | 20 MatrixType m = PermutationMatrix<4>(indices);
|
| sparse_permutations.cpp | 74 PermutationMatrix<Dynamic> p, p_null;
232 internal::nested_eval<Product<SparseMatrix<double>,PermutationMatrix<Dynamic,Dynamic>,AliasFreeProduct>,1>::type>::value));
235 internal::nested_eval<Product<PermutationMatrix<Dynamic,Dynamic>,SparseMatrix<double>,AliasFreeProduct>,1>::type>::value));
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 25 typedef PermutationMatrix<Dynamic,Dynamic,StorageIndex> PermutationType;
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 25 const PermutationMatrix<Dynamic,Dynamic,PermIndex> &iPerm,
104 const PermutationMatrix<Dynamic,Dynamic> &iPerm,
|
| LevenbergMarquardt.h | 120 typedef PermutationMatrix<Dynamic,Dynamic> PermutationType;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 115 const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& permutationP() const
120 const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& permutationPinv() const
259 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // the permutation
260 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // the inverse permutation
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 197 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // Fill-reducing permutation
198 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // Inverse permutation
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 473 PermutationMatrix<Dynamic,Dynamic,StorageIndex> p_null;
534 PermutationMatrix<Dynamic,Dynamic,StorageIndex> p_null;
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 66 PermutationMatrix<Dynamic,Dynamic,StorageIndex> perm_cpy;
|
| SparseSelfAdjointView.h | 127 SparseSymmetricPermutationProduct<_MatrixTypeNested,Mode> twistedBy(const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& perm) const
141 PermutationMatrix<Dynamic,Dynamic,StorageIndex> pnull;
148 PermutationMatrix<Dynamic,Dynamic,StorageIndex> pnull;
607 typedef PermutationMatrix<Dynamic,Dynamic,StorageIndex> Perm;
|
| SparseMatrixBase.h | 324 SparseSymmetricPermutationProduct<Derived,Upper|Lower> twistedBy(const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& perm) const
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 74 typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationQType;
75 typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationPType;
[all...] |
| PartialPivLU.h | 88 typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationType;
|
| /external/eigen/Eigen/src/QR/ |
| CompleteOrthogonalDecomposition.h | 61 typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime>
|
| ColPivHouseholderQR.h | 64 typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationType;
|
| FullPivHouseholderQR.h | 77 typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationType;
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| SuiteSparseQRSupport.h | 70 typedef Map<PermutationMatrix<Dynamic, Dynamic, StorageIndex> > PermutationType;
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 105 template<int SizeAtCompileTime, int MaxSizeAtCompileTime = SizeAtCompileTime, typename IndexType=int> class PermutationMatrix;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 68 typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationType;
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 91 typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> PermutationType;
|
