Searched refs:diagonal (Results 1 - 25 of 89) sorted by relevance

1234

/external/eigen/test/
H A Ddiagonal.cpp12 template<typename MatrixType> void diagonal(const MatrixType& m) function
25 //check diagonal()
26 VERIFY_IS_APPROX(m1.diagonal(), m1.transpose().diagonal());
27 m2.diagonal() = 2 * m1.diagonal();
28 m2.diagonal()[0] *= 3;
37 // check sub/super diagonal
40 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N
[all...]
H A Dbandmatrix.cpp28 m.diagonal().setConstant(123);
29 dm1.diagonal().setConstant(123);
32 m.diagonal(i).setConstant(static_cast<RealScalar>(i));
33 dm1.diagonal(i).setConstant(static_cast<RealScalar>(i));
37 m.diagonal(-i).setConstant(-static_cast<RealScalar>(i));
38 dm1.diagonal(-i).setConstant(-static_cast<RealScalar>(i));
H A Ddiagonalmatrices.cpp47 VERIFY_IS_APPROX(ldm1.diagonal(), ldm3.diagonal());
49 VERIFY_IS_APPROX(ldm1.diagonal(), ldm4.diagonal());
59 VERIFY_IS_APPROX( ((ldm1 * m1)(i,j)) , ldm1.diagonal()(i) * m1(i,j) );
60 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) );
61 VERIFY_IS_APPROX( ((m1 * rdm1)(i,j)) , rdm1.diagonal()(j) * m1(i,j) );
90 VERIFY_IS_APPROX(LeftDiagonalMatrix(ldm1*s1).diagonal(), ldm1.diagonal() * s1);
91 VERIFY_IS_APPROX(LeftDiagonalMatrix(s1*ldm1).diagonal(), s
[all...]
H A Dnesting_ops.cpp42 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().sum(), (m.transpose() * m).diagonal().sum() );
43 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal().array().abs().sum() );
H A Dselfadjoint.cpp28 m1.diagonal() = m1.diagonal().real().template cast<Scalar>();
H A Deigensolver_selfadjoint.cpp149 VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.matrixT().diagonal());
150 VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.matrixT().template diagonal<-1>());
156 VERIFY_IS_APPROX(tridiag.diagonal(), T.diagonal());
157 VERIFY_IS_APPROX(tridiag.subDiagonal(), T.template diagonal<1>());
165 eiSymmTridiag.computeFromTridiagonal(tridiag.matrixT().diagonal(), tridiag.matrixT().diagonal(-1), ComputeEigenvectors);
H A Dtriangular.cpp102 // check solve with unit diagonal
130 VERIFY_IS_APPROX(m1.template selfadjointView<Upper>().diagonal(), m1.diagonal());
194 VERIFY(m2.diagonal().isMuchSmallerThan(RealScalar(1)));
197 m2.diagonal().array() -= Scalar(1);
198 VERIFY(m2.diagonal().isMuchSmallerThan(RealScalar(1)));
204 VERIFY(m2.diagonal().isMuchSmallerThan(RealScalar(1)));
207 m2.diagonal().array() -= Scalar(1);
208 VERIFY(m2.diagonal().isMuchSmallerThan(RealScalar(1)));
H A Dmiscmatrices.cpp34 square.diagonal() = VectorType::Ones(rows);
/external/eigen/doc/snippets/
H A DMatrixBase_diagonal_int.cpp3 cout << "Here are the coefficients on the 1st super-diagonal and 2nd sub-diagonal of m:" << endl
4 << m.diagonal(1).transpose() << endl
5 << m.diagonal(-2).transpose() << endl;
H A DMatrixBase_diagonal_template_int.cpp3 cout << "Here are the coefficients on the 1st super-diagonal and 2nd sub-diagonal of m:" << endl
4 << m.diagonal<1>().transpose() << endl
5 << m.diagonal<-2>().transpose() << endl;
H A DMatrixBase_diagonal.cpp3 cout << "Here are the coefficients on the main diagonal of m:" << endl
4 << m.diagonal() << endl;
H A DTridiagonalization_diagonal.cpp10 VectorXd diag = triOfA.diagonal();
11 cout << "The diagonal is:" << endl << diag << endl;
/external/eigen/failtest/
H A Dconst_qualified_diagonal_method_retval.cpp12 Diagonal<Matrix3d> b(m.diagonal());
/external/eigen/Eigen/src/Core/
H A DDiagonalMatrix.h49 inline const DiagonalVectorType& diagonal() const { return derived().diagonal(); } function in class:Eigen::DiagonalBase
51 inline DiagonalVectorType& diagonal() { return derived().diagonal(); } function in class:Eigen::DiagonalBase
54 inline Index rows() const { return diagonal().size(); }
56 inline Index cols() const { return diagonal().size(); }
71 return InverseReturnType(diagonal().cwiseInverse());
78 return DiagonalWrapper<const EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(DiagonalVectorType,Scalar,product) >(diagonal() * scalar);
84 return DiagonalWrapper<const EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(Scalar,DiagonalVectorType,product) >(scalar * other.diagonal());
93 * \brief Represents a diagonal matri
136 inline const DiagonalVectorType& diagonal() const { return m_diagonal; } function in class:Eigen::DiagonalMatrix
139 inline DiagonalVectorType& diagonal() { return m_diagonal; } function in class:Eigen::DiagonalMatrix
260 const DiagonalVectorType& diagonal() const { return m_diagonal; } function in class:Eigen::DiagonalWrapper
[all...]
H A DBandMatrix.h83 /** \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 DDiagonal.h19 * \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
188 MatrixBase<Derived>::diagonal() function in class:Eigen::MatrixBase
196 MatrixBase<Derived>::diagonal() const function in class:Eigen::MatrixBase
214 MatrixBase<Derived>::diagonal(Index index) function in class:Eigen::MatrixBase
222 MatrixBase<Derived>::diagonal(Index index) const function in class:Eigen::MatrixBase
241 MatrixBase<Derived>::diagonal() function in class:Eigen::MatrixBase
250 MatrixBase<Derived>::diagonal() const function in class:Eigen::MatrixBase
[all...]
/external/eigen/doc/
H A Dtutorial.cpp15 m3.diagonal().setOnes();
33 m4.diagonal().block(1,2).setOnes();
34 std::cout << "*** Step 5 ***\nm4.diagonal():\n" << m4.diagonal() << std::endl;
35 std::cout << "m4.diagonal().start(3)\n" << m4.diagonal().start(3) << std::endl;
/external/eigen/Eigen/src/Eigenvalues/
H A DTridiagonalization.h46 * main diagonal and the first diagonal below and above it. The Hessenberg
199 * - the diagonal and lower sub-diagonal represent the real tridiagonal
259 * returned by diagonal() and subDiagonal() instead of creating a new
263 * matrixQ(), packedMatrix(), diagonal(), subDiagonal()
271 /** \brief Returns the diagonal of the tridiagonal matrix T in the decomposition.
273 * \returns expression representing the diagonal of T
284 DiagonalReturnType diagonal() const;
294 * \sa diagonal() fo
307 Tridiagonalization<MatrixType>::diagonal() const function in class:Eigen::Tridiagonalization
[all...]
/external/eigen/Eigen/src/SVD/
H A DUpperBidiagonalization.h73 return HouseholderUSequenceType(m_householder, m_householder.diagonal().conjugate());
79 return HouseholderVSequenceType(m_householder.conjugate(), m_householder.const_derived().template diagonal<1>())
94 typename MatrixType::RealScalar *diagonal,
118 .makeHouseholderInPlace(mat.coeffRef(k,k), diagonal[k]);
153 typename MatrixType::RealScalar *diagonal,
188 v_k.makeHouseholderInPlace(tau_v, diagonal[k]);
322 // where A11 is a bs x bs diagonal block,
337 &(bidiagonal.template diagonal<0>().coeffRef(k)),
338 &(bidiagonal.template diagonal<1>().coeffRef(k)),
346 &(bidiagonal.template diagonal<
93 upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixType::RealScalar *diagonal, typename MatrixType::RealScalar *upper_diagonal, typename MatrixType::Scalar* tempData = 0) argument
152 upperbidiagonalization_blocked_helper(MatrixType& A, typename MatrixType::RealScalar *diagonal, typename MatrixType::RealScalar *upper_diagonal, Index bs, Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, traits<MatrixType>::Flags & RowMajorBit> > X, Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, traits<MatrixType>::Flags & RowMajorBit> > Y) argument
[all...]
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
H A Dqrsolv.h28 // the diagonal, though the diagonal is restored afterward
31 /* in particular, save the diagonal elements of r in x. */
32 x = s.diagonal();
37 /* eliminate the diagonal matrix d using a givens rotation. */
41 /* diagonal element using p from the qr factorization. */
57 /* compute the modified diagonal element of r and */
82 sdiag = s.diagonal();
83 s.diagonal() = x;
/external/eigen/Eigen/src/SparseCore/
H A DSparseAssign.h192 Index size = src.diagonal().size();
197 Map<ArrayXS>(dst.valuePtr(), size) = src.diagonal();
203 dst.diagonal() = src.diagonal();
207 { dst.diagonal() += src.diagonal(); }
210 { dst.diagonal() -= src.diagonal(); }
H A DSparseDiagonalProduct.h15 // The product of a diagonal matrix with a sparse matrix can be easily
45 explicit product_evaluator(const XprType& xpr) : Base(xpr.rhs(), xpr.lhs().diagonal()) {}
56 explicit product_evaluator(const XprType& xpr) : Base(xpr.lhs(), xpr.rhs().diagonal().transpose()) {}
/external/eigen/bench/
H A Deig33.cpp94 scaledMat.diagonal().array() -= shift;
123 // tmp.diagonal().array() -= evals(0);
127 // tmp.diagonal().array() -= evals(1);
131 // tmp.diagonal().array() -= evals(2);
143 tmp.diagonal ().array () -= evals (2);
147 tmp.diagonal ().array () -= evals (1);
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DMatrixUtils.java195 * Returns a diagonal matrix with specified elements.
197 * @param diagonal diagonal elements of the matrix (the array elements
199 * @return diagonal matrix
202 public static RealMatrix createRealDiagonalMatrix(final double[] diagonal) { argument
203 final RealMatrix m = createRealMatrix(diagonal.length, diagonal.length);
204 for (int i = 0; i < diagonal.length; ++i) {
205 m.setEntry(i, i, diagonal[i]);
211 * Returns a diagonal matri
220 createFieldDiagonalMatrix(final T[] diagonal) argument
[all...]
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
H A DLMqrsolv.h40 // the diagonal, though the diagonal is restored afterward
43 /* in particular, save the diagonal elements of r in x. */
44 x = s.diagonal();
49 /* eliminate the diagonal matrix d using a givens rotation. */
53 /* diagonal element using p from the qr factorization. */
69 /* compute the modified diagonal element of r and */
94 sdiag = s.diagonal();
95 s.diagonal() = x;
120 // the diagonal, thoug
[all...]

Completed in 449 milliseconds

1234