| /external/eigen/blas/fortran/ |
| ssbmv.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
|
| ctbmv.f | 73 * column, with the leading diagonal of the matrix in row
74 * ( k + 1 ) of the array, the first super-diagonal starting at
91 * column, with the leading diagonal of the matrix in row 1 of
92 * the array, the first sub-diagonal starting at position 1 in
107 * corresponding to the diagonal elements of the matrix are not
|
| dtbmv.f | 73 * column, with the leading diagonal of the matrix in row
74 * ( k + 1 ) of the array, the first super-diagonal starting at
91 * column, with the leading diagonal of the matrix in row 1 of
92 * the array, the first sub-diagonal starting at position 1 in
107 * corresponding to the diagonal elements of the matrix are not
|
| stbmv.f | 73 * column, with the leading diagonal of the matrix in row
74 * ( k + 1 ) of the array, the first super-diagonal starting at
91 * column, with the leading diagonal of the matrix in row 1 of
92 * the array, the first sub-diagonal starting at position 1 in
107 * corresponding to the diagonal elements of the matrix are not
|
| ztbmv.f | 73 * column, with the leading diagonal of the matrix in row
74 * ( k + 1 ) of the array, the first super-diagonal starting at
91 * column, with the leading diagonal of the matrix in row 1 of
92 * the array, the first sub-diagonal starting at position 1 in
107 * corresponding to the diagonal elements of the matrix are not
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteCholesky.h | 173 // Apply the shift to the diagonal elements of the matrix
205 std::cerr << "\nNegative diagonal during Incomplete factorization... "<< j << "\n";
219 // p is the original number of elements in the column (without the diagonal)
230 // Get the first smallest row index and put it after the diagonal element
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 78 r.diagonal() = wa;
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 65 r.diagonal() = wa;
|
| /external/skia/bench/ |
| ShapesBench.cpp | 106 float diagonal = sqrtf(static_cast<float>(fShapesSize.width() * fShapesSize.width()) + local
108 if (diagonal > maxDiagonal) {
109 fShapesSize.fWidth = static_cast<int>(fShapesSize.width() * maxDiagonal / diagonal);
110 fShapesSize.fHeight = static_cast<int>(fShapesSize.height() * maxDiagonal / diagonal);
|
| /external/ceres-solver/internal/ceres/ |
| dense_sparse_matrix.cc | 55 // Allocate enough space for the diagonal.
126 // Leave the diagonal reserved.
|
| symmetric_linear_solver_test.cc | 50 double diagonal[] = { 1.0, 1.0, 1.0 }; local
52 A(TripletSparseMatrix::CreateSparseDiagonalMatrix(diagonal, 3));
|
| trust_region_strategy.h | 74 // Minimum and maximum values of the diagonal damping matrix used
76 // these bounds to construct a regularizing diagonal to ensure
|
| visibility_based_preconditioner.cc | 137 // visibility. The clusters form the diagonal blocks of the
380 // The scaling only affects the tri-diagonal case, since
386 VLOG(1) << "Unscaled factorization failed. Retrying with off-diagonal "
398 // to edges in the degree-2 forest are off diagonal entries of this
399 // matrix. Scaling these off-diagonal entries by 1/2 forces this
420 // Ah the magic of tri-diagonal matrices and 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
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 120 /** Sets the shift parameters that will be used to adjust the diagonal coefficients during the numerical factorization.
122 * During the numerical factorization, the diagonal coefficients are transformed by the following linear model:\n
220 /** keeps off-diagonal entries; drops diagonal entries */
234 VectorType m_diag; // the diagonal coefficients (LDLT mode)
371 Scalar detL = Base::m_matrix.diagonal().prod();
417 /** \returns a vector expression of the diagonal D */
607 Scalar detL = Diagonal<const CholMatrixType>(Base::m_matrix).prod();
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 55 // test matrix - diagonal product
88 refS.diagonal() *= 0.5;
|
| eigen2_triangular.cpp | 59 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal());
|
| /external/icu/icu4c/source/test/testdata/ |
| translit_rules.txt | 115 \ue071>\u09F0; # LETTER RA WITH MIDDLE DIAGONAL
116 \ue072>\u09F1; # LETTER RA WITH LOWER DIAGONAL
|
| /frameworks/av/services/audioflinger/tests/ |
| mixer_to_wav_tests.sh | 7 # show up as clear lines, either horizontal or diagonal,
28 # (sine = horizontal, chirp = diagonal) which should
|
| /development/samples/TicTacToeLib/src/com/example/android/tictactoe/library/ |
| GameView.java | 193 /** Sets winning mark on specified column or row (0..2) or diagonal (0..1). */
194 public void setFinished(int col, int row, int diagonal) {
197 mWinDiag = diagonal;
255 // diagonal 0 is from (0,0) to (2,2)
261 // diagonal 1 is from (0,2) to (2,0)
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular.h | 101 // 1 - before the diagonal => processed with gebp or skipped
103 // 3 - after the diagonal => processed with gebp or skipped
125 // - then, as usual, each panel is split into three parts along the diagonal,
126 // the sub blocks above and below the diagonal are processed as usual,
127 // while the triangular block overlapping the diagonal is evaluated into a
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 75 * (in addition to the diagonal element ). Note that @p fill is computed from
179 /** keeps off-diagonal entries; drops diagonal entries */
413 // store the diagonal element
431 sizeu = len + 1; // +1 to take into account the diagonal element
|
| /external/eigen/blas/f2c/ |
| dtbmv.c | 98 /* column, with the leading diagonal of the matrix in row */
99 /* ( k + 1 ) of the array, the first super-diagonal starting at */
116 /* column, with the leading diagonal of the matrix in row 1 of */
117 /* the array, the first sub-diagonal starting at position 1 in */
132 /* corresponding to the diagonal elements of the matrix are not */
|
| stbmv.c | 98 /* column, with the leading diagonal of the matrix in row */
99 /* ( k + 1 ) of the array, the first super-diagonal starting at */
116 /* column, with the leading diagonal of the matrix in row 1 of */
117 /* the array, the first sub-diagonal starting at position 1 in */
132 /* corresponding to the diagonal elements of the matrix are not */
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_linalg.cpp | 30 subdiagonal part in A and diagonal in d, which is 6-dimensional*/
77 above diagonal of A is used from the input, diagonal of A is assumed to
79 subdiagonal part in A and diagonal in d, which is n-dimensional*/
120 above diagonal of A is used from the input, diagonal of A is assumed to
122 and diagonal in d, which is 3-dimensional*/
|
