| /external/eigen/test/ |
| qr.cpp | 68 m1 += a * a.adjoint();
|
| qr_colpivoting.cpp | 87 m1 += a * a.adjoint();
|
| qr_fullpivoting.cpp | 66 m1 += a * a.adjoint();
|
| sparse_basic.cpp | 206 VERIFY_IS_APPROX(SparseMatrixType(m2.adjoint()), refMat2.adjoint());
|
| geo_transformations.cpp | 119 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
373 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
377 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
|
| /external/eigen/Eigen/src/Geometry/ |
| Transform.h | [all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 36 * A matrix \f$ A \f$ is selfadjoint if it equals its adjoint. For real
278 return m_eivec * m_eivalues.cwiseSqrt().asDiagonal() * m_eivec.adjoint();
303 return m_eivec * m_eivalues.cwiseInverse().cwiseSqrt().asDiagonal() * m_eivec.adjoint();
|
| RealSchur.h | 324 m_matT.rightCols(size-iu+1).applyOnTheLeft(iu-1, iu, rot.adjoint());
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 212 result = m_U * m_fT * m_U.adjoint();
354 m_T.applyOnTheLeft(index, index+1, rotation.adjoint());
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 275 apply_block_householder_on_the_left(A21_22,A11_21,hCoeffsSegment.adjoint());
|
| /external/eigen/blas/ |
| level2_cplx_impl.h | 264 matrix(a,*m,*n,*lda) += alpha * vector(x_cpy,*m) * vector(y_cpy,*n).adjoint();
|
| level2_impl.h | 250 actual_y[j] += alpha * ( mat_coeffs.col(j).segment(offset,len).adjoint() * vector(actual_x+start,len) ).value();
308 actual_y[j] += alpha * ( mat_coeffs.col(j).segment(offset,len).adjoint() * vector(actual_x+start,len) ).value();
449 matrix(a,*m,*n,*lda) += alpha * vector(x_cpy,*m) * vector(y_cpy,*n).adjoint();
|
| /external/eigen/test/eigen2/ |
| eigen2_geometry.cpp | 73 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
347 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
351 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
|
| eigen2_geometry_with_eigen2_prefix.cpp | 75 m = AngleAxisx(a, v0.normalized()).toRotationMatrix().adjoint();
349 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
353 VERIFY_IS_APPROX(mat_rotation*mat_rotation.adjoint(), Matrix3::Identity());
|
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Matrix3f.java | 1015 * Returns a new matrix representing the adjoint of this matrix.
1017 * @return The adjoint matrix
1019 public Matrix3f adjoint() { method in class:Matrix3f
1020 return adjoint(null);
1024 * Places the adjoint of this matrix in store (creates store if null.)
1030 public Matrix3f adjoint(Matrix3f store) { method in class:Matrix3f
[all...] |
| Matrix4f.java | 1543 public Matrix4f adjoint() { method in class:Matrix4f
1581 public Matrix4f adjoint(Matrix4f store) { method in class:Matrix4f
[all...] |
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/ |
| mat3.js | 202 mat3.adjoint = function(out, a) {
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 98 /** \internal the return type of MatrixBase::adjoint() */
393 const AdjointReturnType adjoint() const { return transpose(); } function in class:Eigen::SparseMatrixBase
|
| SparseSelfAdjointView.h | 72 /** Efficient sparse self-adjoint matrix times dense vector/matrix product */
80 /** Efficient dense vector/matrix times sparse self-adjoint matrix product */
94 * call this function with u.adjoint().
178 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint();
188 * Implementation of sparse self-adjoint time dense matrix
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 263 /** \sa MatrixBase::adjoint() const */
264 inline const TriangularView<const typename MatrixType::AdjointReturnType,TransposeMode> adjoint() const function in class:Eigen::TriangularView
265 { return m_matrix.adjoint(); }
|
| MatrixBase.h | 120 /** \internal the return type of MatrixBase::adjoint() */
210 const AdjointReturnType adjoint() const;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 320 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
333 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
|
| /external/eigen/Eigen/src/Jacobi/ |
| Jacobi.h | 27 * applying its adjoint on the left: \f$ v = J^* v \f$ that translates to the following Eigen code:
29 * v.applyOnTheLeft(J.adjoint());
60 /** Returns the adjoint transformation */
61 JacobiRotation adjoint() const { return JacobiRotation(internal::conj(m_c), -m_s); } function in class:Eigen::JacobiRotation
|
| /external/chromium_org/third_party/WebKit/Source/platform/transforms/ |
| TransformationMatrix.cpp | 87 // A = ___1__ adjoint A
150 // adjoint( original_matrix, inverse_matrix )
152 // calculate the adjoint of a 4x4 matrix
163 // The matrix B = (b ) is the adjoint of A
166 static void adjoint(const TransformationMatrix::Matrix4& matrix, TransformationMatrix::Matrix4& result) function in namespace:WebCore
215 // Calculate the adjoint matrix
216 adjoint(matrix, result);
226 // Scale the adjoint matrix to get the inverse
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| LevenbergMarquardt.h | 244 wa4.applyOnTheLeft(qrfac.householderQ().adjoint());
|
