| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 165 /** Set the threshold used for a diagonal entry to be an acceptable pivot. */
202 * \c NumericalIssue if the LU factorization reports a problem, zero diagonal for instance
263 // Note that the diagonal blocks of U are stored in supernodes,
317 // Note that the diagonal blocks of U are stored in supernodes,
345 // Note that the diagonal blocks of U are stored in supernodes,
392 RealScalar m_diagpivotthresh; // Specifies the threshold used for a diagonal entry to be an acceptable pivot
617 // Sparse LU within the panel, and below the panel diagonal
|
| /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/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 41 * selfadjoint matrix are always real. If \f$ D \f$ is a diagonal matrix with
42 * the eigenvalues on the diagonal, and \f$ V \f$ is a matrix with the
176 * tridiagonal matrix is then brought to diagonal form with implicit
550 // Find non-zero column i0 (by construction, there must exist a non zero coefficient on the diagonal):
551 mat.diagonal().cwiseAbs().maxCoeff(&i0);
580 scaledMat.diagonal().array() -= shift;
612 tmp.diagonal().array () -= eivals(k);
628 tmp.diagonal().array () -= eivals(l);
696 scaledMat.diagonal().array () -= eivals(1);
|
| /external/eigen/test/ |
| sparse_product.cpp | 142 // test matrix - diagonal product
192 refS.diagonal() *= 0.5;
194 // TODO be able to address the diagonal....
|
| qr.cpp | 80 RealScalar absdet = abs(m1.diagonal().prod());
|
| schur_real.cpp | 29 // part of a 2x2 diagonal block with imaginary eigenvalues.
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LevenbergMarquardt.h | 165 /** Sets the step bound for the diagonal shift */
174 /** Use an external Scaling. If set to true, pass a nonzero diagonal to diag() */
177 /** \returns a reference to the diagonal of the jacobian */
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/ |
| indicExceptions.txt | 34 \u09F0 Bengali letter RA with middle diagonal (Assamese)
35 \u09F1 Bengali letter RA with lower diagonal
36 (=Bengali letter VA with lower diagonal, Assamese)
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CornerPathEffectTest.java | 95 // ... but not as few as a diagonal
|
| /cts/tests/tests/graphics/src/android/graphics/drawable/shapes/cts/ |
| OvalShapeTest.java | 61 // count number of pixels with TEST_COLOR_2 along diagonal
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldLUDecomposition.java | 28 * triangular matrix with unit diagonal terms and U is an upper triangular matrix.</p>
|
| LUDecomposition.java | 27 * triangular matrix with unit diagonal terms and U is an upper triangular matrix.</p>
|
| /external/autotest/client/site_tests/firmware_TouchMTB/tests/ |
| geometry_unittest.py | 39 # two points at the same coordinates, a diagonal line
|
| /external/bison/lib/ |
| bitsetv.c | 125 the same as transitive closure but with all bits on the diagonal
|
| /external/ceres-solver/internal/ceres/ |
| block_jacobi_preconditioner.h | 53 // D^TD diagonal term.
|
| block_random_access_diagonal_matrix.h | 50 // A thread safe block diagonal matrix implementation of
|
| block_random_access_diagonal_matrix_test.cc | 67 // Off diagonal entries are not present.
|
| polynomial.cc | 55 companion_matrix_offdiagonal.diagonal().setZero();
97 companion_matrix_offdiagonal.diagonal() = companion_matrix.diagonal();
111 companion_matrix.diagonal(-1).setOnes();
|
| schur_complement_solver.cc | 129 // diagonal.
296 // diagonal.
404 // diagonal.
463 // diagonal.
|
| schur_eliminator.h | 54 // of the variables is such that, E'E is a block diagonal matrix. Or
100 // should be non-null and the diagonal matrix corresponding to it
132 // 1. E'E is a block diagonal matrix.
158 // Complement, e.g., computing the block diagonal of S so that it can
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 130 /** \returns an expression for the bounding box diagonal vector
131 * if the length of the diagonal is needed: diagonal().norm()
134 inline CwiseBinaryOp< internal::scalar_difference_op<Scalar>, const VectorType, const VectorType> diagonal() const function in class:Eigen::AlignedBox
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR_MKL.h | 73 m_maxpivot=m_qr.diagonal().cwiseAbs().maxCoeff(); \
|
| /external/eigen/blas/f2c/ |
| dsbmv.c | 78 /* column, with the leading diagonal of the matrix in row */
79 /* ( k + 1 ) of the array, the first super-diagonal starting at */
96 /* column, with the leading diagonal of the matrix in row 1 of */
97 /* the array, the first sub-diagonal starting at position 1 in */
|
| ssbmv.c | 78 /* column, with the leading diagonal of the matrix in row */
79 /* ( k + 1 ) of the array, the first super-diagonal starting at */
96 /* column, with the leading diagonal of the matrix in row 1 of */
97 /* the array, the first sub-diagonal starting at position 1 in */
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunctionAtomic.h | 20 * Here, an atomic matrix is a triangular matrix whose diagonal
|
