| /external/eigen/bench/btl/libs/ublas/ |
| ublas_interface.hh | 26 #include <boost/numeric/ublas/triangular.hpp>
|
| /external/eigen/blas/ |
| level2_impl.h | 286 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
344 * non-unit, upper or lower triangular band matrix, with ( k + 1 )
422 * upper or lower triangular matrix, supplied in packed form.
494 * non-unit, upper or lower triangular matrix, supplied in packed form.
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMpar.h | 44 // Make a copy of the triangular factor.
|
| /external/python/cpython2/Lib/test/ |
| test_random.py | 511 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
521 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
550 (g.triangular, (10.0, 10.0), 10.0),
551 (g.triangular, (10.0, 10.0, 10.0), 10.0),
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| cholesky_op_test.py | 41 # Check that the cholesky is lower triangular, and has positive diagonal
|
| matrix_triangular_solve_op_test.py | 76 a = rng.randn(5, 5) # the `a` matrix is not lower-triangular
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_random.py | 506 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
516 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
545 (g.triangular, (10.0, 10.0), 10.0),
546 #(g.triangular, (10.0, 10.0, 10.0), 10.0),
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_random.py | 506 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
516 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
545 (g.triangular, (10.0, 10.0), 10.0),
546 #(g.triangular, (10.0, 10.0, 10.0), 10.0),
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_random.py | 506 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
516 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
545 (g.triangular, (10.0, 10.0), 10.0),
546 #(g.triangular, (10.0, 10.0, 10.0), 10.0),
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_random.py | 506 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
516 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
545 (g.triangular, (10.0, 10.0), 10.0),
546 #(g.triangular, (10.0, 10.0, 10.0), 10.0),
|
| /external/tensorflow/tensorflow/python/ops/distributions/ |
| util.py | 794 """Creates a (batch of) triangular matrix from a vector of inputs.
796 Created matrix can be lower- or upper-triangular. (It is more efficient to
799 Triangular matrix elements are filled in a clockwise spiral. See example,
824 x: `Tensor` representing lower (or upper) triangular elements.
826 triangular (`True`) or lower triangular (`False`, default).
830 tril: `Tensor` with lower (or upper) triangular elements filled from `x`.
833 ValueError: if `x` cannot be mapped to a triangular matrix.
844 "correspond to a triangular matrix.".format(m))
[all...] |
| /external/tensorflow/tensorflow/stream_executor/ |
| blas.h | 70 // Specifies whether the upper or lower triangular part of a
77 // Specifies whether a matrix is unit triangular.
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldLUDecompositionImpl.java | 30 * L, U and P that satisfy: PA = LU, L is lower triangular, and U is
31 * upper triangular and P is a permutation matrix. All matrices are
|
| /external/deqp/external/openglcts/modules/glesext/tessellation_shader/ |
| esextcTessellationShaderInvariance.hpp | 260 * vertex shaders, tessellate a number of triangular and quad geometry with
281 * 4. For triangular tessellation, the test should identify vertices
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 41 * subdiagonal, so it is almost upper triangular. The Hessenberg decomposition
287 * The result is written in the lower triangular part of \a matA.
|
| /external/tensorflow/tensorflow/core/kernels/ |
| determinant_op.cc | 234 // upper triangular factor of the LU factorization, which is written to
383 // upper triangular factor of the LU factorization, which is written to
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 116 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower,
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky_impl.h | 146 /* compute numerical values kth row of L (a sparse triangular solve) */
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_column_bmod.h | 102 // Perform a triangular solver and block update,
|
| /external/eigen/test/ |
| CMakeLists.txt | 194 ei_add_test(triangular)
|
| /external/tensorflow/tensorflow/contrib/bayesflow/python/kernel_tests/ |
| csiszar_divergence_test.py | 280 self.assertAllClose(cd.triangular(0.).eval(), 0.)
285 cd.triangular(self._logu).eval(),
287 self._logu, cd.triangular).eval())
292 cd.triangular(self._logu).eval(),
[all...] |
| /external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
| mvn_full_covariance.py | 178 # However, cholesky() ignores the upper triangular part, so we do need
|
| /external/tensorflow/tensorflow/contrib/lite/models/testdata/g3doc/ |
| README.md | 11 ultimately produces a log-mel filterbank (the log of the triangular mel filters
|
| /external/tensorflow/tensorflow/contrib/signal/python/kernel_tests/ |
| mel_ops_test.py | 85 spectrum. This corresponds to the lower edge of the lowest triangular
|
| /external/tensorflow/tensorflow/contrib/signal/python/ops/ |
| mel_ops.py | 134 lowest triangular band.
|
