/external/eigen/doc/snippets/ |
D | TopicAliasing_mult2.cpp | 1 MatrixXf matA(2,2), matB(2,2); variable 5 matB = matA * matA; 6 cout << matB << endl << endl; 9 matB.noalias() = matA * matA; 10 cout << matB;
|
D | Tutorial_AdvancedInitialization_Block.cpp | 3 MatrixXf matB(4, 4); variable 4 matB << matA, matA/10, matA/10, matA; 5 std::cout << matB << std::endl;
|
/external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
D | mat3-spec.js | 24 var out, matA, matB, identity, result; 31 matB = [1, 0, 0, 197 beforeEach(function() { result = mat3.multiply(out, matA, matB); }); 215 expect(matB).toBeEqualish([ 224 beforeEach(function() { result = mat3.multiply(matA, matA, matB); }); 235 expect(matB).toBeEqualish([ 244 beforeEach(function() { result = mat3.multiply(matB, matA, matB); }); 247 expect(matB).toBeEqualish([ 253 it("should return matB", function() { expect(result).toBe(matB); });
|
D | mat2d-spec.js | 24 var out, matA, matB, identity, result; 35 matB = [7, 8, 101 beforeEach(function() { result = mat2d.multiply(out, matA, matB); }); 106 it("should not modify matB", function() { expect(matB).toBeEqualish(oldB); }); 110 beforeEach(function() { result = mat2d.multiply(matA, matA, matB); }); 114 it("should not modify matB", function() { expect(matB).toBeEqualish(oldB); }); 118 beforeEach(function() { result = mat2d.multiply(matB, matA, matB); }); 120 …it("should place values into matB", function() { expect(matB).toBeEqualish([25, 28, 57, 64, 100, 1… 121 it("should return matB", function() { expect(result).toBe(matB); });
|
D | mat2-spec.js | 24 var out, matA, matB, identity, result; 30 matB = [5, 6, 123 beforeEach(function() { result = mat2.multiply(out, matA, matB); }); 128 it("should not modify matB", function() { expect(matB).toBeEqualish([5, 6, 7, 8]); }); 132 beforeEach(function() { result = mat2.multiply(matA, matA, matB); }); 136 it("should not modify matB", function() { expect(matB).toBeEqualish([5, 6, 7, 8]); }); 140 beforeEach(function() { result = mat2.multiply(matB, matA, matB); }); 142 … it("should place values into matB", function() { expect(matB).toBeEqualish([19, 22, 43, 50]); }); 143 it("should return matB", function() { expect(result).toBe(matB); });
|
D | mat4-spec.js | 24 var out, matA, matB, identity, result; 33 matB = [1, 0, 0, 0, 195 beforeEach(function() { result = mat4.multiply(out, matA, matB); }); 215 expect(matB).toBeEqualish([ 225 beforeEach(function() { result = mat4.multiply(matA, matA, matB); }); 237 expect(matB).toBeEqualish([ 247 beforeEach(function() { result = mat4.multiply(matB, matA, matB); }); 250 expect(matB).toBeEqualish([ 257 it("should return matB", function() { expect(result).toBe(matB); });
|
/external/eigen/Eigen/src/Eigenvalues/ |
D | GeneralizedSelfAdjointEigenSolver.h | 107 GeneralizedSelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, 111 compute(matA, matB, options); 154 GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB, 164 compute(const MatrixType& matA, const MatrixType& matB, int options) in compute() argument 166 eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB.cols()==matB.rows()); in compute() 176 LLT<MatrixType> cholB(matB); in compute()
|
D | SelfAdjointEigenSolver.h | 333 …SelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = … 339 …static_cast<GeneralizedSelfAdjointEigenSolver<MatrixType>*>(this)->compute(matA, matB, computeEige… 347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) 349 compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
|
/external/eigen/test/ |
D | cholesky.cpp | 77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); in cholesky() local 98 matX = chollo.solve(matB); in cholesky() 99 VERIFY_IS_APPROX(symm * matX, matB); in cholesky() 106 matX = cholup.solve(matB); in cholesky() 107 VERIFY_IS_APPROX(symm * matX, matB); in cholesky() 121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() 122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky() 124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() 125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky() 127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() [all …]
|
D | sparse_solvers.cpp | 80 SparseMatrix<Scalar> matB(rows, rows); in sparse_solvers() local 85 initSparse<Scalar>(density, refMatB, matB); in sparse_solvers() 87 m2.template triangularView<Lower>().solveInPlace(matB); in sparse_solvers() 88 VERIFY_IS_APPROX(matB.toDense(), refMatB); in sparse_solvers() 92 initSparse<Scalar>(density, refMatB, matB); in sparse_solvers() 94 m2.template triangularView<Upper>().solveInPlace(matB); in sparse_solvers() 95 VERIFY_IS_APPROX(matB, refMatB); in sparse_solvers()
|
/external/eigen/test/eigen2/ |
D | eigen2_cholesky.cpp | 34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); in cholesky() local 75 ldlt.solve(matB, &matX); in cholesky() 76 VERIFY_IS_APPROX(symm * matX, matB); in cholesky() 85 chol.solve(matB, &matX); in cholesky() 86 VERIFY_IS_APPROX(symm * matX, matB); in cholesky()
|
/external/chromium_org/third_party/skia/src/effects/ |
D | SkColorMatrix.cpp | 73 const SkColorMatrix& matB) { in setConcat() argument 77 if (&matA == this || &matB == this) { in setConcat() 82 const SkScalar* b = matB.fMat; in setConcat()
|
/external/skia/src/effects/ |
D | SkColorMatrix.cpp | 73 const SkColorMatrix& matB) { in setConcat() argument 77 if (&matA == this || &matB == this) { in setConcat() 82 const SkScalar* b = matB.fMat; in setConcat()
|
/external/deqp/framework/common/ |
D | tcuMatrix.hpp | 252 const Matrix<T, 2, 1> matB = Matrix<T, 2, 1>(areaB); in doInverse() local 256 const T schurComplement = T(1.0f) / (matD - matC*invA*matB)(0,0); in doInverse() 259 const Matrix<T, 2, 2> blockA = invA + invA*matB*schurComplement*matC*invA; in doInverse() 260 const Matrix<T, 2, 1> blockB = (zeroMat-invA)*matB*schurComplement; in doInverse() 303 const Matrix<T, 2, 2> matB = Matrix<T, 2, 2>(areaB); in doInverse() local 307 const Matrix<T, 2, 2> schurComplement = inverse(matD - matC*invA*matB); in doInverse() 310 const Matrix<T, 2, 2> blockA = invA + invA*matB*schurComplement*matC*invA; in doInverse() 311 const Matrix<T, 2, 2> blockB = (zeroMat-invA)*matB*schurComplement; in doInverse()
|
/external/eigen/doc/ |
D | TopicAliasing.dox | 172 the same when the product is assigned to a different matrix (e.g., <tt>matB = matA * matA</tt>). In… 173 it is more efficient to evaluate the product directly into \c matB instead of evaluating it first i… 174 temporary matrix and copying that matrix to \c matB. 177 aliasing, as follows: <tt>matB.noalias() = matA * matA</tt>. This allows %Eigen to evaluate the mat… 178 <tt>matA * matA</tt> directly into \c matB.
|
/external/deqp/modules/gles3/functional/ |
D | es3fShaderMatrixTests.cpp | 767 const tcu::Matrix<float, 2, 1> matB = tcu::Matrix<float, 2, 1>(areaB); in inverse() local 771 const float schurComplement = 1.0f / (matD - matC*invA*matB)(0,0); in inverse() 774 const tcu::Matrix<float, 2, 2> blockA = invA + invA*matB*schurComplement*matC*invA; in inverse() 775 const tcu::Matrix<float, 2, 1> blockB = (zeroMat-invA)*matB*schurComplement; in inverse() 819 const tcu::Matrix<float, 2, 2> matB = Mat2(areaB); in inverse() local 823 const tcu::Matrix<float, 2, 2> schurComplement = inverse(matD - matC*invA*matB); in inverse() 826 const tcu::Matrix<float, 2, 2> blockA = invA + invA*matB*schurComplement*matC*invA; in inverse() 827 const tcu::Matrix<float, 2, 2> blockB = (zeroMat-invA)*matB*schurComplement; in inverse()
|
/external/deqp/modules/glshared/ |
D | glsBuiltinPrecisionTests.cpp | 3571 ExprP<Vec2> matB = bindExpression("matB", ctx, vec2(mat[2][0], mat[2][1])); in doExpand() local 3577 (matD - dot(matC * invA, matB))); in doExpand() 3579 ExprP<Vec2> t1 = invA * matB; in doExpand() 3586 (invA * matB) * -schur); in doExpand() 3610 ExprP<Mat2> matB = bindExpression("matB", ctx, in doExpand() local 3620 inverse(matD + -(matC * invA * matB))); in doExpand() 3622 invA + (invA * matB * schur * matC * invA)); in doExpand() 3624 (-invA) * matB * schur); in doExpand()
|
/external/opencv/cvaux/src/ |
D | cvepilines.cpp | 2427 CvMat matB = cvMat( 8, 1, CV_64F, b ); in icvComputePerspectiveCoeffs() local 2431 CV_CALL( cvMatMulAdd( &matInvA, &matB, 0, &matX )); in icvComputePerspectiveCoeffs() 2567 CvMat matB = cvMat( 8, 1, CV_64F, b ); in cvInitPerspectiveTransform() local 2571 CV_CALL( cvMatMulAdd( &matInvA, &matB, 0, &matX )); in cvInitPerspectiveTransform()
|