HomeSort by relevance Sort by last modified time
    Searched refs:adjoint (Results 51 - 75 of 103) sorted by null

1 23 4 5

  /external/eigen/test/
sparse_product.cpp 137 // test self adjoint products
151 refLo = refUp.adjoint();
152 mLo = mUp.adjoint();
162 VERIFY_IS_APPROX(refS.adjoint(), refS);
163 VERIFY_IS_APPROX(mS.adjoint(), mS);
triangular.cpp 73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps));
83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), largerEps));
product.h 137 VERIFY_IS_APPROX(res.col(r).noalias() = square.adjoint() * square.col(r), (square.adjoint() * square.col(r)).eval());
product_trsolve.cpp 47 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Lower>(), cmRhs);
51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs);
sparse_solvers.cpp 19 refMat = refMat * refMat.adjoint();
23 refMat += aux * aux.adjoint();
eigensolver_complex.cpp 49 MatrixType symmA = a.adjoint() * a;
sparse_solver.h 145 A = M * M.adjoint();
146 dA = dM * dM.adjoint();
lu.cpp 88 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image);
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 134 m_adjoint = matrix.adjoint();
136 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
223 m_adjoint = matrix.adjoint();
226 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
318 m_adjoint = matrix.adjoint();
321 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
379 if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint());
    [all...]
  /external/eigen/Eigen/src/Cholesky/
LLT.h 283 if (k>0 && rs>0) A21.noalias() -= A20 * A10.adjoint();
316 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21);
358 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
367 static inline MatrixL getL(const MatrixType& m) { return m.adjoint(); }
463 return matrixL() * matrixL().adjoint().toDenseMatrix();
LDLT.h 322 temp.head(k) = mat.diagonal().head(k).asDiagonal() * A10.adjoint();
412 static inline MatrixU getU(const MatrixType& m) { return m.adjoint(); }
419 static inline MatrixL getL(const MatrixType& m) { return m.adjoint(); }
  /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/
mat2.js 143 mat2.adjoint = function(out, a) {
  /external/eigen/bench/
benchCholesky.cpp 47 SquareMatrixType covMat = a * a.adjoint();
benchEigenSolver.cpp 46 SquareMatrixType covMat = a * a.adjoint();
eig33.cpp 179 A = A.adjoint() * A;
  /external/eigen/test/eigen2/
eigen2_lu.cpp 92 m1 += a * a.adjoint();
eigen2_sparse_product.cpp 71 // test self adjoint products
95 VERIFY_IS_APPROX(refS.adjoint(), refS);