HomeSort by relevance Sort by last modified time
    Searched full:matrix (Results 1001 - 1025 of 3296) sorted by null

<<41424344454647484950>>

  /external/eigen/blas/
stpmv.f 13 * STPMV performs one of the matrix-vector operations
18 * upper or lower triangular matrix, supplied in packed form.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
64 * contain the upper triangular matrix packed sequentially,
69 * contain the lower triangular matrix packed sequentially,
ztpmv.f 13 * ZTPMV performs one of the matrix-vector operations
18 * upper or lower triangular matrix, supplied in packed form.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
64 * contain the upper triangular matrix packed sequentially,
69 * contain the lower triangular matrix packed sequentially,
  /external/eigen/unsupported/Eigen/src/SparseExtra/
RandomSetter.h 96 * \brief The RandomSetter is a wrapper object allowing to set/update a sparse matrix with random access
98 * \param SparseMatrixType the type of the sparse matrix we are updating
104 * This class temporarily represents a sparse matrix object using a generic map implementation allowing for
106 * in the RandomSetter constructor, while the sparse matrix is updated back at destruction time. This strategy
121 * Since hash_map objects are not fully sorted, representing a full matrix as a single hash_map would
122 * involve a big and costly sort to update the compressed matrix back. To overcome this issue, a RandomSetter
175 /** Constructs a random setter object from the sparse matrix \a target
178 * a sparse matrix from scratch, then you must set it to zero first using the
208 /** Destructor updating back the sparse matrix target */
  /external/opencv/cv/include/
