Searched refs:triangular (Results 1 – 25 of 60) sorted by relevance
123
13 A tensor of shape `[..., M, M]` whose strictly lower triangular part denotes the14 lower triangular factor `L` with unit diagonal, and whose upper triangular part15 denotes the upper triangular factor `U`.24 Similar to `scipy.linalg.lu`, except the triangular factors `L` and `U` are39 of all input submatrices `[..., :, :]`. LU encodes the lower triangular and40 upper triangular factors.42 For each input submatrix of shape `[M, M]`, L is a lower triangular matrix of44 triangular part of LU. U is a upper triangular matrix of shape `[M, M]` whose45 entries correspond to the upper triangular part, including the diagonal, of LU.
25 lower or upper triangular.39 …summary: "Solves systems of linear equations with upper or lower triangular matrices by backsubsti…43 square matrices. If `lower` is `True` then the strictly upper triangular part45 If `lower` is False then the strictly lower triangular part of each inner-most
7 Algorithm depends only on lower triangular part of the innermost matrices of15 Algorithm depends only on lower triangular part of the innermost matrices of
20 The input has to be symmetric and positive definite. Only the lower-triangular21 part of the input will be used for this operation. The upper-triangular part
28 quasi-triangular form with the real Schur decomposition. The square root29 of the quasi-triangular matrix is then computed directly. Details of
64 tf.matrix_band_part(input, 0, -1) ==> Upper triangular part.65 tf.matrix_band_part(input, -1, 0) ==> Lower triangular part.
31 definite (SPD) matrix; although only the lower triangular part of the matrix is37 sparse matrix represents `L`, the lower triangular Cholesky factor satisfying
44 # r is a tensor of upper triangular matrices.
26 matrix; only the lower triangular part of the matrix is read. The values of the
8 trmm ; "{/*1.5 triangular matrix matrix product}" ; "matrix size" ; 4:50009 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:500010 trisolve_matrix ; "{/*1.5 triangular solver - matrix (M = inv(L) M)}" ; "size" ; 4:5000
32 Node* SetDiag(int num_bands, Graph* g, Node* bands, Node* triangular) { in SetDiag() argument38 .Input(triangular) in SetDiag()
16 …code</td><td>Matrix and Array classes, basic linear algebra (including triangular and selfadjoint …635 …View gives a view on a triangular part of a dense matrix and allows to perform optimized operation…643 Reference to a triangular with optional \n651 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 a…681 matrix and perform special and optimized operations. Again the opposite triangular part is never re…748 <tr><td>View on a triangular part of a matrix (read/write)</td>755 <tr><td>View a triangular part as a symmetric/self-adjoint matrix (read/write)</td>758 …intView<Upper>() = mat2 + mat2.adjoint(); // evaluated and write to the upper triangular part only
11 …lasses, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></t…336 …riangularView() function can be used to address a triangular part of the matrix, and perform trian…349 - copy of triangular parts:351 …(); // makes a full selfadjoint matrix from the upper triangular part352 …= sm1.selfadjointView<Upper>(); // copies the upper triangular part to the lower triangular p…357 …By(P); // compute P S P' from the upper triangular part of A, and m…358 …ointView<Lower>().twistedBy(P); // compute P S P' from the lower triangular part of A, and t…
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…
35 function which copies all entries in the upper triangular part of a matrix into another matrix, whi…36 the lower triangular part unchanged. A straightforward implementation would be as follows:
102 In Eigen 2 you had to play with the part, extract, and marked functions to deal with triangular and…209 triangular part to work on (default is lower part)</td></tr>221 triangular part to work on</td></tr>
507 def triangular(self, low=0.0, high=1.0, mode=None): member in Random818 triangular = _inst.triangular variable876 _test_generator(N, triangular, (0.0, 1.0, 1.0 / 3.0))
366 def triangular(self, low=0.0, high=1.0, mode=None): member in Random879 _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0))891 triangular = _inst.triangular variable
532 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)542 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),571 (g.triangular, (10.0, 10.0), 10.0),572 (g.triangular, (10.0, 10.0, 10.0), 10.0),
68 // COMMON-LABEL: @triangular69 func @triangular(%arg0: memref<?x?xf32>) {
61 * // Call the ordering on the pattern of the lower triangular matrix A
50 …th with non-vectorizable scalar types, this hits unsupported paths in symm/triangular products code
928 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)938 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),967 (g.triangular, (10.0, 10.0), 10.0),968 (g.triangular, (10.0, 10.0, 10.0), 10.0),
453 quasi-triangular form with the real Schur decomposition. The square454 root of the quasi-triangular matrix can then be computed directly. The476 triangular matrix. The theoretical cost is the same. Details are in:
65 the combined contributions of a set of triangular regions, each having