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

<<11121314151617181920>>

  /external/eigen/doc/snippets/
MatrixBase_rowwise.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
PartialRedux_count.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
SelfAdjointEigenSolver_operatorSqrt.cpp 3 cout << "Here is a random positive-definite matrix, A:" << endl << A << endl << endl;
TopicAliasing_block.cpp 3 cout << "Here is the matrix mat:\n" << mat << endl;
TopicAliasing_block_correct.cpp 3 cout << "Here is the matrix mat:\n" << mat << endl;
Tridiagonalization_householderCoefficients.cpp 3 cout << "Here is a random symmetric 4x4 matrix:" << endl << A << endl;
Tutorial_solve_singular.cpp 5 cout << "Here is the matrix A:" << endl << A << endl;
Tutorial_solve_triangular.cpp 5 cout << "Here is the matrix A:" << endl << A << endl;
  /external/eigen/test/eigen2/
eigen2_sizeof.cpp 23 CALL_SUBTEST( verifySizeOf(Matrix<float, 1, 1>()) );
25 CALL_SUBTEST( verifySizeOf(Matrix<double, 4, 2>()) );
26 CALL_SUBTEST( verifySizeOf(Matrix<bool, 7, 5>()) );
30 CALL_SUBTEST( verifySizeOf(Matrix<float, 100, 100>()) );
  /external/eigen/test/
householder.cpp 26 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
27 typedef Matrix<Scalar, internal::decrement_size<MatrixType::RowsAtCompileTime>::ret, 1> EssentialVectorType;
28 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
29 typedef Matrix<Scalar, Dynamic, MatrixType::ColsAtCompileTime> HBlockMatrixType;
30 typedef Matrix<Scalar, Dynamic, 1> HCoeffsVectorType;
32 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> RightSquareMatrixType;
33 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, Dynamic> VBlockMatrixType;
34 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::RowsAtCompileTime> TMatrixType;
36 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
99 VERIFY_IS_APPROX(m3 * m5, m1); // test evaluating hseq to a dense matrix, then applyin
    [all...]
product_small.cpp 16 Matrix<float,1,3> matAstatic;
17 Matrix<float,3,1> matBstatic;
35 CALL_SUBTEST_1( product(Matrix<float, 3, 2>()) );
36 CALL_SUBTEST_2( product(Matrix<int, 3, 5>()) );
sizeof.cpp 23 CALL_SUBTEST(verifySizeOf(Matrix<float, 1, 1>()) );
25 CALL_SUBTEST(verifySizeOf(Matrix<double, 4, 2>()) );
26 CALL_SUBTEST(verifySizeOf(Matrix<bool, 7, 5>()) );
30 CALL_SUBTEST(verifySizeOf(Matrix<float, 100, 100>()) );
upperbidiagonalization.cpp 19 typedef Matrix<typename MatrixType::RealScalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime> RealMatrixType;
37 CALL_SUBTEST_5( upperbidiag(Matrix<float,6,4>()) );
38 CALL_SUBTEST_6( upperbidiag(Matrix<float,5,5>()) );
39 CALL_SUBTEST_7( upperbidiag(Matrix<double,4,3>()) );
  /external/skia/src/core/
