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

1 23 4 5 6 7 8 91011

  /external/eigen/lapack/
slarft.f 37 *> SLARFT 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.
zlarft.f 37 *> ZLARFT 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.
  /frameworks/base/rs/java/android/renderscript/
ScriptIntrinsicBLAS.java 596 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
598 * @param Diag Specifies whether or not A is unit triangular.
615 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
617 * @param Diag Specifies whether or not A is unit triangular.
634 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
636 * @param Diag Specifies whether or not A is unit triangular.
653 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
655 * @param Diag Specifies whether or not A is unit triangular.
    [all...]
  /frameworks/rs/cpp/
rsCppStructs.h     [all...]
  /frameworks/rs/support/java/src/android/support/v8/renderscript/
ScriptIntrinsicBLAS.java 683 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
685 * @param Diag Specifies whether or not A is unit triangular.
710 * @param Uplo Specifies whether the matrix is an upper or lower triangular matrix.
712 * @param Diag Specifies whether or not A is unit triangular.
    [all...]
  /external/eigen/doc/
TutorialSparse.dox 11 <tr><td>\link SparseCore_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><td>SparseMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></tr>
334 \subsection TutorialSparse_TriangularSelfadjoint Triangular and selfadjoint views
336 Just as with dense matrices, the triangularView() function can be used to address a triangular part of the matrix, and perform triangular solves with a dense right hand side:
349 - copy of triangular parts:
351 sm2 = sm1.selfadjointView<Upper>(); // makes a full selfadjoint matrix from the upper triangular part
352 sm2.selfadjointView<Lower>() = sm1.selfadjointView<Upper>(); // copies the upper triangular part to the lower triangular part
357 sm2 = A.selfadjointView<Upper>().twistedBy(P); // compute P S P' from the upper triangular part of A, and make it a full matrix
358 sm2.selfadjointView<Lower>() = A.selfadjointView<Lower>().twistedBy(P); // compute P S P' from the lower triangular part of A, and then only compute the lower par
    [all...]
HiPerformance.dox 14 all kind of matrix products and triangular solvers.
124 Of course all these remarks hold for all other kind of products involving triangular or selfadjoint matrices.
A05_PortingFrom2To3.dox 100 \section PartAndExtract Triangular and self-adjoint matrices
102 In Eigen 2 you had to play with the part, extract, and marked functions to deal with triangular and selfadjoint matrices. In Eigen 3, all these functions have been removed in favor of the concept of \em views:
152 \section TriangularSolveInPlace Triangular in-place solving
209 triangular part to work on (default is lower part)</td></tr>
221 triangular part to work on</td></tr>
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixMatrixTriangular.h 22 * evaluating only one triangular part of the product.
31 /* Optimized matrix-matrix product evaluating only one triangular half */
127 // Optimized packed Block * packed Block product kernel evaluating only one given triangular part
133 // while the triangular block overlapping the diagonal is evaluated into a
135 // triangular traversal.
171 // 2 - triangular accumulation
  /external/tensorflow/tensorflow/core/kernels/
mfcc_mel_filterbank.cc 18 // there is a triangular weighting of the FFT bins that extends from
76 // limit on the high side of the final triangular filter.
169 // square root, then summing FFT magnitudes under triangular integration windows
mfcc.h 37 // triangular mel filterbank, and a discrete cosine transform (DCT) of the
cholesky_grad.cc 66 // Algorithm only depends on lower triangular half on input_matrix_l.
69 // Algorithm only depends on lower triangular half on input_matrix_grad.
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
QRDecomposition.java 43 * <p>R is an upper-triangular matrix</p>
QRDecompositionImpl.java 31 * upper triangular. If A is m&times;n, Q is m&times;m and R m&times;n.</p>
47 * <p>The elements BELOW the diagonal are the elements of the UPPER triangular
256 * <p>The elements BELOW the diagonal are the elements of the UPPER triangular
321 // solve triangular system R.x = y
415 // solve triangular system R.x = y
  /external/eigen/Eigen/