cvtypes.h 252 float* DynamMatr; /* Matrix of the linear Dynamics system */
296 CvMat* transition_matrix; /* state transition matrix (A) */
297 CvMat* control_matrix; /* control matrix (B)
299 CvMat* measurement_matrix; /* measurement matrix (H) */
300 CvMat* process_noise_cov; /* process noise covariance matrix (Q) */
301 CvMat* measurement_noise_cov; /* measurement noise covariance matrix (R) */
302 CvMat* error_cov_pre; /* priori error estimate covariance matrix (P'(k)):
304 CvMat* gain; /* Kalman gain matrix (K(k)):
306 CvMat* error_cov_post; /* posteriori error estimate covariance matrix (P(k)):
  /external/valgrind/unittest/
linear_solver.h 77 class Matrix {
82 * This matrix can grow its "N" i.e. width
86 Matrix (int M_, int N) {
93 ~Matrix() {
158 Vector EstimateParameters(const Matrix & perf_m, const Vector & stats_v, double rel_diff, int * iter_count = NULL)
174 // First, let's find out those lines in matrix having only one non-zero coefficient
175 // and if we have any, decrease the dimension of our matrix
234 // Formulate the sub-problem (sub-matrix & sub-stats)
235 Matrix new_m(M - count_easy_param, N - count_easy_param);
  /frameworks/base/docs/html/guide/topics/graphics/
opengl.jd 260 <p>In order to apply projection and camera views, you create a projection matrix and a camera view
261 matrix and apply them to the OpenGL rendering pipeline. The projection matrix recalculates the
263 matrix creates a transformation that renders objects from a specific eye position.</p>
267 <p>In the ES 1.0 API, you apply projection and camera view by creating each matrix and then
271 <li><strong>Projection matrix</strong> - Create a projection matrix using the geometry of the
276 implementation to create a projection matrix based on the screen's aspect ratio and apply it to the
285 gl.glMatrixMode(GL10.GL_PROJECTION); // set matrix to projection mode
286 gl.glLoadIdentity(); // reset the matrix to its default stat
    [all...]
  /frameworks/base/libs/hwui/
DisplayListRenderer.h 89 virtual void setMatrix(SkMatrix* matrix);
90 virtual void concatMatrix(SkMatrix* matrix);
99 virtual status_t drawBitmap(SkBitmap* bitmap, SkMatrix* matrix, SkPaint* paint);
271 inline SkMatrix* refMatrix(SkMatrix* matrix) {
272 if (matrix) {
273 // Copying the matrix is cheap and prevents against the user changing
274 // the original matrix before the operation that uses it
275 SkMatrix* copy = new SkMatrix(*matrix);
279 return matrix;
  /frameworks/rs/scriptc/
rs_graphics.rsh 126 * Load the projection matrix for a currently bound fixed function
129 * @param proj projection matrix
134 * Load the model matrix for a currently bound fixed function
137 * @param model model matrix
142 * Load the texture matrix for a currently bound fixed function
145 * @param tex texture matrix
150 * Get the projection matrix for a currently bound fixed function
153 * @param proj matrix to store the current projection matrix into
  /packages/apps/Camera/src/com/android/camera/
CameraScreenNail.java 21 import android.opengl.Matrix;
306 protected void updateTransformMatrix(float[] matrix) {
307 super.updateTransformMatrix(matrix);
308 Matrix.translateM(matrix, 0, .5f, .5f, 0);
309 Matrix.scaleM(matrix, 0, mScaleX, mScaleY, 1f);
310 Matrix.translateM(matrix, 0, -.5f, -.5f, 0);
  /packages/apps/Camera2/src/com/android/camera/crop/
CropView.java 24 import android.graphics.Matrix;
55 private Matrix mDisplayMatrix = null;
56 private Matrix mDisplayMatrixInverse = null;
308 // If display matrix doesn't exist, create it and its dependencies
310 mDisplayMatrix = new Matrix();
314 Log.w(LOGTAG, "failed to get screen matrix");
318 mDisplayMatrixInverse = new Matrix();
321 Log.w(LOGTAG, "could not invert display matrix");
325 // Scale min side and tolerance by display matrix scale factor
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/crop/
CropView.java 24 import android.graphics.Matrix;
56 private Matrix mDisplayMatrix = null;
57 private Matrix mDisplayMatrixInverse = null;
309 // If display matrix doesn't exist, create it and its dependencies
311 mDisplayMatrix = new Matrix();
315 Log.w(LOGTAG, "failed to get screen matrix");
319 mDisplayMatrixInverse = new Matrix();
322 Log.w(LOGTAG, "could not invert display matrix");
326 // Scale min side and tolerance by display matrix scale factor
  /prebuilts/sdk/renderscript/include/
rs_graphics.rsh 126 * Load the projection matrix for a currently bound fixed function
129 * @param proj projection matrix
134 * Load the model matrix for a currently bound fixed function
137 * @param model model matrix
142 * Load the texture matrix for a currently bound fixed function
145 * @param tex texture matrix
150 * Get the projection matrix for a currently bound fixed function
153 * @param proj matrix to store the current projection matrix into
  /development/samples/ApiDemos/src/com/example/android/apis/os/
RotationVectorDemo.java 92 // initialize the rotation matrix to identity
114 // convert the rotation-vector to a 4x4 matrix. the matrix
126 // set-up modelview matrix
142 // set projection matrix
  /external/ceres-solver/internal/ceres/
implicit_schur_complement_test.cc 72 Matrix* lhs,
101 // lhs_ref is an upper triangular matrix. Construct a full version
103 // lower triangular part of the matrix and adding it to lhs_ref.
118 Matrix lhs;
184 // Verify that the Schur Complement matrix implied by the
preconditioner.h 105 // for some vector b. It is important that the matrix A have the
108 // D can be NULL, in which case its interpreted as a diagonal matrix
128 // other preconditioners that depend on the particular matrix layout of
151 // Wrapper does NOT take ownership of the matrix pointer.
152 explicit SparseMatrixPreconditionerWrapper(const SparseMatrix* matrix);
schur_complement_solver.h 61 // matrix. Further, the rows of A are ordered so that for every
63 // occur as a vertically contiguous block. i.e the matrix A looks like
80 // should be non-null and the diagonal matrix corresponding to it
86 // matrix is small and dense, or if CHOLMOD/SuiteSparse is not
91 // complement matrix is large and sparse. It requires that
  /external/chromium_org/cc/animation/
transform_operation.cc 18 return matrix.IsIdentity();
120 to_matrix = to->matrix;
123 from_matrix = from->matrix;
163 to_matrix = to->matrix;
166 from_matrix = from->matrix;
  /external/chromium_org/native_client_sdk/src/examples/api/graphics_3d/
matrix.cc 5 /** @file matrix.cc
6 * Implements simple matrix manipulation functions.
12 #include "matrix.h"
65 // Generate to a temporary first in case the output matrix and input
66 // matrix are the same.
  /external/chromium_org/third_party/angle_dx11/samples/gles2_book/PostSubBuffer/
PostSubBuffer.c 43 // MVP matrix
95 // Update MVP matrix based on time
112 // Generate a perspective matrix with a 60 degree FOV
116 // Generate a model view matrix to rotate/translate the cube
154 // Load the MVP matrix
  /external/chromium_org/third_party/qcms/src/
qcmsint.h 54 float ALIGN matrix[3][4]; member in struct:_qcms_transform
99 struct matrix { struct
109 struct matrix matrix; member in struct:qcms_modular_transform
248 struct matrix chromaticAdaption;
  /external/chromium_org/third_party/skia/include/device/xps/
SkXPSDevice.h 98 const SkMatrix& matrix,
123 const SkMatrix* matrix,
229 const SkMatrix& matrix,
295 const SkMatrix& matrix,
300 SkMatrix* matrix,
  /external/chromium_org/third_party/skia/src/animator/
SkPathParts.cpp 300 SK_MEMBER(matrix, Matrix),
308 SkAddPath::SkAddPath() : matrix(NULL), path(NULL) {
313 if (matrix)
314 fPath->fPath.addPath(path->fPath, matrix->getMatrix());
  /external/eigen/Eigen/src/plugins/
CommonCwiseUnaryOps.h 67 /** Overloaded for efficient real matrix times complex scalar value */
76 operator*(const Scalar& scalar, const StorageBaseType& matrix)
77 { return matrix*scalar; }
80 operator*(const std::complex<Scalar>& scalar, const StorageBaseType& matrix)
81 { return matrix*scalar; }
  /external/eigen/test/eigen2/
eigen2_array.cpp 21 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
56 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
120 CALL_SUBTEST_1( array(Matrix<float, 1, 1>()) );
128 CALL_SUBTEST_1( comparisons(Matrix<float, 1, 1>()) );
135 CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );
eigen2_sparse_product.cpp 20 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
21 typedef Matrix<Scalar,Dynamic,1> DenseVector;
23 // test matrix-matrix product
55 // test matrix - diagonal product

Completed in 765 milliseconds

<<41424344454647484950>>