HomeSort by relevance Sort by last modified time
    Searched full:triangular (Results 26 - 50 of 265) sorted by null

12 3 4 5 6 7 8 91011

  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMqrsolv.h 39 // the following will only change the lower triangular part of s, including
85 /* solve the triangular system for z. if the system is */
119 // the following will only change the lower triangular part of s, including
140 // Browse the nonzero elements of row j of the upper triangular s
171 // Solve the triangular system for z. If the system is
  /external/tensorflow/tensorflow/contrib/distributions/python/ops/
mvn_tril.py 64 where `scale_tril` is lower-triangular `k x k` matrix with non-zero diagonal,
78 Trainable (batch) lower-triangular matrices can be created with
115 tril = ... # shape: [2, 3, 3], lower triangular, non-zero diagonal.
157 where `scale_tril` is lower-triangular `k x k` matrix with non-zero
166 scale_tril: Floating-point, lower-triangular `Tensor` with non-zero
  /external/eigen/Eigen/src/Core/products/
TriangularSolverMatrix.h 36 /* Optimized triangular solver with multiple right hand side and the triangular matrix on the left
97 // A11 (the triangular part) and A21 the remaining rectangular part.
106 // Each panel can be split into a small triangular part T1k which is processed without optimization,
186 /* Optimized triangular solver with multiple left hand sides and the triangular matrix on the right
247 // triangular packing (we only pack the panels off the diagonal,
269 // triangular solver kernel
295 // unblocked triangular solve
SelfadjointRank2Update.h 73 // If MatrixType is row major, then we use the routine for lower triangular in the upper triangular case and
TriangularSolverMatrix_BLAS.h 29 * Triangular matrix * matrix product functionality based on ?TRMM.
40 // implements LeftSide op(triangular)^-1 * general
93 // implements RightSide general * op(triangular)^-1
TriangularMatrixMatrix_BLAS.h 29 * Triangular matrix * matrix product functionality based on ?TRMM.
77 // implements col-major += alpha * op(triangular) * op(general)
109 /* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \
188 // implements col-major += alpha * op(general) * op(triangular)
220 /* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixSquareRoot.h 117 // pre: T is quasi-upper-triangular and sqrtT is a zero matrix of the same size
137 // pre: T is quasi-upper-triangular and diagonal blocks of sqrtT are square root of diagonal blocks of T.
167 * \brief Compute matrix square root of quasi-triangular matrix.
175 * This function computes the square root of the upper quasi-triangular matrix stored in the upper
192 * \brief Compute matrix square root of triangular matrix.
198 * \param[out] result matrix square root of upper triangular part of \p arg.
200 * Only the upper triangular part (including the diagonal) of \p result is updated, the rest is not
214 // Compute square root of arg and store it in upper triangular part of result
215 // This uses that the square root of triangular matrices can be computed directly.
  /external/eigen/test/
schur_complex.cpp 19 // Test basic functionality: T is triangular and A = U T U*
62 cs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations
schur_real.cpp 42 // Test basic functionality: T is quasi-triangular and A = U T U*
83 rs3.setMaxIterations(1).compute(Atriangular); // triangular matrices do not need any iterations
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
qrsolv.h 27 // the following will only change the lower triangular part of s, including
73 /* solve the triangular system for z. if the system is */
  /external/walt/android/WALT/app/src/main/java/org/chromium/latency/walt/
TouchCatcherView.java 65 // Triangular wave with unit amplitude
77 // Higher value gives less smoothing = closer to original triangular wave.
  /external/eigen/Eigen/src/Core/arch/Default/