OrderingMethods 61 * // Call the ordering on the pattern of the lower triangular matrix A
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunction.h 27 * Here, an atomic matrix is a triangular matrix whose diagonal entries are close to each other.
43 * \param[in] A argument of matrix function, should be upper triangular and atomic
66 // TODO: Use that A is upper triangular
243 * upper triangular), with the blocking given by \p blockStart and \p clusterSize. The matrix function of
256 /** \brief Solve a triangular Sylvester equation AX + XB = C
258 * \param[in] A the matrix A; should be square and upper triangular
259 * \param[in] B the matrix B; should be square and upper triangular
324 * This routine completes the computation of \p fT, denoting a matrix function applied to the triangular
326 * the diagonal is zero, because \p T is upper triangular.
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineProduct.h 143 //Use matrix lower triangular part
163 //Use matrix upper triangular part
207 //Use matrix upper triangular part
228 //Use matrix lower triangular part
  /external/tensorflow/tensorflow/contrib/distributions/python/ops/
vector_student_t.py 47 * `scale = Sigma`; a lower-triangular matrix in `R^{k x k}`,
109 chol = ... # shape 2 x 3 x 3, lower triangular, positive diagonal.
159 lower triangular matrix. When `None` no `scale_tril` term is added to
160 `scale`. The upper triangular elements above the diagonal are ignored.
  /external/eigen/blas/f2c/
ctbmv.c 47 /* upper or lower triangular band matrix, with ( k + 1 ) diagonals. */
54 /* lower triangular matrix as follows: */
56 /* UPLO = 'U' or 'u' A is an upper triangular matrix. */
58 /* UPLO = 'L' or 'l' A is a lower triangular matrix. */
76 /* triangular as follows: */
78 /* DIAG = 'U' or 'u' A is assumed to be unit triangular. */
81 /* triangular. */
100 /* by n part of the array A must contain the upper triangular */
107 /* triangular band matrix from conventional full matrix storage */
118 /* by n part of the array A must contain the lower triangular */
    [all...]
ztbmv.c 47 /* upper or lower triangular band matrix, with ( k + 1 ) diagonals. */
54 /* lower triangular matrix as follows: */
56 /* UPLO = 'U' or 'u' A is an upper triangular matrix. */
58 /* UPLO = 'L' or 'l' A is a lower triangular matrix. */
76 /* triangular as follows: */
78 /* DIAG = 'U' or 'u' A is assumed to be unit triangular. */
81 /* triangular. */
100 /* by n part of the array A must contain the upper triangular */
107 /* triangular band matrix from conventional full matrix storage */
118 /* by n part of the array A must contain the lower triangular */
    [all...]
  /external/ImageMagick/MagickCore/
pixel.h 115 BilinearInterpolatePixel, /* Triangular filter interpolation */
119 MeshInterpolatePixel, /* Triangular Mesh interpolation */
  /external/eigen/Eigen/src/Eigenvalues/
RealSchur.h 31 * T is a real quasi-triangular matrix. An orthogonal matrix is a matrix whose
32 * inverse is equal to its transpose, \f$ U^{-1} = U^T \f$. A quasi-triangular
33 * matrix is a block-triangular matrix whose diagonal consists of 1-by-1
134 /** \brief Returns the quasi-triangular matrix in the Schur decomposition.
158 * matrix is then reduced to triangular form by performing Francis QR
180 * It computes the upper quasi-triangular matrix T of the Schur decomposition of H
299 // Rows iu+1,...,end are already brought in triangular form.
356 // FIXME to be efficient the following would requires a triangular reduxion code
  /external/eigen/Eigen/src/SparseCore/
SparseProduct.h 88 // sparse * sparse-triangular
94 // sparse-triangular * sparse
  /external/eigen/Eigen/src/SparseLU/
SparseLU_kernel_bmod.h 44 // The result of triangular solve is in tempv[*];
55 // Dense triangular solve -- start effective triangle
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 49 * given by A*P = Q*R where R is upper triangular or trapezoidal.
58 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
59 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank.
130 /** \returns a const reference to the \b sparse upper triangular matrix R of the QR factorization.
133 * and coefficient-wise operations. Matrix products and triangular solves are fine though.
204 // Solve with the triangular matrix R
279 QRMatrixType m_R; // The triangular factor matrix
586 // Permute the triangular factor to put the 'dead' columns to the end

Completed in 612 milliseconds

1 23 4 5 6 7 8 91011