HomeSort by relevance Sort by last modified time
    Searched refs:maxCoeff (Results 1 - 25 of 48) sorted by null

1 2

  /external/eigen/doc/snippets/
PartialRedux_maxCoeff.cpp 3 cout << "Here is the maximum of each column:" << endl << m.colwise().maxCoeff() << endl;
MatrixBase_colwise.cpp 5 << endl << m.cwiseAbs().colwise().maxCoeff() << endl;
MatrixBase_rowwise.cpp 5 << endl << m.cwiseAbs().rowwise().maxCoeff() << endl;
tut_arithmetic_redux_minmax.cpp 9 int maxOfV = v.maxCoeff(&i);
  /external/eigen/doc/examples/
Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp 12 << mat.colwise().maxCoeff() << std::endl;
Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp 12 << mat.rowwise().maxCoeff() << std::endl;
Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp 13 float maxNorm = mat.colwise().sum().maxCoeff(&maxIndex);
Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp 16 float max = m.maxCoeff(&maxRow, &maxCol);
tut_arithmetic_redux_basic.cpp 14 cout << "Here is mat.maxCoeff(): " << mat.maxCoeff() << endl;
  /external/eigen/test/eigen2/
eigen2_visitor.cpp 48 eigen_maxc = m.maxCoeff(&eigen_maxrow,&eigen_maxcol);
56 VERIFY_IS_APPROX(maxc, m.maxCoeff());
91 eigen_maxc = v.maxCoeff(&eigen_maxidx);
97 VERIFY_IS_APPROX(maxc, v.maxCoeff());
product.h 17 return !((m1-m2).cwise().abs2().maxCoeff() < epsilon * epsilon
18 * std::max(m1.cwise().abs2().maxCoeff(), m2.cwise().abs2().maxCoeff()));
eigen2_array.cpp 87 Scalar mid = (m1.cwise().abs().minCoeff() + m1.cwise().abs().maxCoeff())/Scalar(2);
111 VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwise().abs().maxCoeff());
  /external/eigen/test/
visitor.cpp 49 eigen_maxc = m.maxCoeff(&eigen_maxrow,&eigen_maxcol);
57 VERIFY_IS_APPROX(maxc, m.maxCoeff());
93 eigen_maxc = v.maxCoeff(&eigen_maxidx);
99 VERIFY_IS_APPROX(maxc, v.maxCoeff());
array_for_matrix.cpp 45 VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum().sum() - m1.sum(), m1.cwiseAbs().maxCoeff());
46 VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum().sum() - m1.sum(), m1.cwiseAbs().maxCoeff());
47 VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum() + m2.colwise().sum() - (m1+m2).colwise().sum(), (m1+m2).cwiseAbs().maxCoeff());
48 VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum() - m2.rowwise().sum() - (m1-m2).rowwise().sum(), (m1-m2).cwiseAbs().maxCoeff());
110 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2);
138 VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwiseAbs().maxCoeff());
155 Scalar maxM1 = m1.maxCoeff();
redux.cpp 44 VERIFY_IS_APPROX(m1.real().maxCoeff(), internal::real(maxc));
55 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().maxCoeff(), m1.block(r0,c0,r1,c1).real().eval().maxCoeff());
86 VERIFY_IS_APPROX(maxc, v.real().head(i).maxCoeff());
103 VERIFY_IS_APPROX(maxc, v.real().tail(size-i).maxCoeff());
120 VERIFY_IS_APPROX(maxc, v.real().segment(i, size-2*i).maxCoeff());
128 VERIFY_RAISES_ASSERT(v.head(0).maxCoeff());
product.h 16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon
17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff()));
geo_alignedbox.cpp 107 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() );
134 VERIFY_IS_APPROX(sides[1], box.sizes().maxCoeff() );
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunctionAtomic.h 100 m_mu = e.cwiseAbs().maxCoeff();
109 const RealScalar F_norm = F.cwiseAbs().rowwise().sum().maxCoeff();
110 const RealScalar Fincr_norm = Fincr.cwiseAbs().rowwise().sum().maxCoeff();
122 const RealScalar P_norm = P.cwiseAbs().rowwise().sum().maxCoeff();
  /external/eigen/Eigen/src/Eigenvalues/
MatrixBaseEigenvalues.h 126 // then we don't need to compute a maxCoeff() here, comparing the 1st and last ones is enough.
131 .maxCoeff()
154 return eigenvalues().cwiseAbs().maxCoeff();
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
Scaling.h 129 EpsRow = DrRes.maxCoeff();
131 EpsCol = DcRes.maxCoeff();
  /external/eigen/unsupported/test/
polynomialsolver.cpp 132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),
144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), internal::abs(r), psPrec ) ); }
156 VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); }
polynomialutils.cpp 78 _Scalar Max = roots.array().abs().maxCoeff();
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR_MKL.h 72 m_maxpivot=m_qr.diagonal().cwiseAbs().maxCoeff(); \
  /external/eigen/Eigen/src/Core/
Visitor.h 73 * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux()
140 * \sa DenseBase::maxCoeff(Index*, Index*)
170 * \sa DenseBase::minCoeff(Index*), DenseBase::maxCoeff(Index*,Index*), DenseBase::visitor(), DenseBase::minCoeff()
187 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::minCoeff()
204 * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::maxCoeff()
209 DenseBase<Derived>::maxCoeff(IndexType* row, IndexType* col) const
221 * \sa DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::maxCoeff()
226 DenseBase<Derived>::maxCoeff(IndexType* index) const
  /external/eigen/blas/
level1_impl.h 60 if(*incx==1) vector(x,*n).cwiseAbs().maxCoeff(&ret);
61 else vector(x,*n,std::abs(*incx)).cwiseAbs().maxCoeff(&ret);

Completed in 1409 milliseconds

1 2