Searched refs:adjoint (Results 26 - 50 of 116) sorted by relevance

12345

/external/eigen/test/
H A Dselfadjoint.cpp31 VERIFY_IS_APPROX(m3, m3.adjoint());
36 VERIFY_IS_APPROX(m3, m3.adjoint());
H A Dreal_qz.cpp45 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixQ().adjoint(), MatrixType::Identity(dim,dim));
46 VERIFY_IS_APPROX(qz.matrixZ()*qz.matrixZ().adjoint(), MatrixType::Identity(dim,dim));
H A Deigensolver_selfadjoint.cpp31 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;
36 MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;
99 // FIXME tridiag.matrixQ().adjoint() does not work
100 VERIFY_IS_APPROX(MatrixType(symmA.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());
H A Dhouseholder.cpp101 SquareMatrixType hseq_mat_adj = hseq.adjoint();
104 VERIFY_IS_APPROX(hseq_mat.adjoint(), hseq_mat_adj);
108 VERIFY_IS_APPROX(hseq_mat.adjoint() * m6, hseq_mat_adj * m6);
112 VERIFY_IS_APPROX(m6 * hseq_mat.adjoint(), m6 * hseq_mat_adj);
H A Deigensolver_generic.cpp31 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;
H A Ddontalign.cpp39 v = a.adjoint() * v;
H A Dhessenberg.cpp24 VERIFY_IS_APPROX(m, Q * H * Q.adjoint());
H A Dcholesky.cpp46 symmCpy += sigma * vec * vec.adjoint();
78 SquareMatrixType symm = a0 * a0.adjoint();
83 symm += a1 * a1.adjoint();
205 SquareMatrixType A = a * a.adjoint();
224 SquareMatrixType A = a * d.asDiagonal() * a.adjoint();
261 RealMatrixType symm = a0 * a0.adjoint();
266 symm += a1 * a1.adjoint();
H A Djacobisvd.cpp38 VERIFY_IS_APPROX(m, u * sigma * v.adjoint());
114 VERIFY_IS_APPROX(m.adjoint()*m*x,m.adjoint()*rhs);
136 HouseholderQR<MatrixType2T> qr(m2.adjoint());
137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
206 VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint());
/external/eigen/Eigen/src/Householder/
H A DBlockHouseholder.h34 triFactor.col(i).head(i).noalias() = -hCoeffs(i) * vectors.block(i, 0, rs, i).adjoint()
58 VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
60 tmp = T.template triangularView<Upper>().adjoint() * tmp;
/external/eigen/test/eigen2/
H A Deigen2_cholesky.cpp35 SquareMatrixType symm = a0 * a0.adjoint();
38 symm += a1 * a1.adjoint();
72 //VERIFY_IS_APPROX(symm, ldlt.matrixL() * ldlt.vectorD().asDiagonal() * ldlt.matrixL().adjoint());
82 VERIFY_IS_APPROX(symm, chol.matrixL() * chol.matrixL().adjoint());
93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint();
H A Deigen2_eigensolver.cpp35 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;
39 MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;
118 MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;
H A Deigen2_determinant.cpp41 VERIFY_IS_APPROX(ei_conj(m2.determinant()), m2.adjoint().determinant());
H A Deigen2_sparse_solvers.cpp19 refMat = refMat * refMat.adjoint();
23 refMat += aux * aux.adjoint();
124 refMat2 += refMat2.adjoint();
/external/eigen/lapack/
H A Dcholesky.cpp62 A.triangularView<Upper>().adjoint().solveInPlace(B);
68 A.triangularView<Lower>().adjoint().solveInPlace(B);
H A Dlu.cpp81 lu.triangularView<Upper>().adjoint().solveInPlace(B);
82 lu.triangularView<UnitLower>().adjoint().solveInPlace(B);
H A Deigenvalues.cpp59 if(UPLO(*uplo)==UP) mat = matrix(a,*n,*n,*lda).adjoint();
/external/eigen/Eigen/src/Eigenvalues/
H A DRealQZ.h228 m_S.applyOnTheLeft(m_Q.adjoint());
241 m_S.rightCols(dim-j-1).applyOnTheLeft(i-1,i,G.adjoint());
242 m_T.rightCols(dim-i+1).applyOnTheLeft(i-1,i,G.adjoint());
257 m_Z.applyOnTheLeft(i,i-1,G.adjoint());
336 m_S.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint());
337 m_T.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint());
347 m_Z.applyOnTheLeft(i+1,i,G.adjoint());
370 m_S.rightCols(dim-firstColS).applyOnTheLeft(zz,zz+1,G.adjoint());
371 m_T.rightCols(dim-zz).applyOnTheLeft(zz,zz+1,G.adjoint());
385 m_Z.applyOnTheLeft(zz,zz-1,G.adjoint());
[all...]
H A DMatrixBaseEigenvalues.h128 return sqrt((m_eval*m_eval.adjoint())
140 * This function computes the L2 operator norm of a self-adjoint matrix. For a
141 * self-adjoint matrix, the operator norm is the largest eigenvalue.
/external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/
H A Dmat3-spec.js152 describe("adjoint", function() {
154 beforeEach(function() { result = mat3.adjoint(out, matA); });
174 beforeEach(function() { result = mat3.adjoint(matA, matA); });
/external/eigen/Eigen/src/Core/products/
H A DSelfadjointMatrixMatrix_MKL.h29 * Self adjoint matrix * matrix product functionality based on ?SYMM/?HEMM.
84 b_tmp = rhs.adjoint(); \
148 b_tmp = rhs.adjoint(); \
210 b_tmp = lhs.adjoint(); \
273 b_tmp = lhs.adjoint(); \
/external/eigen/Eigen/src/Eigen2Support/
H A DLeastSquares.h154 covMat += diff * diff.adjoint();
H A DSVD.h550 if(unitary) *unitary = m_matU * m_matV.adjoint();
551 if(positive) *positive = m_matV * m_sigma.asDiagonal() * m_matV.adjoint();
568 if(unitary) *unitary = m_matU * m_matV.adjoint();
569 if(positive) *positive = m_matU * m_sigma.asDiagonal() * m_matU.adjoint();
586 Scalar x = (m_matU * m_matV.adjoint()).determinant(); // so x has absolute value 1
589 if(scaling) scaling->lazyAssign(m_matV * sv.asDiagonal() * m_matV.adjoint());
594 rotation->lazyAssign(m * m_matV.adjoint());
612 Scalar x = (m_matU * m_matV.adjoint()).determinant(); // so x has absolute value 1
615 if(scaling) scaling->lazyAssign(m_matU * sv.asDiagonal() * m_matU.adjoint());
620 rotation->lazyAssign(m * m_matV.adjoint());
[all...]
/external/eigen/unsupported/test/
H A Dmpreal_support.cpp25 MatrixXmp S = A.adjoint() * A;
H A Dsvd_common.h46 VERIFY_IS_APPROX(m, u * sigma * v.adjoint());
99 VERIFY_IS_APPROX(m.adjoint()*m*x,m.adjoint()*rhs);
135 VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint());

Completed in 354 milliseconds

12345