| /external/eigen/doc/snippets/ |
| H A D | TopicAliasing_mult2.cpp | 1 MatrixXf matA(2,2), matB(2,2);
5 matB = matA * matA;
6 cout << matB << endl << endl;
9 matB.noalias() = matA * matA;
10 cout << matB; variable
|
| H A D | Tutorial_AdvancedInitialization_Block.cpp | 3 MatrixXf matB(4, 4);
4 matB << matA, matA/10, matA/10, matA;
5 std::cout << matB << std::endl;
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| H A D | GeneralizedSelfAdjointEigenSolver.h | 85 * \param[in] matB Positive-definite matrix in matrix pencil.
93 * selfadjoint matrix \f$ A \f$ and \a matB the positive definite matrix
107 GeneralizedSelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, argument
111 compute(matA, matB, options);
118 * \param[in] matB Positive-definite matrix in matrix pencil.
130 * with \a matA the selfadjoint matrix \f$ A \f$ and \a matB the positive definite
154 GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB,
164 compute(const MatrixType& matA, const MatrixType& matB, int options) argument
166 eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB
[all...] |
| H A D | SelfAdjointEigenSolver.h | 333 SelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) argument
339 static_cast<GeneralizedSelfAdjointEigenSolver<MatrixType>*>(this)->compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) argument
349 compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
|
| /external/eigen/test/ |
| H A D | cholesky.cpp | 77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); local
98 matX = chollo.solve(matB);
99 VERIFY_IS_APPROX(symm * matX, matB);
106 matX = cholup.solve(matB);
107 VERIFY_IS_APPROX(symm * matX, matB);
135 matX = ldltlo.solve(matB);
136 VERIFY_IS_APPROX(symm * matX, matB);
142 matX = ldltup.solve(matB);
143 VERIFY_IS_APPROX(symm * matX, matB);
155 matX = matB;
209 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); local
[all...] |
| H A D | sparse_solvers.cpp | 80 SparseMatrix<Scalar> matB(rows, rows);
85 initSparse<Scalar>(density, refMatB, matB);
87 m2.template triangularView<Lower>().solveInPlace(matB);
88 VERIFY_IS_APPROX(matB.toDense(), refMatB);
92 initSparse<Scalar>(density, refMatB, matB);
94 m2.template triangularView<Upper>().solveInPlace(matB);
95 VERIFY_IS_APPROX(matB, refMatB);
|
| /external/eigen/test/eigen2/ |
| H A D | eigen2_cholesky.cpp | 34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); local
75 ldlt.solve(matB, &matX);
76 VERIFY_IS_APPROX(symm * matX, matB);
85 chol.solve(matB, &matX);
86 VERIFY_IS_APPROX(symm * matX, matB);
|
| /external/skia/src/utils/ |
| H A D | SkColorMatrix.cpp | 71 const SkColorMatrix& matB) {
75 if (&matA == this || &matB == this) {
80 const SkScalar* b = matB.fMat;
70 setConcat(const SkColorMatrix& matA, const SkColorMatrix& matB) argument
|
| /external/opencv/cvaux/src/ |
| H A D | cvepilines.cpp | 2427 CvMat matB = cvMat( 8, 1, CV_64F, b ); local
2431 CV_CALL( cvMatMulAdd( &matInvA, &matB, 0, &matX ));
2567 CvMat matB = cvMat( 8, 1, CV_64F, b );
2571 CV_CALL( cvMatMulAdd( &matInvA, &matB, 0, &matX ));
|