Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:triangular (Results 1 - 25 of 265) sorted by null

1 2 3 4 5 6 7 8 91011

/external/eigen/doc/snippets/
MatrixBase_triangularView.cpp	3 cout << "Here is the upper-triangular matrix extracted from m:" << endl 5 cout << "Here is the strictly-upper-triangular matrix extracted from m:" << endl 7 cout << "Here is the unit-lower-triangular matrix extracted from m:" << endl
ComplexSchur_matrixT.cpp	4 cout << "The triangular matrix T is:" << endl << schurOfA.matrixT() << endl;
RealSchur_RealSchur_MatrixType.cpp	6 cout << "The quasi-triangular matrix T is:" << endl << schur.matrixT() << endl << endl;
Triangular_solve.cpp	8 " m is upper-triangular:\n"
/external/tensorflow/tensorflow/core/api_def/base_api/
api_def_CholeskyGrad.pbtxt	7 Algorithm depends only on lower triangular part of the innermost matrices of 15 Algorithm depends only on lower triangular part of the innermost matrices of
api_def_MatrixTriangularSolve.pbtxt	25 lower or upper triangular. 39 summary: "Solves systems of linear equations with upper or lower triangular matrices by" 44 square matrices. If `lower` is `True` then the strictly upper triangular part 46 If `lower` is False then the strictly lower triangular part of each inner-most
api_def_Cholesky.pbtxt	20 The input has to be symmetric and positive definite. Only the lower-triangular 21 part of the input will be used for this operation. The upper-triangular part
api_def_Qr.pbtxt	21 Triangular factor. If `full_matrices` is `False` then shape is 40 # r is a tensor of upper triangular matrices.
api_def_MatrixBandPart.pbtxt	66 tf.matrix_band_part(input, 0, -1) ==> Upper triangular part. 67 tf.matrix_band_part(input, -1, 0) ==> Lower triangular part.
/external/eigen/bench/btl/data/
action_settings.txt	8 trmm ; "{/*1.5 triangular matrix matrix product}" ; "matrix size" ; 4:5000 9 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:5000 10 trisolve_matrix ; "{/*1.5 triangular solver - matrix (M = inv(L) M)}" ; "size" ; 4:5000
/external/tensorflow/tensorflow/contrib/distributions/python/ops/bijectors/
cholesky_outer_product.py	40 """Compute `g(X) = X @ X.T`; X is lower-triangular, positive-diagonal matrix. 44 Note: the upper-triangular part of X is ignored (whether or not its zero). 47 lower-triangular matrices to the set of SPD matrices follows immediately from 49 positive-diagonal lower-triangular matrix L such that `A = L @ L.T`. 51 To prove the injectivity of g, suppose that L_1 and L_2 are lower-triangular 55 lower-triangular matrix follows from `inv(L_1)` being positive-diagonal 56 lower-triangular (which follows from the diagonal of a triangular matrix being 57 its spectrum), and that the product of two positive-diagonal lower-triangular 58 matrices is another positive-diagonal lower-triangular matrix     [all...]
/external/eigen/Eigen/src/Core/
TriangularMatrix.h	25 * \brief Base class for triangular part in a matrix 153 * \brief Expression of a triangular part in a matrix 155 * \param MatrixType the type of the object in which we are taking the triangular part 156 * \param Mode the kind of triangular matrix expression to construct. Can be #Upper, 161 * This class represents a triangular part of a matrix, not necessarily square. Strictly speaking, for rectangular 286 /** \returns a selfadjoint view of the referenced triangular part which must be either \c #Upper or \c #Lower. 306 /** \returns the determinant of the triangular matrix 326 * \brief Base class for a triangular part in a \b dense matrix 403 * \warning the coordinates must fit into the referenced triangular part 413 * \warning the coordinates must fit into the referenced triangular par     [all...]
SelfAdjointView.h	19 * \brief Expression of a selfadjoint matrix from a triangular part of a dense matrix 24 * This class is an expression of a sefladjoint matrix from a triangular part of a matrix 86 * \warning the coordinates must fit into the referenced triangular part 96 * \warning the coordinates must fit into the referenced triangular part 115 /** Efficient triangular matrix times vector/matrix product */ 124 /** Efficient vector/matrix times triangular matrix product */ 145 * a adjoint expression without any overhead. Only the meaningful triangular 168 /** \returns an expression of a triangular view extracted from the current selfadjoint view of a given triangular part 173 * If \c TriMode references the same triangular part than \c *this, then this method simply return a \c TriangularView of the nested expression     [all...]
/external/tensorflow/tensorflow/core/kernels/
mfcc_mel_filterbank.h	34 // triangular-mel-weighted linear-magnitude filterbank, and places the result 47 // Each FFT bin b contributes to two triangular mel channels, with 51 // upper-half of the triangular band.
cholesky_op.cc	61 // the lower triangular part of data_in by default. The upper triangular 70 // Output the lower triangular in a dense form. 132 // Copy the lower triangular part of the input matrices to the output and 133 // set the strictly upper triangular part to zero. We use a pre-existing
/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> 52 * <p>L is an lower-triangular matrix</p> 59 * <p>U is an upper-triangular matrix</p>
LUDecomposition.java	27 * triangular matrix with unit diagonal terms and U is an upper triangular matrix.</p> 50 * <p>L is an lower-triangular matrix</p> 57 * <p>U is an upper-triangular matrix</p>
CholeskyDecomposition.java	47 * <p>L is an lower-triangular matrix</p> 54 * <p>L<sup>T</sup> is an upper-triangular matrix</p>
/external/eigen/Eigen/src/Core/products/
TriangularMatrixMatrix.h	41 /* Optimized triangular matrix * matrix (_TRMM++) product built on top of 78 // implements col-major += alpha * op(triangular) * op(general) 158 // align blocks with the end of the triangular part for trapezoidal lhs 183 // => GEBP with the micro triangular block 184 // The trick is to pack this micro block while filling the opposite triangular part with zeros. 185 // To this end we do an extra triangular copy to a small temporary buffer 229 // implements col-major += alpha * op(general) * op(triangular) 306 // align blocks with the end of the triangular part for trapezoidal rhs 315 // size of the triangular part 323 // pack the triangular part of the rhs padding the unrolled blocks with zero     [all...]
TriangularMatrixVector_BLAS.h	29 * Triangular matrix-vector product functionality based on ?TRMV. 41 * This file implements triangular matrix-vector multiplication using BLAS 73 // implements col-major: res += alpha * op(triangular) * vector 128 /* Non-square case - doesn't fit to BLAS ?TRMV. Fall to default triangular product*/ \ 155 // implements row-major: res += alpha * op(triangular) * vector 210 /* Non-square case - doesn't fit to BLAS ?TRMV. Fall to default triangular product*/ \
/external/eigen/Eigen/src/SparseLU/
SparseLU_SupernodalMatrix.h	22 * Only the lower triangular matrix has supernodes. 30 * Function for triangular solve 56 * Set appropriate pointers for the lower triangular supernodal matrix 218 const MappedSuperNodalMatrix& m_matrix; // Supernodal lower triangular matrix 229 * \brief Solve with the supernode triangular matrix 272 // Triangular solve
/external/tensorflow/tensorflow/python/ops/linalg/
linear_operator_lower_triangular.py	15 """`LinearOperator` acting like a lower triangular matrix.""" 38 """`LinearOperator` acting like a [batch] square lower triangular matrix. 40 This operator acts like a [batch] lower triangular matrix `A` with shape 50 # Create a 2 x 2 lower-triangular linear operator. 122 The lower triangular part of `tril` defines this operator. The strictly 148 "Only square lower triangular operators supported at this time.")
/external/eigen/blas/f2c/
dtbmv.c	43 /* upper or lower triangular band matrix, with ( k + 1 ) diagonals. */ 50 /* lower triangular matrix as follows: */ 52 /* UPLO = 'U' or 'u' A is an upper triangular matrix. */ 54 /* UPLO = 'L' or 'l' A is a lower triangular matrix. */ 72 /* triangular as follows: */ 74 /* DIAG = 'U' or 'u' A is assumed to be unit triangular. */ 77 /* triangular. */ 96 /* by n part of the array A must contain the upper triangular */ 103 /* triangular band matrix from conventional full matrix storage */ 114 /* by n part of the array A must contain the lower triangular */     [all...]
stbmv.c	43 /* upper or lower triangular band matrix, with ( k + 1 ) diagonals. */ 50 /* lower triangular matrix as follows: */ 52 /* UPLO = 'U' or 'u' A is an upper triangular matrix. */ 54 /* UPLO = 'L' or 'l' A is a lower triangular matrix. */ 72 /* triangular as follows: */ 74 /* DIAG = 'U' or 'u' A is assumed to be unit triangular. */ 77 /* triangular. */ 96 /* by n part of the array A must contain the upper triangular */ 103 /* triangular band matrix from conventional full matrix storage */ 114 /* by n part of the array A must contain the lower triangular */     [all...]
/external/tensorflow/tensorflow/compiler/tf2xla/lib/
triangular_solve.h	24 // Solves systems of linear equations with lower or upper triangular coefficient 45 // triangular part of each innermost matrix in `a` is assumed to be zero and is 51 // `lower` is a boolean, indicating whether the argument `a` is lower-triangular 52 // (true) or upper-triangular (false).

Completed in 519 milliseconds

1 2 3 4 5 6 7 8 91011