| /external/libopus/silk/fixed/ |
| corrMatrix_FIX.c | 108 /* Fill out the diagonal of the correlation matrix */
127 /* Calculate remaining off diagonal: X[:,j]'*X[:,j + lag] */
144 /* Calculate remaining off diagonal: X[:,j]'*X[:,j + lag] */
|
| /sdk/files/ |
| devices.xml | 12 <d:diagonal-length>3.7</d:diagonal-length>
87 <d:diagonal-length>4</d:diagonal-length>
200 <d:diagonal-length>4.65</d:diagonal-length> <!-- In inches -->
331 <d:diagonal-length>7.27</d:diagonal-length>
410 <d:diagonal-length>4.7</d:diagonal-length
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 32 * \f$. If \f$ D \f$ is a diagonal matrix with the eigenvalues on
33 * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as
266 // The eigenvalues are on the diagonal of T.
271 m_eivalues = m_schur.matrixT().diagonal();
288 // Compute X such that T = X D X^(-1), where D is the diagonal of T.
|
| EigenSolver.h | 31 * \f$ D \f$ is a diagonal matrix with the eigenvalues on the diagonal, and
39 * matrix \f$ D \f$ is not required to be diagonal, but if it is allowed to
42 * (where \f$ u \f$ and \f$ v \f$ are real numbers) on the diagonal. These
190 * block-diagonal matrix \f$ D \f$ returned by pseudoEigenvalueMatrix()
205 /** \brief Returns the block-diagonal matrix in the pseudo-eigendecomposition.
207 * \returns A block-diagonal matrix.
214 * block-diagonal. The blocks on the diagonal are either 1-by-1 or 2-by-2
|
| /external/eigen/bench/ |
| eig33.cpp | 130 // tmp.diagonal().array() -= evals(0);
134 // tmp.diagonal().array() -= evals(1);
138 // tmp.diagonal().array() -= evals(2);
150 tmp.diagonal ().array () -= evals (2);
154 tmp.diagonal ().array () -= evals (1);
|
| /external/eigen/blas/fortran/ |
| chbmv.f | 55 * column, with the leading diagonal of the matrix in row
56 * ( k + 1 ) of the array, the first super-diagonal starting at
73 * column, with the leading diagonal of the matrix in row 1 of
74 * the array, the first sub-diagonal starting at position 1 in
88 * Note that the imaginary parts of the diagonal elements need
|
| zhbmv.f | 55 * column, with the leading diagonal of the matrix in row
56 * ( k + 1 ) of the array, the first super-diagonal starting at
73 * column, with the leading diagonal of the matrix in row 1 of
74 * the array, the first sub-diagonal starting at position 1 in
88 * Note that the imaginary parts of the diagonal elements need
|
| dsbmv.f | 55 * column, with the leading diagonal of the matrix in row
56 * ( k + 1 ) of the array, the first super-diagonal starting at
73 * column, with the leading diagonal of the matrix in row 1 of
74 * the array, the first sub-diagonal starting at position 1 in
|
| /external/gemmlowp/internal/ |
| kernel.h | 73 // There is also a third possibility, "diagonal order",
123 enum class CellOrder { DepthMajor, WidthMajor, Diagonal };
169 case CellOrder::Diagonal:
170 return "Diagonal";
185 case CellOrder::Diagonal:
|
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 204 const Diagonal<const LazyCoeffBasedProductType,0> diagonal() const function in class:Eigen::CoeffBasedProduct
208 const Diagonal<const LazyCoeffBasedProductType,DiagonalIndex> diagonal() const function in class:Eigen::CoeffBasedProduct
211 const Diagonal<const LazyCoeffBasedProductType,Dynamic> diagonal(Index index) const function in class:Eigen::CoeffBasedProduct
212 { return reinterpret_cast<const LazyCoeffBasedProductType&>(*this).diagonal(index); }
|
| TriangularMatrixMatrix_MKL.h | 167 a_tmp.diagonal().setZero(); \
169 a_tmp.diagonal().setOnes();\
281 a_tmp.diagonal().setZero(); \
283 a_tmp.diagonal().setOnes();\
|
| /external/eigen/Eigen/src/Core/util/ |
| Constants.h | 137 * outerStride(), innerStride(), and the RowMajorBit. This rules out expressions such as Diagonal, whose coefficients,
170 /** %Matrix has ones on the diagonal; to be used in combination with #Lower or #Upper. */
172 /** %Matrix has zeros on the diagonal; to be used in combination with #Lower or #Upper. */
174 /** View matrix as a lower triangular matrix with ones on the diagonal. */
176 /** View matrix as an upper triangular matrix with ones on the diagonal. */
178 /** View matrix as a lower triangular matrix with zeros on the diagonal. */
180 /** View matrix as an upper triangular matrix with zeros on the diagonal. */
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 240 VectorType diag = m_T.diagonal(); // contains eigenvalues of A
290 VectorType diag = m_T.diagonal();
360 /** \brief Compute block diagonal part of #m_fT.
362 * This routine computes the matrix function applied to the block diagonal part of #m_T, with the blocking
363 * given by #m_blockStart. The matrix function of each diagonal block is computed by #m_atomic. The
364 * off-diagonal parts of #m_fT are set to zero.
383 /** \brief Compute part of #m_fT above block diagonal.
385 * This routine assumes that the block diagonal part of #m_fT (which
387 * the part above the block diagonal. The part below the diagonal i
[all...] |
| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathMatrixAlgo.cpp | 150 // Compute the SVD: C = U D V^T (U,V rotations, D diagonal).
332 // since if the matrix is already diagonal we'll end up with the identity
393 // We've decided that the off-diagonal entries are already small
473 // since if the matrix is already diagonal we'll end up with the identity
534 // We've decided that the off-diagonal entries are already small
667 // off-diagonal entries of the matrix, 2 at a time. Basically,
682 // However, if we keep doing this, we'll find that the off-diagonal entries
684 // result is a diagonal A matrix and a bunch of orthogonal transforms:
714 // The off-diagonal entries are (effectively) 0, so whatever's left on the
715 // diagonal are the singular values
[all...] |
| /external/ImageMagick/ImageMagick/script/ |
| gradient.html | 143 top/bottom/left/right or diagonal corners.</td>
147 <td><code>-define gradient:extent=<em>{Circle, Diagonal, Ellipse, Maximum, Minimum}</code></td>
154 half-width and half-height of the image. The Diagonal option draws a
156 to the half-diagonal of the image. The Ellipse options draws an elliptical
187 <p>Examples of radial gradients going from black in the center to white at the boundary for the cases of "maximum/circle/default", "minimum", "diagonal", "ellipse" and 45 degree rotated ellipse, respectively, follow below.</p>
203 convert -size 256x128 -define gradient:extent=diagonal radial-gradient:black-white radial_gradient_diagonal.png
|
| /external/ImageMagick/www/ |
| gradient.html | 147 top/bottom/left/right or diagonal corners.</td>
151 <td><code>-define gradient:extent=<em>{Circle, Diagonal, Ellipse, Maximum, Minimum}</code></td>
158 half-width and half-height of the image. The Diagonal option draws a
160 to the half-diagonal of the image. The Ellipse options draws an elliptical
191 <p>Examples of radial gradients going from black in the center to white at the boundary for the cases of "maximum/circle/default", "minimum", "diagonal", "ellipse" and 45 degree rotated ellipse, respectively, follow below.</p>
207 convert -size 256x128 -define gradient:extent=diagonal radial-gradient:black-white radial_gradient_diagonal.png
|
| /external/libhevc/common/ |
| ihevc_common_tables.c | 233 /* Upright diagonal */
273 /* Upright diagonal */
301 /* Upright diagonal */
324 /* Upright diagonal */
364 /* Upright diagonal */
392 /* Upright diagonal */
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| LevenbergMarquardtEstimator.java | 115 /** Diagonal elements of the R matrix in the Q.R. decomposition. */
287 // so let jacobian contain the R matrix with its diagonal elements
492 * @param diag diagonal matrix
668 * @param diag diagonal matrix
669 * @param lmDiag diagonal elements associated with lmDir
676 // in particular, save the diagonal elements of R in lmDir
686 // eliminate the diagonal matrix d using a Givens rotation
690 // diagonal element using p from the Q.R. factorization
722 // compute the modified diagonal element of R and
740 // store the diagonal element of s and restor
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| LevenbergMarquardtOptimizer.java | 112 /** Diagonal elements of the R matrix in the Q.R. decomposition. */
287 // so let jacobian contain the R matrix with its diagonal elements
499 * @param diag diagonal matrix
669 * @param diag diagonal matrix
670 * @param lmDiag diagonal elements associated with lmDir
677 // in particular, save the diagonal elements of R in lmDir
687 // eliminate the diagonal matrix d using a Givens rotation
691 // diagonal element using p from the Q.R. factorization
723 // compute the modified diagonal element of R and
741 // store the diagonal element of s and restor
[all...] |
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| firmware_constants.py | 68 GV.DIAGONAL = 'diagonal'
87 GV.DIAGONAL_DIRECTIONS = [GV.DIAGONAL, GV.BLTR, GV.BRTL, GV.TRBL, GV.TLBR,
|
| test_conf.py | 429 GV.BLTR: ('diagonal', 'from bottom left to top right',),
430 GV.TRBL: ('diagonal', 'from top right to bottom left',),
485 GV.BLTR: ('diagonal', 'from bottom left to top right',),
486 GV.TRBL: ('diagonal', 'from top right to bottom left',),
616 variations=(GV.HORIZONTAL, GV.VERTICAL, GV.DIAGONAL),
622 GV.DIAGONAL: ('diagonally',),
773 GV.TLBR: ('diagonal', 'from the top left to the bottom right',),
[all...] |
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator_test.cc | 127 void EliminateSolveAndCompare(const VectorRef& diagonal,
157 eliminator->Eliminate(A.get(), b.get(), diagonal.data(), &lhs, rhs.data());
172 diagonal.data(),
|
| cgnr_solver.h | 50 // block diagonal preconditioning is supported.
|
| /external/eigen/test/ |
| product_notemporary.cpp | 110 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose().lazyProduct(m3)).diagonal().sum(), 0 );
113 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose() * m3).diagonal().sum(), 0 );
114 VERIFY_EVALUATION_COUNT( Scalar tmp = 0; tmp += Scalar(RealScalar(1)) / (m3.transpose() * m3).diagonal().array().abs().sum(), 0 );
|
| /cts/tests/tests/graphics/src/android/graphics/drawable/shapes/cts/ |
| ArcShapeTest.java | 68 // count number of pixels with TEST_COLOR_2 along diagonal
|
