/external/eigen/lapack/ |
cholesky.cpp | 26 Scalar* a = reinterpret_cast<Scalar*>(pa); 29 if(UPLO(*uplo)==UP) ret = int(internal::llt_inplace<Scalar, Upper>::blocked(A)); 30 else ret = int(internal::llt_inplace<Scalar, Lower>::blocked(A)); 55 Scalar* a = reinterpret_cast<Scalar*>(pa); 56 Scalar* b = reinterpret_cast<Scalar*>(pb);
|
/external/eigen/test/ |
special_numbers.cpp | 12 template<typename Scalar> void special_numbers() 14 typedef Matrix<Scalar, Dynamic,Dynamic> MatType; 18 Scalar nan = std::numeric_limits<Scalar>::quiet_NaN(); 19 Scalar inf = std::numeric_limits<Scalar>::infinity(); 20 Scalar s1 = internal::random<Scalar>();
|
cwiseop.cpp | 26 template<typename Scalar> struct AddIfNull { 27 const Scalar operator() (const Scalar a, const Scalar b) const {return a<=1e-3 ? b : a;} 28 enum { Cost = NumTraits<Scalar>::AddCost }; 32 typename Eigen::internal::enable_if<!NumTraits<typename MatrixType::Scalar>::IsInteger,typename MatrixType::Scalar>::type 35 typedef typename MatrixType::Scalar Scalar; 36 typedef typename NumTraits<Scalar>::Real RealScalar [all...] |
sparse_vector.cpp | 12 template<typename Scalar,typename Index> void sparse_vector(int rows, int cols) 16 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix; 17 typedef Matrix<Scalar,Dynamic,1> DenseVector; 18 typedef SparseVector<Scalar,0,Index> SparseVectorType; 19 typedef SparseMatrix<Scalar,0,Index> SparseMatrixType; 20 Scalar eps = 1e-6; 30 initSparse<Scalar>(densityVec, refV1, v1, &zerocoords, &nonzerocoords); 31 initSparse<Scalar>(densityMat, refM1, m1); 33 initSparse<Scalar>(densityVec, refV2, v2); 34 initSparse<Scalar>(densityVec, refV3, v3) [all...] |
/external/eigen/Eigen/src/SparseCore/ |
SparseRedux.h | 16 typename internal::traits<Derived>::Scalar 20 Scalar res(0); 28 typename internal::traits<SparseMatrix<_Scalar,_Options,_Index> >::Scalar 32 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum(); 36 typename internal::traits<SparseVector<_Scalar,_Options, _Index> >::Scalar 40 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum();
|
/external/eigen/test/eigen2/ |
eigen2_inverse.cpp | 22 typedef typename MatrixType::Scalar Scalar; 23 typedef typename NumTraits<Scalar>::Real RealScalar; 24 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> VectorType; 42 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
|
eigen2_prec_inverse_4x4.cpp | 31 typedef typename MatrixType::Scalar Scalar; 42 double error = double( (m*inv-MatrixType::Identity()).norm() / epsilon<Scalar>() ); 50 typedef typename MatrixType::Scalar Scalar; 60 } while(absdet < 10 * epsilon<Scalar>()); 62 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() ); 66 std::cerr << "inverse_general_4x4, Scalar = " << type_name<Scalar>() << std::endl; 70 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25)) [all...] |
eigen2_visitor.cpp | 14 typedef typename MatrixType::Scalar Scalar; 25 m(i) = ei_random<Scalar>(); 27 Scalar minc = Scalar(1000), maxc = Scalar(-1000); 46 Scalar eigen_minc, eigen_maxc; 61 typedef typename VectorType::Scalar Scalar; 71 v(i) = ei_random<Scalar>(); [all...] |
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
r1mpyq.h | 7 template <typename Scalar> 8 void r1mpyq(DenseIndex m, DenseIndex n, Scalar *a, const std::vector<JacobiRotation<Scalar> > &v_givens, const std::vector<JacobiRotation<Scalar> > &w_givens) 15 Scalar temp = v_givens[j].c() * a[i+m*j] - v_givens[j].s() * a[i+m*(n-1)]; 22 Scalar temp = w_givens[j].c() * a[i+m*j] + w_givens[j].s() * a[i+m*(n-1)];
|
LevenbergMarquardt.h | 45 template<typename FunctorType, typename Scalar=double> 56 : factor(Scalar(100.)) 58 , ftol(std::sqrt(NumTraits<Scalar>::epsilon())) 59 , xtol(std::sqrt(NumTraits<Scalar>::epsilon())) 60 , gtol(Scalar(0.)) 61 , epsfcn(Scalar(0.)) {} 62 Scalar factor; 64 Scalar ftol; 65 Scalar xtol; 66 Scalar gtol [all...] |
qrsolv.h | 6 template <typename Scalar> 8 Matrix< Scalar, Dynamic, Dynamic > &s, 11 const Matrix< Scalar, Dynamic, 1 > &diag, 12 const Matrix< Scalar, Dynamic, 1 > &qtb, 13 Matrix< Scalar, Dynamic, 1 > &x, 14 Matrix< Scalar, Dynamic, 1 > &sdiag) 21 Scalar temp; 23 Matrix< Scalar, Dynamic, 1 > wa(n); 24 JacobiRotation<Scalar> givens; 51 Scalar qtbpj = 0. [all...] |
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
MarketIO.h | 20 template <typename Scalar> 21 inline bool GetMarketLine (std::stringstream& line, int& M, int& N, int& i, int& j, Scalar& value) 33 template <typename Scalar> 34 inline bool GetMarketLine (std::stringstream& line, int& M, int& N, int& i, int& j, std::complex<Scalar>& value) 36 Scalar valR, valI; 42 value = std::complex<Scalar>(valR, valI); 65 template<typename Scalar> 69 if(internal::is_same<Scalar, std::complex<float> >::value || internal::is_same<Scalar, std::complex<double> >::value) 84 template<typename Scalar> [all...] |
/external/eigen/Eigen/src/Core/products/ |
SelfadjointRank2Update.h | 21 template<typename Scalar, typename Index, typename UType, typename VType, int UpLo> 24 template<typename Scalar, typename Index, typename UType, typename VType> 25 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Lower> 27 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) 32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+i, size-i) += 39 template<typename Scalar, typename Index, typename UType, typename VType> 40 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Upper> 42 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha [all...] |
SelfadjointMatrixVector_MKL.h | 46 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> 48 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn> {}; 50 #define EIGEN_MKL_SYMV_SPECIALIZE(Scalar) \ 52 struct selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Specialized> { \ 54 Index size, const Scalar* lhs, Index lhsStride, \ 55 const Scalar* _rhs, Index rhsIncr, Scalar* res, Scalar alpha) { \ 60 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn>::run( \ 63 selfadjoint_matrix_vector_product_symv<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs>::run( [all...] |
/external/eigen/bench/ |
benchCholesky.cpp | 26 typedef float Scalar; 43 typedef typename MatrixType::Scalar Scalar; 44 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType; 51 Scalar acc = 0; 129 benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i])); 131 benchLLT(Matrix<Scalar,2,2>()); 132 benchLLT(Matrix<Scalar,3,3>()); 133 benchLLT(Matrix<Scalar,4,4>()); 134 benchLLT(Matrix<Scalar,5,5>()) [all...] |
bench_norm.cpp | 9 EIGEN_DONT_INLINE typename T::Scalar sqsumNorm(const T& v) 15 EIGEN_DONT_INLINE typename T::Scalar hypotNorm(const T& v) 21 EIGEN_DONT_INLINE typename T::Scalar blueNorm(const T& v) 27 EIGEN_DONT_INLINE typename T::Scalar lapackNorm(T& v) 29 typedef typename T::Scalar Scalar; 31 Scalar scale = 0; 32 Scalar ssq = 1; 35 Scalar ax = internal::abs(v.coeff(i)); 42 ssq = Scalar(1) + ssq * internal::abs2(scale/ax) [all...] |
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
LMpar.h | 24 typename VectorType::Scalar m_delta, 25 typename VectorType::Scalar &par, 32 typedef typename QRSolver::Scalar Scalar; 37 Scalar fp; 38 Scalar parc, parl; 40 Scalar temp, paru; 41 Scalar gnorm; 42 Scalar dxnorm; 50 const Scalar dwarf = (std::numeric_limits<Scalar>::min)() [all...] |
LMqrsolv.h | 22 template <typename Scalar,int Rows, int Cols, typename Index> 24 Matrix<Scalar,Rows,Cols> &s, 26 const Matrix<Scalar,Dynamic,1> &diag, 27 const Matrix<Scalar,Dynamic,1> &qtb, 28 Matrix<Scalar,Dynamic,1> &x, 29 Matrix<Scalar,Dynamic,1> &sdiag) 34 Scalar temp; 36 Matrix<Scalar,Dynamic,1> wa(n); 37 JacobiRotation<Scalar> givens; 64 Scalar qtbpj = 0. [all...] |
/external/eigen/Eigen/src/Geometry/ |
Transform.h | 73 * \tparam _Scalar the scalar type, i.e., the type of the coefficients 187 /** the scalar type of the coefficients */ 188 typedef _Scalar Scalar; 191 typedef typename internal::make_proper_matrix_type<Scalar,Rows,HDim,Options>::type MatrixType; 195 typedef Matrix<Scalar,Dim,Dim,Options> LinearMatrixType; 209 typedef Matrix<Scalar,Dim,1> VectorType; 215 typedef Translation<Scalar,Dim> TranslationType; 220 typedef Transform<Scalar,Dim,TransformTimeDiagonalMode> TransformTimeDiagonalReturnType; 248 inline explicit Transform(const UniformScaling<Scalar>& s) 269 EIGEN_STATIC_ASSERT((internal::is_same<Scalar,typename OtherDerived::Scalar>::value) [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
SelfAdjointEigenSolver.h | 80 /** \brief Scalar type for matrices of type \p _MatrixType. */ 81 typedef typename MatrixType::Scalar Scalar; 84 /** \brief Real scalar type for \p _MatrixType. 86 * This is just \c Scalar if #Scalar is real (e.g., \c float or 87 * \c double), and the type of the real part of \c Scalar if #Scalar is 90 typedef typename NumTraits<Scalar>::Real RealScalar; 92 friend struct internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex> [all...] |
RealSchur.h | 65 typedef typename MatrixType::Scalar Scalar; 66 typedef std::complex<typename NumTraits<Scalar>::Real> ComplexScalar; 70 typedef Matrix<Scalar, ColsAtCompileTime, 1, Options & ~RowMajor, MaxColsAtCompileTime, 1> ColumnVectorType; 234 typedef Matrix<Scalar,3,1> Vector3s; 236 Scalar computeNormOfT(); 237 Index findSmallSubdiagEntry(Index iu, const Scalar& norm); 238 void splitOffTwoRows(Index iu, bool computeU, const Scalar& exshift); 239 void computeShift(Index iu, Index iter, Scalar& exshift, Vector3s& shiftInfo); 241 void performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace) [all...] |
/external/eigen/Eigen/src/Core/ |
DenseBase.h | 43 : public internal::special_scalar_op_base<Derived,typename internal::traits<Derived>::Scalar, 44 typename NumTraits<typename internal::traits<Derived>::Scalar>::Real> 50 using internal::special_scalar_op_base<Derived,typename internal::traits<Derived>::Scalar, 51 typename NumTraits<typename internal::traits<Derived>::Scalar>::Real>::operator*; 63 typedef typename internal::traits<Derived>::Scalar Scalar; 64 typedef typename internal::packet_traits<Scalar>::type PacketScalar; 65 typedef typename NumTraits<Scalar>::Real RealScalar; 238 typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,Derived> ConstantReturnType; 240 typedef CwiseNullaryOp<internal::linspaced_op<Scalar,false>,Derived> SequentialLinSpacedReturnType [all...] |
CwiseUnaryView.h | 35 ViewOp(typename traits<MatrixType>::Scalar) 36 >::type Scalar; 47 : int(MatrixTypeInnerStride) * int(sizeof(typename traits<MatrixType>::Scalar) / sizeof(Scalar)), 50 : outer_stride_at_compile_time<MatrixType>::ret * int(sizeof(typename traits<MatrixType>::Scalar) / sizeof(Scalar)) 103 inline Scalar* data() { return &coeffRef(0); } 104 inline const Scalar* data() const { return &coeff(0); } 108 return derived().nestedExpression().innerStride() * sizeof(typename internal::traits<MatrixType>::Scalar) / sizeof(Scalar); [all...] |
/external/eigen/unsupported/Eigen/src/AutoDiff/ |
AutoDiffVector.h | 16 * \brief A scalar type replacement with automatic differentation capability 20 * This class represents a scalar value while tracking its respective derivatives. 27 * AutoDiffScalar can be used as the scalar type of an Eigen::Matrix object. However, 36 //typedef typename internal::traits<ValueType>::Scalar Scalar; 37 typedef typename internal::traits<ValueType>::Scalar BaseScalar; 39 typedef ActiveScalar Scalar; 64 Scalar sum() const { /*std::cerr << "sum \n\n";*/ /*std::cerr << m_jacobian.rowwise().sum() << "\n\n";*/ return Scalar(m_values.sum(), m_jacobian.rowwise().sum()); } 125 typename MakeCwiseBinaryOp<internal::scalar_difference_op<Scalar>,ValueType,OtherValueType>::Type [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
MathFunctions.h | 34 template<typename Scalar, typename OtherScalar> 35 inline bool ei_isMuchSmallerThan(const Scalar& x, const OtherScalar& y, 36 typename NumTraits<Scalar>::Real precision = NumTraits<Scalar>::dummy_precision()) 41 template<typename Scalar> 42 inline bool ei_isApprox(const Scalar& x, const Scalar& y, 43 typename NumTraits<Scalar>::Real precision = NumTraits<Scalar>::dummy_precision()) 48 template<typename Scalar> [all...] |