| /external/eigen/Eigen/src/Core/products/ |
| TriangularSolverMatrix.h | 243 // triangular packing (we only pack the panels off the diagonal,
244 // neglecting the blocks overlapping the diagonal
267 // for each small block of the diagonal (=> vertical panels of rhs)
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 37 * diagonal of the matrix T corresponds to the eigenvalues of the
289 // diagonal block on the bottom of the active submatrix
307 // choose the eigenvalue closest to the bottom entry of the diagonal
|
| /external/eigen/blas/ |
| level3_impl.h | 551 matrix(c, *n, *n, *ldc).diagonal().real() *= beta;
552 matrix(c, *n, *n, *ldc).diagonal().imag().setZero();
559 matrix(c, *n, *n, *ldc).diagonal().imag().setZero();
[all...] |
| /external/eigen/unsupported/Eigen/src/SVD/ |
| JacobiSVD.h | 452 * 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;
453 * 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
676 // if this 2x2 sub-matrix is not diagonal already...
686 // perform SVD decomposition of 2x2 sub-matrix corresponding to indices p,q to make it diagonal
702 /*** step 3. The work matrix is now diagonal, so ensure it's positive so its diagonal entries are the singular values ***/
|
| SVDBase.h | 29 * 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;
30 * 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
|
| /external/chromium-trace/catapult/tracing/third_party/gl-matrix/src/gl-matrix/ |
| mat2.js | 286 * Returns L, D and U matrices (Lower triangular, Diagonal and Upper triangular) by factorizing the input matrix
288 * @param {mat2} D the diagonal matrix
|
| /external/eigen/doc/ |
| TutorialMatrixArithmetic.dox | 177 The \em trace of a matrix, as returned by the function \link MatrixBase::trace() trace()\endlink, is the sum of the diagonal coefficients and can also be computed as efficiently using <tt>a.diagonal().sum()</tt>, as we will see later on.
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 137 //Use matrix diagonal part <- Improvement : use inner iterator on dense matrix.
200 //Use matrix diagonal part <- Improvement : use inner iterator on dense matrix.
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_houghlines/ |
| py_houghlines.markdown | 36 need 180 columns. For \f$\rho\f$, the maximum distance possible is the diagonal length of the image. So
37 taking one pixel accuracy, number of rows can be diagonal length of the image.
|
| /external/opencv3/doc/tutorials/ml/introduction_to_pca/ |
| introduction_to_pca.markdown | 78 where __D__ is the diagonal matrix of eigenvalues of __C__.
80 - Matrix __D__ will take the form of an \f$ p \times p \f$ diagonal matrix:
|
| /external/pdfium/third_party/libopenjpeg20/ |
| invert.c | 175 /* now compute up data (i.e. coeff up of the diagonal). */
178 /* divide the lower column elements by the diagonal value */
|
| /packages/inputmethods/LatinIME/java/res/xml/ |
| rowkeys_bengali_akkhor3.xml | 92 U+09F1: "?" BENGALI LETTER RA WITH MIDDLE DIAGONAL
93 U+09F0: "?" BENGALI LETTER RA WITH LOWER DIAGONAL -->
|
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| Geometry.h | 134 // 1) Divide the quadrilateral into two triangles by scribing a diagonal
|
| /external/ceres-solver/docs/source/ |
| bibliography.rst | 68 .. [Mandel] J. Mandel, **On block diagonal and Schur complement
|
| /external/ceres-solver/internal/ceres/ |
| cgnr_linear_operator.h | 44 // A linear operator which takes a matrix A and a diagonal vector D and
|
| dense_normal_cholesky_solver.cc | 123 // Temporarily append a diagonal block to the A matrix, but undo
|
| dogleg_strategy.h | 104 // mu is used to scale the diagonal matrix used to make the
|
| dynamic_compressed_row_sparse_matrix.h | 87 // be appended to the `CompressedRowSparseMatrix` (e.g. appending a diagonal
|
| implicit_schur_complement.h | 79 // (which for our purposes is an easily inverted block diagonal
|
| implicit_schur_complement_test.cc | 192 // support for the LM diagonal is correct.
|
| iterative_schur_complement_solver.cc | 101 // complement matrix with the block diagonal of the matrix F'F as
|
| preconditioner.h | 118 // D can be NULL, in which case its interpreted as a diagonal matrix
|
| schur_complement_solver_test.cc | 80 // Gold standard solution with appended diagonal.
|
| schur_eliminator_impl.h | 186 // Add the diagonal to the schur complement.
202 m.block(r, c, block_size, block_size).diagonal()
419 // this function computes twp matrices. The diagonal block matrix
423 // and the off diagonal blocks in the Guass Newton Hessian.
|
| triplet_sparse_matrix.h | 102 // Build a sparse diagonal matrix of size num_rows x num_rows from
|