SkPerspIter.h 17 /** Iterate a line through the matrix [x,y] ... [x+count-1, y].
18 @param m The matrix we will be iterating a line through
19 @param x The initial X coordinate to be mapped through the matrix
20 @param y The initial Y coordinate to be mapped through the matrix
  /external/skia/tools/lua/
bitmap_statistics.lua 30 matrix = canvas:getTotalMatrix()
31 matrixType = matrix:getType()
38 if matrix:getScaleX() > 1 or matrix:getScaleY() > 1 then
  /frameworks/base/libs/hwui/font/
FontUtil.h 43 #define GET_METRICS(paint, glyph, matrix) paint->getGlyphMetrics(glyph, matrix)
56 #define GET_METRICS(paint, glyph, matrix) paint->getUnicharMetrics(glyph, matrix)
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/spritetext/
Projector.java 19 import android.opengl.Matrix;
43 Matrix.multiplyMM(mMVP, 0, mGrabber.mProjection, 0, mGrabber.mModelView, 0);
47 Matrix.multiplyMV(mV, 0, mMVP, 0, obj, objOffset);
57 * Get the current projection matrix. Has the side-effect of
58 * setting current matrix mode to GL_PROJECTION
67 * Get the current model view matrix. Has the side-effect of
68 * setting current matrix mode to GL_MODELVIEW
  /external/chromium-trace/trace-viewer/third_party/gl-matrix/tasks/support/
gl-matrix.rb 40 autoload :ReleaseHelper, 'gl-matrix/release_helper'
41 autoload :Version, 'gl-matrix/version'
42 autoload :VERSION, 'gl-matrix/version'
63 def compile(source = 'gl-matrix.js', dest = 'dist/gl-matrix.js')
76 def minify(source = 'gl-matrix.js', dest = 'dist/gl-matrix-min.js')
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
vg_state.h 33 #include "matrix.h"
96 struct matrix path_user_to_surface_matrix;
97 struct matrix image_user_to_surface_matrix;
98 struct matrix fill_paint_to_user_matrix;
99 struct matrix stroke_paint_to_user_matrix;
100 struct matrix glyph_user_to_surface_matrix;
107 struct matrix * vg_state_matrix(struct vg_state *state);
  /external/eigen/Eigen/src/LU/
FullPivLU.h 19 * \brief LU decomposition of a matrix with complete pivoting, and related features
21 * \param MatrixType the type of the matrix of which we are computing the LU decomposition
23 * This class represents a LU decomposition of any matrix, with complete pivoting: the matrix A
32 * decomposition is inherently more stable and/or flexible. For example, when computing the kernel of a matrix,
33 * working with the SVD allows to select the smallest singular values of the matrix, something that
39 * As an exemple, here is how the original matrix can be retrieved:
83 * \param matrix the matrix of which to compute the LU decomposition.
86 FullPivLU(const MatrixType& matrix);
    [all...]
  /external/mesa3d/src/gallium/state_trackers/vega/
vg_state.h 33 #include "matrix.h"
96 struct matrix path_user_to_surface_matrix;
97 struct matrix image_user_to_surface_matrix;
98 struct matrix fill_paint_to_user_matrix;
99 struct matrix stroke_paint_to_user_matrix;
100 struct matrix glyph_user_to_surface_matrix;
107 struct matrix * vg_state_matrix(struct vg_state *state);
  /frameworks/base/tests/RenderScriptTests/SceneGraph/src/com/android/testapp/
test_app.rs 60 rs_matrix4x4 matrix;
61 rsMatrixLoadIdentity(&matrix);
64 rsMatrixTranslate(&matrix, 0, 0, -gZoom);
65 rsMatrixRotate(&matrix, 20.0f, 1.0f, 0.0f, 0.0f);
66 rsMatrixRotate(&matrix, gRotateY, 0.0f, 1.0f, 0.0f);
67 rsMatrixScale(&matrix, 0.2f, 0.2f, 0.2f);
68 rsgProgramVertexLoadModelMatrix(&matrix);
  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver_MKL.h 44 SelfAdjointEigenSolver<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >& \
45 SelfAdjointEigenSolver<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW>& matrix, int options) \
47 eigen_assert(matrix.cols() == matrix.rows()); \
52 lapack_int n = matrix.cols(), lda, matrix_order, info; \
55 m_eivec = matrix; \
59 m_eivalues.coeffRef(0,0) = internal::real(matrix.coeff(0,0)); \
67 lda = matrix.outerStride();
    [all...]
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR_MKL.h 29 * Householder QR decomposition of a matrix with column pivoting based on
45 ColPivHouseholderQR<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> >& \
46 ColPivHouseholderQR<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> >::compute( \
47 const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>& matrix) \
50 typedef Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> MatrixType; \
53 Index rows = matrix.rows();\
54 Index cols = matrix.cols();\
55 Index size = matrix.diagonalSize();\
57 m_qr = matrix;\
    [all...]
  /external/eigen/Eigen/src/SVD/
JacobiSVD_MKL.h 44 JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>& \
45 JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>& matrix, unsigned int computationOptions) \
47 typedef Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> MatrixType; \
50 allocate(matrix.rows(), matrix.cols(), computationOptions); \
55 lapack_int lda = matrix.outerStride(), ldu, ldvt; \
71 Matrix<MKLRTYPE, Dynamic, Dynamic> superb; superb.resize(m_diagSize, 1); \
72 MatrixType m_temp; m_temp = matrix; \
    [all...]

Completed in 1242 milliseconds

<<11121314151617181920>>