| /external/eigen/doc/snippets/ |
| 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;
|
| 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/ |
| 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,
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)
166 eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB.cols()==matB.rows())
[all...] |
| SelfAdjointEigenSolver.h | 333 SelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true)
339 static_cast<GeneralizedSelfAdjointEigenSolver<MatrixType>*>(this)->compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true)
349 compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
|
| /external/eigen/test/ |
| cholesky.cpp | 77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
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;
[all...] |
| 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/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
| 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]); });
139 describe("when matB is the output matrix", function() {
140 beforeEach(function() { result = mat2.multiply(matB, matA, matB); })
[all...] |
| 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); });
117 describe("when matB is the output matrix", function() {
118 beforeEach(function() { result = mat2d.multiply(matB, matA, matB); })
[all...] |
| mat3-spec.js | 24 var out, matA, matB, identity, result;
31 matB = [1, 0, 0,
197 beforeEach(function() { result = mat3.multiply(out, matA, matB); });
214 it("should not modify matB", function() {
215 expect(matB).toBeEqualish([
224 beforeEach(function() { result = mat3.multiply(matA, matA, matB); });
234 it("should not modify matB", function() {
235 expect(matB).toBeEqualish([
243 describe("when matB is the output matrix", function() {
244 beforeEach(function() { result = mat3.multiply(matB, matA, matB); })
[all...] |
| 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); });
214 it("should not modify matB", function() {
215 expect(matB).toBeEqualish([
225 beforeEach(function() { result = mat4.multiply(matA, matA, matB); });
236 it("should not modify matB", function() {
237 expect(matB).toBeEqualish([
246 describe("when matB is the output matrix", function() {
247 beforeEach(function() { result = mat4.multiply(matB, matA, matB); })
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
75 ldlt.solve(matB, &matX);
76 VERIFY_IS_APPROX(symm * matX, matB);
85 chol.solve(matB, &matX);
86 VERIFY_IS_APPROX(symm * matX, matB);
|
| /frameworks/base/graphics/java/android/graphics/ |
| ColorMatrix.java | 151 * as applying matB and then applying matA. It is legal for either matA or
152 * matB to be the same colormatrix as this.
154 public void setConcat(ColorMatrix matA, ColorMatrix matB) {
157 if (matA == this || matB == this) {
165 final float[] b = matB.mArray;
|
| /external/chromium_org/third_party/skia/src/effects/ |
| SkColorMatrix.cpp | 72 const SkColorMatrix& matB) {
76 if (&matA == this || &matB == this) {
81 const SkScalar* b = matB.fMat;
|
| /external/skia/src/effects/ |
| SkColorMatrix.cpp | 72 const SkColorMatrix& matB) {
76 if (&matA == this || &matB == this) {
81 const SkScalar* b = matB.fMat;
|
| /external/opencv/cvaux/src/ |
| cvepilines.cpp | [all...] |
| /prebuilts/sdk/10/ |
| android.jar | |
| /prebuilts/sdk/12/ |
| android.jar | |
| /prebuilts/sdk/14/ |
| android.jar | |
| /prebuilts/sdk/15/ |
| android.jar | |
| /prebuilts/sdk/17/ |
| android.jar | |
| /prebuilts/sdk/18/ |
| android.jar | |
| /prebuilts/sdk/4/ |
| android.jar | |
| /prebuilts/sdk/6/ |
| android.jar | |
| /prebuilts/sdk/current/ |
| android.jar | |
