| /external/eigen/test/eigen2/ |
| 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());
|
| eigen2_lu.cpp | 92 m1 += a * a.adjoint();
|
| /external/eigen/test/ |
| 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());
|
| sparse_solver.h | 145 A = M * M.adjoint();
146 dA = dM * dM.adjoint();
|
| CMakeLists.txt | 127 ei_add_test(adjoint)
|
| lu.cpp | 88 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image);
|
| qr_colpivoting.cpp | 87 m1 += a * a.adjoint();
|
| sparse_basic.cpp | 206 VERIFY_IS_APPROX(SparseMatrixType(m2.adjoint()), refMat2.adjoint());
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 130 v.applyOnTheLeft(i, i + 1, G[i].adjoint());
139 v.applyOnTheLeft(k - 1, k, G[k - 1].adjoint());
140 w.applyOnTheLeft(k - 1, k, G[k - 1].adjoint());
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular.h | 20 * This is more general version of self adjoint product (C += A A^T)
88 // note that the actual rhs is the transpose/adjoint of mat
|
| SelfadjointProduct.h | 14 * This file implements a self adjoint product: C += A A^T updating only
|
| /external/eigen/doc/ |
| AsciiQuickReference.txt | 64 // Views, transpose, etc; all read-write except for .adjoint().
66 R.adjoint() // R'
|
| SparseQuickReference.dox | 127 <td> transposition, adjoint</td>
130 sm2 = sm1.adjoint();
|
| C09_TutorialSparse.dox | 29 <tr><td>\link SparseCholesky_Module SparseCholesky \endlink</td><td>\code#include <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve sparse self-adjoint positive definite problems</td></tr>
30 <tr><td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</td><td>\code#include <Eigen/IterativeLinearSolvers>\endcode</td><td>Iterative solvers to solve large general linear square problems (including self-adjoint positive definite problems)</td></tr>
372 sm1 = sm2.adjoint();
383 dm2 = dm1 * sm1.adjoint();
395 sm3 = 4 * sm1.adjoint() * sm2;
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 300 * of the transposed/adjoint system is computed instead.
303 * adjoint system.
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/transforms/ |
| TransformationMatrix.cpp | 88 // A = ___1__ adjoint A
151 // adjoint( original_matrix, inverse_matrix )
153 // calculate the adjoint of a 4x4 matrix
164 // The matrix B = (b ) is the adjoint of A
167 static void adjoint(const TransformationMatrix::Matrix4& matrix, TransformationMatrix::Matrix4& result) function in namespace:WebCore
216 // Calculate the adjoint matrix
217 adjoint(matrix, result);
227 // Scale the adjoint matrix to get the inverse
[all...] |
| /external/eigen/Eigen/src/Core/ |
| NoAlias.h | 101 * D.noalias() -= 2 * A * B.adjoint();
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 122 tmp.noalias() = essential.adjoint() * bottom;
|
| /external/eigen/Eigen/src/plugins/ |
| CommonCwiseUnaryOps.h | 99 * \sa adjoint() */
|
| /external/eigen/bench/ |
| benchEigenSolver.cpp | 46 SquareMatrixType covMat = a * a.adjoint();
|
| /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...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 371 m_matT.rightCols(m_matT.cols()-il).applyOnTheLeft(il, il+1, rot.adjoint());
379 m_matT.rightCols(m_matT.cols()-i).applyOnTheLeft(i, i+1, rot.adjoint());
|
| /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
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/ |
| mat2.js | 143 mat2.adjoint = function(out, a) {
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LeastSquares.h | 154 covMat += diff * diff.adjoint();
|
