HomeSort by relevance Sort by last modified time
    Searched full:diagonal (Results 76 - 100 of 328) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/eigen/blas/
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/NonLinearOptimization/
covar.h 64 r.diagonal() = wa;
  /external/ceres-solver/internal/ceres/
schur_complement_solver.h 59 // of the variables is such that, E'E is a block diagonal
79 // should be non-null and the diagonal matrix corresponding to it
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 72 // Minimum and maximum values of the diagonal damping matrix used
74 // these bounds to construct a regularizing diagonal to ensure
visibility_based_preconditioner.cc 154 // visibility. The clusters form the diagonal blocks of the
383 // The scaling only affects the tri-diagonal case, since
389 VLOG(1) << "Unscaled factorization failed. Retrying with off-diagonal "
401 // to edges in the degree-2 forest are off diagonal entries of this
402 // matrix. Scaling these off-diagonal entries by 1/2 forces this
423 // Ah the magic of tri-diagonal matrices and diagonal
compressed_row_sparse_matrix.cc 170 CompressedRowSparseMatrix::CompressedRowSparseMatrix(const double* diagonal,
172 CHECK_NOTNULL(diagonal);
185 values_[i] = diagonal[i];
schur_complement_solver.cc 132 // diagonal.
279 // diagonal.
359 // diagonal.
visibility_based_preconditioner.h 106 // be a block diagonal matrix with blocks corresponding to the
122 // correspond to tri-diagonal matrices. Thus there exist a permutation
172 // D can be NULL, in which case its interpreted as a diagonal matrix
  /external/eigen/test/eigen2/
eigen2_sparse_product.cpp 55 // test matrix - diagonal product
88 refS.diagonal() *= 0.5;
eigen2_triangular.cpp 69 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal());
  /external/icu4c/test/testdata/
translit_rules.txt 115 \ue071>\u09F0; # LETTER RA WITH MIDDLE DIAGONAL
116 \ue072>\u09F1; # LETTER RA WITH LOWER DIAGONAL
  /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/IterativeLinearSolvers/
IncompleteLUT.h 23 * (in addition to the diagonal element ). Note that @p fill is computed from
133 /** keeps off-diagonal entries; drops diagonal entries */
410 // store the diagonal element
428 sizeu = len + 1; // +1 to take into account the diagonal element
  /packages/apps/Camera/jni/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*/
  /packages/apps/Gallery2/jni_mosaic/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*/
  /packages/apps/LegacyCamera/jni/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*/
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 159 /** Sets the shift parameters that will be used to adjust the diagonal coefficients during the numerical factorization.
161 * During the numerical factorization, the diagonal coefficients are transformed by the following linear model:\n
280 /** keeps off-diagonal entries; drops diagonal entries */
294 VectorType m_diag; // the diagonal coefficients (LDLT mode)
427 Scalar detL = Base::m_matrix.diagonal().prod();
472 /** \returns a vector expression of the diagonal D */
662 Scalar detL = Diagonal<const CholMatrixType>(Base::m_matrix).prod();
681 // remove diagonal entries:
  /external/eigen/test/
sparse_product.cpp 122 // test matrix - diagonal product
154 refS.diagonal() *= 0.5;
156 // TODO be able to address the diagonal....
  /cts/tests/tests/graphics/src/android/graphics/cts/
CornerPathEffectTest.java 95 // ... but not as few as a diagonal
  /external/bison/lib/
bitsetv.c 125 the same as transitive closure but with all bits on the diagonal

Completed in 3113 milliseconds

1 2 34 5 6 7 8 91011>>