/external/eigen/Eigen/src/Core/ |
H A D | BandMatrix.h | 83 /** \returns a vector expression of the main diagonal */ 84 inline Block<CoefficientsType,1,SizeAtCompileTime> diagonal() function in class:Eigen::internal::BandMatrixBase 87 /** \returns a vector expression of the main diagonal (const version) */ 88 inline const Block<const CoefficientsType,1,SizeAtCompileTime> diagonal() const function in class:Eigen::internal::BandMatrixBase 108 /** \returns a vector expression of the \a N -th sub or super diagonal */ 109 template<int N> inline typename DiagonalIntReturnType<N>::Type diagonal() function in class:Eigen::internal::BandMatrixBase 114 /** \returns a vector expression of the \a N -th sub or super diagonal */ 115 template<int N> inline const typename DiagonalIntReturnType<N>::Type diagonal() const function in class:Eigen::internal::BandMatrixBase 120 /** \returns a vector expression of the \a i -th sub or super diagonal */ 121 inline Block<CoefficientsType,1,Dynamic> diagonal(Inde function in class:Eigen::internal::BandMatrixBase 128 inline const Block<const CoefficientsType,1,Dynamic> diagonal(Index i) const function in class:Eigen::internal::BandMatrixBase [all...] |
H A D | Diagonal.h | 19 * \brief Expression of a diagonal/subdiagonal/superdiagonal in a matrix 21 * \param MatrixType the type of the object in which we are taking a sub/main/super diagonal 22 * \param DiagIndex the index of the sub/super diagonal. The default is 0 and it means the main diagonal. 28 * This class represents an expression of the main diagonal, or any sub/super diagonal 29 * of a square matrix. It is the return type of MatrixBase::diagonal() and MatrixBase::diagonal(Index) and most of the 32 * \sa MatrixBase::diagonal(), MatrixBase::diagonal(Inde 168 MatrixBase<Derived>::diagonal() function in class:Eigen::MatrixBase 176 MatrixBase<Derived>::diagonal() const function in class:Eigen::MatrixBase 194 MatrixBase<Derived>::diagonal(Index index) function in class:Eigen::MatrixBase 202 MatrixBase<Derived>::diagonal(Index index) const function in class:Eigen::MatrixBase 221 MatrixBase<Derived>::diagonal() function in class:Eigen::MatrixBase 230 MatrixBase<Derived>::diagonal() const function in class:Eigen::MatrixBase [all...] |
H A D | DiagonalMatrix.h | 48 { other.diagonal() += diagonal(); } 51 { other.diagonal() -= diagonal(); } 53 inline const DiagonalVectorType& diagonal() const { return derived().diagonal(); } function in class:Eigen::DiagonalBase 54 inline DiagonalVectorType& diagonal() { return derived().diagonal(); } function in class:Eigen::DiagonalBase 56 inline Index rows() const { return diagonal().size(); } 57 inline Index cols() const { return diagonal() 154 inline const DiagonalVectorType& diagonal() const { return m_diagonal; } function in class:Eigen::DiagonalMatrix 156 inline DiagonalVectorType& diagonal() { return m_diagonal; } function in class:Eigen::DiagonalMatrix 261 const DiagonalVectorType& diagonal() const { return m_diagonal; } function in class:Eigen::DiagonalWrapper [all...] |
H A D | DiagonalProduct.h | 52 inline DiagonalProduct(const MatrixType& matrix, const DiagonalType& diagonal) argument 53 : m_matrix(matrix), m_diagonal(diagonal) 55 eigen_assert(diagonal.diagonal().size() == (ProductOrder == OnTheLeft ? matrix.rows() : matrix.cols())); 63 return m_diagonal.diagonal().coeff(ProductOrder == OnTheLeft ? row : col) * m_matrix.coeff(row, col); 100 internal::pset1<PacketScalar>(m_diagonal.diagonal().coeff(id))); 111 m_diagonal.diagonal().template packet<DiagonalVectorPacketLoadMode>(id)); 118 /** \returns the diagonal matrix product of \c *this by the diagonal matrix \a diagonal [all...] |
H A D | ProductBase.h | 124 const Diagonal<const FullyLazyCoeffBaseProductType,0> diagonal() const function in class:Eigen::ProductBase 128 const Diagonal<FullyLazyCoeffBaseProductType,Index> diagonal() const function in class:Eigen::ProductBase 131 const Diagonal<FullyLazyCoeffBaseProductType,Dynamic> diagonal(Index index) const function in class:Eigen::ProductBase 132 { return FullyLazyCoeffBaseProductType(m_lhs, m_rhs).diagonal(index); }
|
/external/eigen/Eigen/src/Core/products/ |
H A D | CoeffBasedProduct.h | 203 const Diagonal<const LazyCoeffBasedProductType,0> diagonal() const function in class:Eigen::CoeffBasedProduct 207 const Diagonal<const LazyCoeffBasedProductType,DiagonalIndex> diagonal() const function in class:Eigen::CoeffBasedProduct 210 const Diagonal<const LazyCoeffBasedProductType,Dynamic> diagonal(Index index) const function in class:Eigen::CoeffBasedProduct 211 { return reinterpret_cast<const LazyCoeffBasedProductType&>(*this).diagonal(index); }
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | Tridiagonalization.h | 44 * main diagonal and the first diagonal below and above it. The Hessenberg 197 * - the diagonal and lower sub-diagonal represent the real tridiagonal 257 * returned by diagonal() and subDiagonal() instead of creating a new 261 * matrixQ(), packedMatrix(), diagonal(), subDiagonal() 269 /** \brief Returns the diagonal of the tridiagonal matrix T in the decomposition. 271 * \returns expression representing the diagonal of T 282 DiagonalReturnType diagonal() const; 292 * \sa diagonal() fo 305 Tridiagonalization<MatrixType>::diagonal() const function in class:Eigen::Tridiagonalization [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | AlignedBox.h | 126 /** \returns an expression for the bounding box diagonal vector 127 * if the length of the diagonal is needed: diagonal().norm() 130 inline CwiseBinaryOp< internal::scalar_difference_op<Scalar>, const VectorType, const VectorType> diagonal() const function in class:Eigen::AlignedBox
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseMatrix.h | 625 /** \returns a const expression of the diagonal coefficients */ 626 const Diagonal<const SparseMatrix> diagonal() const { return *this; } function in class:Eigen::SparseMatrix
|
/external/eigen/test/ |
H A D | diagonal.cpp | 12 template<typename MatrixType> void diagonal(const MatrixType& m) function 23 //check diagonal() 24 VERIFY_IS_APPROX(m1.diagonal(), m1.transpose().diagonal()); 25 m2.diagonal() = 2 * m1.diagonal(); 26 m2.diagonal()[0] *= 3; 35 // check sub/super diagonal 38 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N [all...] |
/external/chromium_org/cc/layers/ |
H A D | layer_utils_unittest.cc | 20 float diagonal(float width, float height) { function in namespace:cc::__anon2690 234 float diag = diagonal(bounds.width(), bounds.height());
|
/external/ceres-solver/internal/ceres/ |
H A D | compressed_row_sparse_matrix.cc | 134 CompressedRowSparseMatrix::CompressedRowSparseMatrix(const double* diagonal, argument 136 CHECK_NOTNULL(diagonal); 147 values_[i] = diagonal[i]; 317 const double* diagonal, 340 values[idx_cursor + r] = diagonal[col_cursor + r]; 316 CreateBlockDiagonalMatrix( const double* diagonal, const vector<int>& blocks) argument
|
H A D | levenberg_marquardt_strategy_test.cc | 56 RegularizationCheckingLinearSolver(const int num_cols, const double* diagonal) argument 58 diagonal_(diagonal) { 131 double diagonal[3]; local 132 diagonal[0] = options.min_lm_diagonal; 133 diagonal[1] = 2.0; 134 diagonal[2] = options.max_lm_diagonal; 136 diagonal[i] = sqrt(diagonal[i] / options.initial_radius); 139 RegularizationCheckingLinearSolver linear_solver(3, diagonal);
|
H A D | schur_eliminator_test.cc | 127 void EliminateSolveAndCompare(const VectorRef& diagonal, argument 157 eliminator->Eliminate(A.get(), b.get(), diagonal.data(), &lhs, rhs.data()); 172 diagonal.data(),
|
H A D | symmetric_linear_solver_test.cc | 50 double diagonal[] = { 1.0, 1.0, 1.0 }; local 52 A(TripletSparseMatrix::CreateSparseDiagonalMatrix(diagonal, 3));
|