| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 24 Matrix<Scalar,Rows,Cols> &s,
26 const Matrix<Scalar,Dynamic,1> &diag,
27 const Matrix<Scalar,Dynamic,1> &qtb,
28 Matrix<Scalar,Dynamic,1> &x,
29 Matrix<Scalar,Dynamic,1> &sdiag)
36 Matrix<Scalar,Dynamic,1> wa(n);
50 /* eliminate the diagonal matrix d using a givens rotation. */
106 const Matrix<Scalar,Dynamic,1> &diag,
107 const Matrix<Scalar,Dynamic,1> &qtb,
108 Matrix<Scalar,Dynamic,1> &x
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 32 typedef typename GraphT::Matrix Matrix;
41 const Matrix &ECosts = G.getEdgeCosts(EId);
76 typedef typename GraphT::Matrix Matrix;
94 const Matrix *YXECosts = FlipEdge1 ?
95 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
98 const Matrix *ZXECosts = FlipEdge2 ?
99 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
132 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /external/pdfium/fpdfsdk/src/ |
| fpdf_transformpage.cpp | 79 DLLEXPORT FPDF_BOOL STDCALL FPDFPage_TransFormWithClip(FPDF_PAGE page, FS_MATRIX* matrix, FS_RECTF* clipRect)
93 bsMatix.Format("%f %f %f %f %f %f cm ", matrix->a, matrix->b,matrix->c,matrix->d,matrix->e,matrix->f);
178 CFX_AffineMatrix m = pDict->GetMatrix(FX_BSTRC("Matrix"));
179 CFX_AffineMatrix t = *(CFX_AffineMatrix*)matrix;
181 pDict->SetAtMatrix(FX_BSTRC("Matrix"), m);
[all...] |
| /external/ceres-solver/examples/ |
| libmv_homography.cc | 70 typedef Eigen::Matrix<double, 3, 3> Mat3;
71 typedef Eigen::Matrix<double, 2, 1> Vec2;
72 typedef Eigen::Matrix<double, Eigen::Dynamic, 8> MatX8;
94 // estimated homography matrix.
110 void SymmetricGeometricDistanceTerms(const Eigen::Matrix<T, 3, 3> &H,
111 const Eigen::Matrix<T, 2, 1> &x1,
112 const Eigen::Matrix<T, 2, 1> &x2,
115 typedef Eigen::Matrix<T, 3, 1> Vec3;
148 // A parameterization of the 2D homography matrix that uses 8 parameters so
149 // that the matrix is normalized (H(2,2) == 1)
[all...] |
| /external/eigen/doc/ |
| TutorialReductionsVisitorsBroadcasting.dox | 11 In Eigen, a reduction is a function taking a matrix or array, and returning a single
13 returning the sum of all the coefficients inside a given matrix or array.
24 The \em trace of a matrix, as returned by the function \c trace(), is the sum of the diagonal coefficients and can equivalently be computed <tt>a.diagonal().sum()</tt>.
33 These operations can also operate on matrices; in that case, a n-by-p matrix is seen as a vector of size (n*p), so for example the \link MatrixBase::norm() norm() \endlink method returns the "Frobenius" or "Hilbert-Schmidt" norm. We refrain from speaking of the \f$\ell^2\f$ norm of a matrix because that can mean different things.
51 - \link DenseBase::all() all() \endlink returns \b true if all of the coefficients in a given Matrix or Array evaluate to \b true .
52 - \link DenseBase::any() any() \endlink returns \b true if at least one of the coefficients in a given Matrix or Array evaluates to \b true .
53 - \link DenseBase::count() count() \endlink returns the number of coefficients in a given Matrix or Array that evaluate to \b true.
74 a Matrix or Array. The simplest examples are
77 the location of the greatest or smallest coefficient in a Matrix or
[all...] |
| TutorialSparse.dox | 3 /** \eigenManualPage TutorialSparse Sparse matrix manipulations
11 <tr><td>\link SparseCore_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><td>SparseMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></tr>
20 \section TutorialSparseIntro Sparse matrix format
22 In many applications (e.g., finite element methods) it is common to deal with very large matrices where only a few coefficients are different from zero. In such cases, memory consumption can be reduced and performance increased by using a specialized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
26 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers high performance and low memory usage.
33 The word \c inner refers to an \em inner \em vector that is a column for a column-major matrix, or a row for a row-major matrix.
36 This storage scheme is better explained on an example. The following matrix
71 Here is the previous matrix represented in compressed mode
[all...] |
| /frameworks/base/core/jni/android/graphics/ |
| Matrix.cpp | 1 /* libs/android_runtime/android/graphics/Matrix.cpp
25 #include "Matrix.h"
188 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
189 matrix->postSkew(kx, ky);
193 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
195 matrix->postConcat(*other);
199 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
205 return matrix->setRectToRect(src_, dst_, stf) ? JNI_TRUE : JNI_FALSE;
211 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
223 result = matrix->setPolyToPoly((const SkPoint*)src, (const SkPoint*)dst
232 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
241 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
260 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
269 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
275 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
288 SkMatrix* matrix = reinterpret_cast<SkMatrix*>(matrixHandle); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
| arc.c | 29 #include "matrix.h"
141 /* Pre-compute rotation matrix entries */
173 /* Pre-compute rotation matrix entries */
231 struct matrix matrix; local
237 matrix_load_identity(&matrix);
238 matrix_scale(&matrix, 1.f, arc->a/arc->b);
239 matrix_rotate(&matrix, -arc->theta);
240 matrix_map_point(&matrix,
243 matrix_map_point(&matrix,
[all...] |
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| arc.c | 29 #include "matrix.h"
141 /* Pre-compute rotation matrix entries */
173 /* Pre-compute rotation matrix entries */
231 struct matrix matrix; local
237 matrix_load_identity(&matrix);
238 matrix_scale(&matrix, 1.f, arc->a/arc->b);
239 matrix_rotate(&matrix, -arc->theta);
240 matrix_map_point(&matrix,
243 matrix_map_point(&matrix,
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Transform.h | 76 * - #Affine: the transformation is stored as a (Dim+1)^2 matrix,
78 * - #AffineCompact: the transformation is stored as a (Dim)x(Dim+1) matrix.
79 * - #Projective: the transformation is stored as a (Dim+1)^2 matrix
81 * \tparam _Options has the same meaning as in class Matrix. It allows to specify DontAlign and/or RowMajor.
82 * These Options are passed directly to the underlying matrix type.
84 * The homography is internally represented and stored by a matrix which
85 * is available through the matrix() method. To understand the behavior of
87 * matrix representation. The chosen convention is right multiply:
91 * Therefore, an affine transformation matrix M is shaped like this:
101 * However, unlike a plain matrix, the Transform class provides many feature
367 inline const MatrixType& matrix() const { return m_matrix; } function in class:Eigen::Transform
369 inline MatrixType& matrix() { return m_matrix; } function in class:Eigen::Transform
[all...] |
| /external/valgrind/main/drd/tests/ |
| omp_matinv.c | 1 /** Compute the matrix inverse via Gauss-Jordan elimination.
41 /** Allocate memory for a matrix with the specified number of rows and
51 /** Free the memory that was allocated for a matrix. */
57 /** Fill in some numbers in a matrix. */
70 /** Print all elements of a matrix. */
86 /** Copy a subset of the elements of a matrix into another matrix. */
122 /** Compute the matrix product of a1 and a2. */
150 /** Apply the Gauss-Jordan elimination algorithm on the matrix p->a starting
153 * initialized with. If the matrix p->a is nonsingular, and if matrix p->
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/ |
| armVCM4P10_TransformResidual4x4_s.s | 139 ;// Transpose the 4x4 matrix *
141 ;// Transpose the 4x4 result matrix *
155 ;// Transpose the matrix inorder to perform row ops as coloumn ops
156 ;// Input: in[][] = original matrix
157 ;// Output: trRow[][]= transposed matrix
158 ;// Step1: Obtain the LL part of the transposed matrix
165 ;// LL 2x2 transposed matrix
174 ;// HL 2x2 transposed matrix
184 ;// LH 2x2 transposed matrix
196 ;// HH 2x2 transposed matrix
[all...] |
| /frameworks/base/rs/java/android/renderscript/ |
| ScriptIntrinsicColorMatrix.java | 20 * Intrinsic for applying a color matrix to allocations.
27 * then multiplied by the 4x4 color matrix as performed by
49 * Create an intrinsic for applying a color matrix to an
68 * Create an intrinsic for applying a color matrix to an
88 * Set the color matrix which will be applied to each cell of
91 * @param m The 4x4 matrix to set.
99 * Set the color matrix which will be applied to each cell of the image.
102 * @param m The 3x3 matrix to set.
110 * Set the value to be added after the color matrix has been
130 * Set the value to be added after the color matrix has bee
[all...] |
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 108 typedef Matrix<Scalar,Dynamic,1> VectorType;
109 typedef Matrix<Index, 1, MatrixType::ColsAtCompileTime> IntRowVectorType;
110 typedef Matrix<Index, MatrixType::RowsAtCompileTime, 1> IntColVectorType;
135 * \c NumericalIssue if the matrix appears to be negative.
151 /** Performs a symbolic decomposition on the sparcity of \a matrix.
157 Derived& analyzePattern(const MatrixType& matrix);
159 /** Performs a numeric decomposition of \a matrix
161 * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.
165 Derived& factorize(const MatrixType& matrix);
[all...] |
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| ImageShader.java | 434 public void setSourceTransform(float[] matrix) {
435 if (matrix.length != 16) {
436 throw new IllegalArgumentException("Expected 4x4 matrix for source transform!");
439 matrix[12],
440 matrix[13],
442 matrix[0] + matrix[12],
443 matrix[1] + matrix[13],
445 matrix[4] + matrix[12]
[all...] |
| /cts/tests/tests/view/src/android/view/animation/cts/ |
| TransformationTest.java | 19 import android.graphics.Matrix;
40 Matrix expectedMatrix = new Matrix();
48 expectedMatrix = new Matrix();
130 final Matrix expected = new Matrix();
|
| /development/samples/ApiDemos/src/com/example/android/apis/animation/ |
| Rotate3dAnimation.java | 22 import android.graphics.Matrix;
77 final Matrix matrix = t.getMatrix(); local
86 camera.getMatrix(matrix);
89 matrix.preTranslate(-centerX, -centerY);
90 matrix.postTranslate(centerX, centerY);
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_dense_matrix.h | 45 // A square block random accessible matrix with the same row and
47 // array, so that its also accessible as a dense matrix of size
57 // blocks is a vector of block sizes. The resulting matrix has
62 // modifying any cells when the matrix is being destroyed.
77 // Since the matrix is square with the same row and column block
82 // The underlying matrix storing the cells.
|
| block_random_access_diagonal_matrix.h | 50 // A thread safe block diagonal matrix implementation of
58 // modifying any cells when the matrix is being destroyed.
73 // Since the matrix is square, num_rows() == num_cols().
77 // Access to the underlying matrix object.
78 const TripletSparseMatrix* matrix() const { return tsm_.get(); } function in class:ceres::internal::BlockRandomAccessDiagonalMatrix
86 // The underlying matrix object which actually stores the cells.
|
| block_sparse_matrix.h | 51 // initialize the matrix. For details on how the blocks structure of
52 // the matrix is stored please see the documentation
58 // Construct a block sparse matrix with a fully initialized
59 // CompressedRowBlockStructure objected. The matrix takes over
75 virtual void ToDenseMatrix(Matrix* dense_matrix) const;
84 void ToTripletSparseMatrix(TripletSparseMatrix* matrix) const;
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
| mat4-spec.js | 27 // Attempting to portray a semi-realistic transform matrix
51 it("should return a 16 element array initialized to a 4x4 identity matrix", function() { expect(result).toBeEqualish(identity); });
72 describe("with a separate output matrix", function() {
94 describe("when matA is the output matrix", function() {
110 describe("with a separate output matrix", function() {
132 describe("when matA is the output matrix", function() {
148 describe("with a separate output matrix", function() {
170 describe("when matA is the output matrix", function() {
194 describe("with a separate output matrix", function() {
224 describe("when matA is the output matrix", function()
[all...] |
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_window_pos.spec | 32 coordinate with the RasterPos command, the modelview matrix, projection
33 matrix and viewport must be set very carefully. Furthermore, if the
39 current raster position, bypassing the modelview matrix, the
40 projection matrix and the viewport to window mapping. Furthermore,
94 matrix, projection matrix and viewport parameters are ignored and the
|
| /external/chromium_org/third_party/skia/include/utils/ |
| SkLayer.h | 88 /** Return, in matrix, the matix transfomations that are applied locally
89 when this layer draws (i.e. its position and matrix/anchorPoint).
93 void getLocalTransform(SkMatrix* matrix) const;
95 /** Return, in matrix, the concatenation of transforms that are applied
97 This is the matrix that is applied to the layer during drawing.
99 void localToGlobal(SkMatrix* matrix) const;
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkCanvasStack.cpp | 64 * We need to handle setMatrix specially as it overwrites the matrix in each
65 * canvas unlike all other matrix operations (i.e. translate, scale, etc) which
66 * just pre-concatenate with the existing matrix.
68 void SkCanvasStack::didSetMatrix(const SkMatrix& matrix) {
72 SkMatrix tempMatrix = matrix;
77 this->SkCanvas::didSetMatrix(matrix);
|
| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 25 * Each transposition \f$ T_{i} \f$ applied on the left of a matrix (\f$ T_{i} M\f$) interchanges
26 * the rows \c i and \c indices[i] of the matrix \c M.
32 * To apply a sequence of transpositions to a matrix, simply use the operator * as in the following example:
38 * In this example, we detect that the matrix appears on both side, and so the transpositions
115 // might be usefull when the target matrix expression is complex, e.g.:
116 // object.matrix().block(..,..,..,..) = trans * object.matrix().block(..,..,..,..);
151 typedef Matrix<Index, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType;
201 /** Constructs an uninitialized permutation matrix of given size.
222 typedef Map<const Matrix<Index,SizeAtCompileTime,1,0,MaxSizeAtCompileTime,1>, _PacketAccess> IndicesType
[all...] |
