| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 43 * selfadjoint matrix are always real. If \f$ D \f$ is a diagonal matrix with
44 * the eigenvalues on the diagonal, and \f$ V \f$ is a matrix with the
185 * tridiagonal matrix is then brought to diagonal form with implicit
229 * \param[in] diag The vector containing the diagonal of the matrix.
378 * \param diag the diagonal part of the input selfadjoint tridiagonal matrix
379 * \param subdiag the sub-diagonal part of the input selfadjoint tridiagonal matrix
474 * \param[in,out] diag : On input, the diagonal of the matrix, on output the eigenvalues
610 // Find non-zero column i0 (by construction, there must exist a non zero coefficient on the diagonal):
611 mat.diagonal().cwiseAbs().maxCoeff(&i0);
641 scaledMat.diagonal().array() -= shift
[all...] |
| 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
191 * block-diagonal matrix \f$ D \f$ returned by pseudoEigenvalueMatrix()
206 /** \brief Returns the block-diagonal matrix in the pseudo-eigendecomposition.
208 * \returns A block-diagonal matrix.
215 * block-diagonal. The blocks on the diagonal are either 1-by-1 or 2-by-2
|
| /external/lmfit/lib/ |
| lmmin.c | 285 * to contain an upper triangular matrix R with diagonal elements of
300 * with diagonal elements of nonincreasing magnitude. Column j of P
556 /* Given an m by n matrix A, an n by n nonsingular diagonal matrix D,
570 * an upper triangular matrix with diagonal elements of nonincreasing
599 * diag is an INPUT array of length n which must contain the diagonal
616 * contains the diagonal elements of the upper triangular matrix S.
772 * upper trapezoidal matrix R with diagonal elements of nonincreasing
796 * Rdiag is an OUTPUT array of length n which contains the diagonal
904 * Given an m by n matrix A, an n by n diagonal matrix D, and a
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 27 * Here, an atomic matrix is a triangular matrix whose diagonal entries are close to each other.
240 /** \brief Compute block diagonal part of matrix function.
242 * This routine computes the matrix function applied to the block diagonal part of \p T (which should be
244 * each diagonal block is computed by \p atomic. The off-diagonal parts of \p fT are set to zero.
322 /** \brief Compute part of matrix function above block diagonal.
325 * matrix \p T. It assumes that the block diagonal part of \p fT has already been computed. The part below
326 * the diagonal is zero, because \p T is upper triangular.
437 matrix_function_partition_eigenvalues(T.diagonal(), clusters);
449 matrix_function_compute_map(T.diagonal(), clusters, eivalToCluster)
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 418 // update largest diagonal entry
420 // and check whether the 2x2 block is already diagonal
447 * where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal;
448 * the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left
697 RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff();
710 // if this 2x2 sub-matrix is not diagonal already...
717 // perform SVD decomposition of 2x2 sub-matrix corresponding to indices p,q to make it diagonal
718 // the complex to real operation returns true if the updated 2x2 block is not already diagonal
731 // keep track of the largest diagonal coefficient
739 /*** step 3. The work matrix is now diagonal, so ensure it's positive so its diagonal entries 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/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteCholesky.h | 33 * where L is a lower triangular factor, S is a diagonal scaling matrix, and P is a
37 * and \f$ \beta \f$ be the minimum value of the diagonal. If \f$ \beta > 0 \f$ then, the factorization is directly performed
206 // The temporary is needed to make sure that the diagonal entry is properly sorted
273 // Apply the shift to the diagonal elements of the matrix
350 // p is the original number of elements in the column (without the diagonal)
365 // Get the first smallest row index and put it after the diagonal element
|
| IncompleteLUT.h | 78 * (in addition to the diagonal element ). Note that @p fill is computed from
181 /** keeps off-diagonal entries; drops diagonal entries */
227 // it is highly preferable to keep the diagonal through symmetric permutations.
425 // store the diagonal element
443 sizeu = len + 1; // +1 to take into account the diagonal element
|
| /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/libopus/silk/fixed/ |
| corrMatrix_FIX.c | 110 /* Fill out the diagonal of the correlation matrix */
129 /* Calculate remaining off diagonal: X[:,j]'*X[:,j + lag] */
146 /* Calculate remaining off diagonal: X[:,j]'*X[:,j + lag] */
|
| /compatibility/cdd/2_device-types/ |
| 2_3_television-reqs.md | 13 * Have an embedded screen display with the diagonal length larger than 24
|
| 2_4_watch-reqs.md | 9 * Have a screen with the physical diagonal length in the range from 1.1 to 2.5
|
| 2_5_automotive-reqs.md | 21 * [A-0-1] MUST have a screen with the physical diagonal length equal to or greater
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix_BLAS.h | 164 a_tmp.diagonal().setZero(); \
166 a_tmp.diagonal().setOnes();\
274 a_tmp.diagonal().setZero(); \
276 a_tmp.diagonal().setOnes();\
|
| SelfadjointMatrixMatrix.h | 17 // pack a selfadjoint block diagonal for use with the gebp_kernel
35 blockA[count++] = numext::real(lhs(k,k)); // real (diagonal)
75 blockA[count++] = numext::real(lhs(i, i)); // real (diagonal)
118 // second part: diagonal block
367 // 1 - the transposed panel above the diagonal block => transposed packed copy
368 // 2 - the diagonal block => special packed copy
369 // 3 - the panel below the diagonal block => generic packed copy
378 // the block diagonal
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 77 r.diagonal() = wa;
|
| LevenbergMarquardt.h | 166 /** Sets the step bound for the diagonal shift */
175 /** Use an external Scaling. If set to true, pass a nonzero diagonal to diag() */
187 /** \returns the step bound for the diagonal shift */
196 /** \returns a reference to the diagonal of the jacobian */
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 65 r.diagonal() = wa;
|
| /external/skia/bench/ |
| ShapesBench.cpp | 105 float diagonal = sqrtf(static_cast<float>(fShapesSize.width() * fShapesSize.width()) + local
107 if (diagonal > maxDiagonal) {
108 fShapesSize.fWidth = static_cast<int>(fShapesSize.width() * maxDiagonal / diagonal);
109 fShapesSize.fHeight = static_cast<int>(fShapesSize.height() * maxDiagonal / diagonal);
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 42 visited(j) = j; // Do not include the diagonal element
75 visited(j) = j; // Do not include the diagonal element
|
