| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector.h | 25 IsLower = ((Mode&Lower)==Lower),
93 IsLower = ((Mode&Lower)==Lower),
204 typedef TriangularProduct<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),true,Transpose<const Rhs>,false,Transpose<const Lhs>,true> TriangularProductTranspose;
|
| SelfadjointMatrixVector.h | 51 IsLower = UpLo == Lower ? 1 : 0,
185 LhsUpLo = LhsMode&(Upper|Lower)
265 RhsUpLo = RhsMode&(Upper|Lower)
274 SelfadjointProductMatrix<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
|
| SelfadjointMatrixVector_MKL.h | 86 IsLower = UpLo == Lower ? 1 : 0 \
|
| TriangularSolverMatrix.h | 29 (Mode&UnitDiag) | ((Mode&Upper) ? Lower : Upper),
61 IsLower = (Mode&Lower) == Lower
210 IsLower = (Mode&Lower) == Lower
|
| /external/eigen/test/ |
| sparse_product.cpp | 206 VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b, refX=refS*b);
207 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b);
211 VERIFY_IS_APPROX(mSres = mLo.template selfadjointView<Lower>()*mS,
212 refX = refLo.template selfadjointView<Lower>()*refS);
214 VERIFY_IS_APPROX(mSres = mS * mLo.template selfadjointView<Lower>(),
215 refX = refS * refLo.template selfadjointView<Lower>());
|
| bandmatrix.cpp | 54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
|
| nomalloc.cpp | 90 m2.template selfadjointView<Lower>().rankUpdate(m1.col(0),-1);
91 m2.template selfadjointView<Lower>().rankUpdate(m1.row(0),-1);
95 // m1.template selfadjointView<Lower>().rankUpdate(m2);
97 // m1 += m1.template selfadjointView<Lower>() * m2;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteCholesky.h | 29 template <typename Scalar, int _UpLo = Lower, typename _OrderingType = NaturalOrdering<int> >
116 SparseMatrix<Scalar,ColMajor> m_L; // The lower part stored in CSC
142 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>().twistedBy(m_perm);
144 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>();
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored
|
| /external/eigen/bench/spbench/ |
| test_sparseLU.cpp | 50 if (sym != 0) { // symmetric matrices, only the lower part is stored
53 A = temp.selfadjointView<Lower>();
|
| /external/llvm/lib/Target/MSP430/ |
| MSP430AsmPrinter.cpp | 154 MCInstLowering.Lower(MI, TmpInst);
|
| MSP430MCInstLower.cpp | 10 // This file contains code to lower MSP430 MachineInstrs to their corresponding
113 void MSP430MCInstLower::Lower(const MachineInstr *MI, MCInst &OutMI) const {
|
| /external/llvm/lib/Target/XCore/ |
| XCoreMCInstLower.cpp | 11 /// \brief This file contains code to lower XCore MachineInstrs to their
107 void XCoreMCInstLower::Lower(const MachineInstr *MI, MCInst &OutMI) const {
|
| /external/chromium_org/v8/src/compiler/ |
| js-generic-lowering.cc | 64 Lower##x(node); \
78 void JSGenericLowering::Lower##op(Node* node) { \
97 void JSGenericLowering::Lower##op(Node* node) { \
112 void JSGenericLowering::Lower##op(Node* node) { \
127 void JSGenericLowering::Lower##op(Node* node) { UNIMPLEMENTED(); }
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 32 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
37 * is lower triangular with a unit diagonal and D is a diagonal matrix.
126 /** \returns a view of the lower triangular matrix L */
241 * The strict upper part is used during the decomposition, the strict lower
256 template<> struct ldlt_inplace<Lower>
288 // the lower triangular part
393 return ldlt_inplace<Lower>::updateInPlace(mat,tmp,sigma);
403 return ldlt_inplace<Lower>::unblocked(matt, transpositions, temp, sign);
410 return ldlt_inplace<Lower>::update(matt, transpositions, tmp, w.conjugate(), sigma);
414 template<typename MatrixType> struct LDLT_Traits<MatrixType,Lower>
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 193 * - the upper part and lower sub-diagonal represent the Hessenberg matrix H
194 * - the rest of the lower part contains the Householder vectors that, combined with
285 * The result is written in the lower triangular part of \a matA.
359 result.bottomLeftCorner(n-2, n-2).template triangularView<Lower>().setZero();
|
| Tridiagonalization.h | 197 * - the diagonal and lower sub-diagonal represent the real tridiagonal
199 * - the rest of the lower part contains the Householder vectors that,
325 * \param[in,out] matA On input the selfadjoint matrix. Only the \b lower triangular part is referenced.
326 * On output, the strict upper part is left unchanged, and the lower triangular part
331 * and lower sub-diagonal of the matrix \a matA.
367 hCoeffs.tail(n-i-1).noalias() = (matA.bottomRightCorner(remainingSize,remainingSize).template selfadjointView<Lower>()
372 matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
389 * decomposition is to be computed. Only the lower triangular part referenced.
404 * \p extractQ is true, then the orthogonal matrix Q is passed to \p mat. Otherwise the lower
|
| SelfAdjointEigenSolver.h | 51 * Only the \b lower \b triangular \b part of the input matrix is referenced.
141 * be computed. Only the lower triangular part of the matrix is referenced.
165 * be computed. Only the lower triangular part of the matrix is referenced.
412 mat = matrix.template triangularView<Lower>();
415 mat.template triangularView<Lower>() /= scale;
573 scaledMat = scaledMat.template selfadjointView<Lower>();
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 31 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
32 * or Upper. Default is Lower.
244 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::Index> > class SimplicialLLT;
245 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::Index> > class SimplicialLDLT;
246 template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::Index> > class SimplicialCholesky;
258 typedef SparseTriangularView<CholMatrixType, Eigen::Lower> MatrixL;
299 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
300 * or Upper. Default is Lower.
388 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
389 * or Upper. Default is Lower
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 28 enum { SkipFirst = ((Mode&Lower) && !(MatrixType::Flags&RowMajorBit))
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMpar.h | 82 /* step provides a lower bound, parl, for the zero of */
87 s.topLeftCorner(n,n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MatrixMarketIterator.h | 93 m_mat = B.template selfadjointView<Lower>();
|
| /external/eigen/unsupported/test/ |
| forward_adolc.cpp | 141 A.selfadjointView<Lower>().eigenvalues();
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 103 || (mode==Lower && col<=row)
126 * #Lower, #UnitUpper, #UnitLower, #StrictlyUpper, or #StrictlyLower.
127 * This is in fact a bit field; it must have either #Upper or #Lower,
186 TransposeMode = (Mode & Upper ? Lower : 0)
187 | (Mode & Lower ? Upper : 0)
446 eigen_assert( Mode == Upper || Mode == Lower
450 || (Mode == Lower && row >= col)
493 struct triangular_assignment_selector<Derived1, Derived2, Lower, Dynamic, ClearOpposite>
752 * \c #Lower, \c #StrictlyLower, \c #UnitLower.
802 /** \returns true if *this is approximately equal to a lower triangular matrix
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | [all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| string-externalize.js | 70 // Lower-casing an ascii string should produce ascii.
|
