Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:triangular (Results 76 - 100 of 265) sorted by null

1 2 34 5 6 7 8 91011

/external/eigen/blas/f2c/
chbmv.c	54 /* triangular part of the band matrix A is being supplied as */ 57 /* UPLO = 'U' or 'u' The upper triangular part of A is */ 60 /* UPLO = 'L' or 'l' The lower triangular part of A is */ 81 /* by n part of the array A must contain the upper triangular */ 88 /* triangular part of a hermitian band matrix from conventional */ 99 /* by n part of the array A must contain the lower triangular */ 106 /* triangular part of a hermitian band matrix from conventional */
zhbmv.c	55 /* triangular part of the band matrix A is being supplied as */ 58 /* UPLO = 'U' or 'u' The upper triangular part of A is */ 61 /* UPLO = 'L' or 'l' The lower triangular part of A is */ 82 /* by n part of the array A must contain the upper triangular */ 89 /* triangular part of a hermitian band matrix from conventional */ 100 /* by n part of the array A must contain the lower triangular */ 107 /* triangular part of a hermitian band matrix from conventional */
chpmv.c	53 /* triangular part of the matrix A is supplied in the packed */ 56 /* UPLO = 'U' or 'u' The upper triangular part of A is */ 59 /* UPLO = 'L' or 'l' The lower triangular part of A is */ 76 /* contain the upper triangular part of the hermitian matrix */ 81 /* contain the lower triangular part of the hermitian matrix */
zhpmv.c	53 /* triangular part of the matrix A is supplied in the packed */ 56 /* UPLO = 'U' or 'u' The upper triangular part of A is */ 59 /* UPLO = 'L' or 'l' The lower triangular part of A is */ 76 /* contain the upper triangular part of the hermitian matrix */ 81 /* contain the lower triangular part of the hermitian matrix */
/external/eigen/Eigen/src/Eigenvalues/
RealQZ.h	28 * real orthogonal matrixes, T is upper-triangular matrix, and S is upper 29 * quasi-triangular matrix. An orthogonal matrix is a matrix whose 30 * inverse is equal to its transpose, \f$ U^{-1} = U^T \f$. A quasi-triangular 31 * matrix is a block-triangular matrix whose diagonal consists of 1-by-1 215 /** \internal Reduces S and T to upper Hessenberg - triangular form */ 262 /** \internal Computes vector L1 norms of S and T when in Hessenberg-Triangular form already */ 571 // entrance point: hessenberg triangular decomposition 608 // and T.block(f,f, l-f+1,l-f+1) is invertible uper-triangular, which allows to 619 // For each non triangular 2x2 diagonal block of S,
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
TriDiagonalTransformer.java	63 * Only the upper triangular part of the matrix is used.</p> 228 // 1) only the upper triangular part of the matrix is accessed 256 // only the upper triangular part of the matrix is updated
/external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h	50 * R is the sparse triangular factor. Use matrixQR() to get it as SparseMatrix. 159 // Solves with the triangular matrix R 177 /** \returns the sparse triangular factor R. It is a sparse matrix
/external/eigen/doc/
SparseQuickReference.dox	219 <tr><td colspan="2"> Triangular and selfadjoint views</td></tr> 227 <td> Several combination between triangular views and blocks views are possible 231 <tr class="alt"><td colspan="2">Triangular solve </td></tr>
TemplateKeyword.dox	35 function which copies all entries in the upper triangular part of a matrix into another matrix, while keeping 36 the lower triangular part unchanged. A straightforward implementation would be as follows:
/external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteCholesky.h	25 * \tparam _UpLo The triangular part that will be used for the computations. It can be Lower 33 * where L is a lower triangular factor, S is a diagonal scaling matrix, and P is a 168 /** \returns the sparse lower triangular factor L */ 257 eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part must be stored");
/external/eigen/bench/perf_monitoring/gemm/
changesets.txt	50 7098:b6f1db9cf9ec # Bug 992: don't select a 3p GEMM path with non-vectorizable scalar types, this hits unsupported paths in symm/triangular products code
/external/eigen/blas/
BandTriangularSolver.h	16 * Solve Ax=b with A a band triangular matrix
/external/eigen/test/
sparse_solvers.cpp	45 // test triangular solver
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixLogarithm.h	35 /** \brief Compute logarithm of 2x2 triangular matrix. */ 221 /** \brief Compute logarithm of triangular matrices with size > 2. 264 * Here, an atomic matrix is a triangular matrix whose diagonal entries are close to each other. 273 * \param[in] A argument of matrix logarithm, should be upper triangular and atomic
/external/guava/guava-tests/benchmark/com/google/common/collect/
SortedCopyBenchmark.java	38 @Param({"1", "10", "1000", "1000000"}) int size; // logarithmic triangular
/frameworks/av/media/libeffects/dynamicsproc/dsp/
RDsp.h	87 } //triangular
/external/lmfit/lib/
lmmin.c	285 * to contain an upper triangular matrix R with diagonal elements of 299 * Jacobian, Q is orthogonal (not stored), and R is upper triangular 570 * an upper triangular matrix with diagonal elements of nonincreasing 573 * lmpar also provides an upper triangular matrix S such that 590 * strict upper triangle (transposed) of the upper triangular matrix S. 616 * contains the diagonal elements of the upper triangular matrix S.     [all...]
/external/python/cpython3/Lib/
random.py	17 triangular 52 "expovariate","vonmisesvariate","gammavariate","triangular", 370 ## -------------------- triangular -------------------- 372 def triangular(self, low=0.0, high=1.0, mode=None): member in class:Random 373 """Triangular distribution. 734 _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0)) 746 triangular = _inst.triangular variable
/external/eigen/Eigen/src/Cholesky/
LDLT.h	32 * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper. 33 * The other triangular part won't be read. 37 * is lower triangular with a unit diagonal and D is a diagonal matrix. 140 /** \returns a view of the upper triangular matrix U */ 147 /** \returns a view of the lower triangular matrix L */ 325 // the lower triangular part
LLT.h	26 * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper. 27 * The other triangular part won't be read. 30 * matrix A such that A = LL^* = U^*U, where L is lower triangular. 49 * Note that during the decomposition, only the upper triangular part of A is considered. Therefore, 114 /** \returns a view of the upper triangular matrix U */ 121 /** \returns a view of the lower triangular matrix L */
/external/eigen/Eigen/src/Core/util/
Constants.h	203 /** View matrix as a lower triangular matrix. */ 205 /** View matrix as an upper triangular matrix. */ 211 /** View matrix as a lower triangular matrix with ones on the diagonal. */ 213 /** View matrix as an upper triangular matrix with ones on the diagonal. */ 215 /** View matrix as a lower triangular matrix with zeros on the diagonal. */ 217 /** View matrix as an upper triangular matrix with zeros on the diagonal. */
/external/eigen/Eigen/src/LU/
FullPivLU.h	35 * decomposed as \f$ A = P^{-1} L U Q^{-1} \f$ where L is unit-lower-triangular, U is 36 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU 125 /** \returns the LU decomposition matrix: the upper-triangular part is U, the 126 * unit-lower-triangular part is L (at least for square matrices; in the non-square 652 * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end. 668 // the main diagonal. We need that to be able to apply our triangular solvers. 683 // ok, we have our trapezoid matrix, we can apply the triangular solver.     [all...]
/external/eigen/lapack/
clarfb.f	118 *> The triangular K-by-K matrix T in the representation of the 252 * where V1 is unit lower triangular. 377 * where V2 is unit upper triangular. 510 * where V1 is unit upper triangular. 636 * where V2 is unit lower triangular.
dlarfb.f	118 *> The triangular k by k matrix T in the representation of the 249 * where V1 is unit lower triangular. 375 * where V2 is unit upper triangular. 504 * where V1 is unit upper triangular. 630 * where V2 is unit lower triangular.
slarfb.f	118 *> The triangular k by k matrix T in the representation of the 249 * where V1 is unit lower triangular. 375 * where V2 is unit upper triangular. 504 * where V1 is unit upper triangular. 630 * where V2 is unit lower triangular.

Completed in 391 milliseconds

1 2 34 5 6 7 8 91011