Settings.h 34 /** Defines the maximal width of the blocks used in the triangular product and solver
  /external/tensorflow/tensorflow/contrib/bayesflow/python/ops/
csiszar_divergence.py 48 'triangular',
  /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/
TriangleShape.java 26 * that creates a shape with a triangular path (pointing up or down).
  /packages/apps/Launcher3/src/com/android/launcher3/graphics/
TriangleShape.java 26 * that creates a shape with a triangular path (pointing up or down).
  /external/eigen/Eigen/src/Householder/
BlockHouseholder.h 41 // // FIXME add .noalias() once the triangular product can work inplace
66 // FIXME add .noalias() once the triangular product can work inplace
93 // FIXME add .noalias() once the triangular product can work inplace
  /external/eigen/doc/
QuickReference.dox 16 <tr ><td>\link Core_Module Core \endlink</td><td>\code#include <Eigen/Core>\endcode</td><td>Matrix and Array classes, basic linear algebra (including triangular and selfadjoint products), array manipulation</td></tr>
596 <a href="#" class="top">top</a>\section QuickRef_DiagTriSymm Diagonal, Triangular, and Self-adjoint matrices
633 \subsection QuickRef_TriangularView Triangular views
635 TriangularView gives a view on a triangular part of a dense matrix and allows to perform optimized operations on it. The opposite triangular part is never referenced and can be used to store other information.
643 Reference to a triangular with optional \n
651 Writing to a specific triangular part:\n (only the referenced triangular part is evaluated)
656 Conversion to a dense matrix setting the opposite triangular part to zero:
680 Just as for triangular matrix, you can reference any triangular part of a square matrix to see it as a selfadjoin
    [all...]
  /external/eigen/Eigen/src/Eigenvalues/
GeneralizedSelfAdjointEigenSolver.h 33 * Only the \b lower \b triangular \b part of the input matrix is referenced.
83 * Only the lower triangular part of the matrix is referenced.
85 * Only the lower triangular part of the matrix is referenced.
116 * Only the lower triangular part of the matrix is referenced.
118 * Only the lower triangular part of the matrix is referenced.
ComplexSchur.h 36 * complex matrix, and T is a complex upper triangular matrix. The
145 /** \brief Returns the triangular matrix in the Schur decomposition.
156 * only the upper triangular part, use:
178 * to triangular form by performing QR iterations with a single
201 * It computes the upper quasi-triangular matrix T of the Schur decomposition of H
385 // Reduce the Hessenberg matrix m_matT to triangular form by QR iteration.
396 // Rows iu+1,...,end are already brought in triangular form.
  /external/eigen/blas/f2c/
dspmv.c 48 /* triangular part of the matrix A is supplied in the packed */
51 /* UPLO = 'U' or 'u' The upper triangular part of A is */
54 /* UPLO = 'L' or 'l' The lower triangular part of A is */
71 /* contain the upper triangular part of the symmetric matrix */
76 /* contain the lower triangular part of the symmetric matrix */
sspmv.c 48 /* triangular part of the matrix A is supplied in the packed */
51 /* UPLO = 'U' or 'u' The upper triangular part of A is */
54 /* UPLO = 'L' or 'l' The lower triangular part of A is */
71 /* contain the upper triangular part of the symmetric matrix */
76 /* contain the lower triangular part of the symmetric matrix */
dsbmv.c 49 /* triangular part of the band matrix A is being supplied as */
52 /* UPLO = 'U' or 'u' The upper triangular part of A is */
55 /* UPLO = 'L' or 'l' The lower triangular part of A is */
76 /* by n part of the array A must contain the upper triangular */
83 /* triangular part of a symmetric band matrix from conventional */
94 /* by n part of the array A must contain the lower triangular */
101 /* triangular part of a symmetric band matrix from conventional */
ssbmv.c 49 /* triangular part of the band matrix A is being supplied as */
52 /* UPLO = 'U' or 'u' The upper triangular part of A is */
55 /* UPLO = 'L' or 'l' The lower triangular part of A is */
76 /* by n part of the array A must contain the upper triangular */
83 /* triangular part of a symmetric band matrix from conventional */
94 /* by n part of the array A must contain the lower triangular */
101 /* triangular part of a symmetric band matrix from conventional */
  /external/eigen/lapack/
clarft.f 37 *> CLARFT forms the triangular factor T of a complex block reflector H
40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
42 *> If DIRECT = 'B', H = H(k) . . . H(2) H(1) and T is lower triangular.
85 *> The order of the triangular factor T (= the number of
114 *> The k by k triangular factor T of the block reflector.
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
116 *> lower triangular. The rest of the array is not used.
dlarft.f 37 *> DLARFT forms the triangular factor T of a real block reflector H
40 *> If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular;
42 *> If DIRECT = 'B', H = H(k) . . . H(2) H(1) and T is lower triangular.
85 *> The order of the triangular factor T (= the number of
114 *> The k by k triangular factor T of the block reflector.
115 *> If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is
116 *> lower triangular. The rest of the array is not used.

Completed in 366 milliseconds

12 3 4 5 6 7 8 91011