| /external/eigen/test/ |
| sparse_solvers.cpp | 45 // test triangular solver
|
| product_notemporary.cpp | 81 // NOTE this is because the blas_traits require innerstride==1 to avoid a temporary, but that doesn't seem to be actually needed for the triangular products
91 // NOTE this is because the blas_traits require innerstride==1 to avoid a temporary, but that doesn't seem to be actually needed for the triangular products
|
| CMakeLists.txt | 139 ei_add_test(triangular)
|
| /packages/apps/Contacts/res/layout/ |
| group_browse_list_item.xml | 23 the triangular thing on the right side). Because of this structure, the item view can't have
|
| /external/eigen/doc/ |
| I16_TemplateKeyword.dox | 38 function which copies all entries in the upper triangular part of a matrix into another matrix, while keeping
39 the lower triangular part unchanged. A straightforward implementation would be as follows:
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 29 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
30 * The other triangular part won't be read.
34 * is lower triangular with a unit diagonal and D is a diagonal matrix.
109 /** \returns a view of the upper triangular matrix U */
116 /** \returns a view of the lower triangular matrix L */
296 // the lower triangular part
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 163 MatrixType m_T; /**< \brief Triangular part of Schur decomposition */
387 * zero, because #m_T is upper triangular.
408 /** \brief Solve a triangular Sylvester equation AX + XB = C
410 * \param[in] A the matrix A; should be square and upper triangular
411 * \param[in] B the matrix B; should be square and upper triangular
|
| MatrixLogarithm.h | 25 * Here, an atomic matrix is a triangular matrix whose diagonal
45 * \param[in] A argument of matrix logarithm, should be upper triangular and atomic
80 /** \brief Compute logarithm of triangular matrix with clustered eigenvalues. */
107 /** \brief Compute logarithm of 2x2 triangular matrix. */
135 /** \brief Compute logarithm of triangular matrices with size > 2.
|
| /external/eigen/unsupported/Eigen/ |
| MatrixFunctions | 332 quasi-triangular form with the real Schur decomposition. The square
333 root of the quasi-triangular matrix can then be computed directly. The
355 triangular matrix. The theoretical cost is the same. Details are in:
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 92 /** \returns the lower triangular matrix L */
95 /** \returns the upper triangular matrix U */
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| random.py | 16 triangular
53 "expovariate","vonmisesvariate","gammavariate","triangular",
359 ## -------------------- triangular --------------------
361 def triangular(self, low=0.0, high=1.0, mode=None): member in class:Random
362 """Triangular distribution.
871 _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0))
883 triangular = _inst.triangular variable
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| random.py | 16 triangular
53 "expovariate","vonmisesvariate","gammavariate","triangular",
359 ## -------------------- triangular --------------------
361 def triangular(self, low=0.0, high=1.0, mode=None): member in class:Random
362 """Triangular distribution.
871 _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0))
883 triangular = _inst.triangular variable
|
| /external/chromium_org/chrome/browser/chromeos/display/ |
| overscan_calibrator.cc | 34 // Draw triangular arrows.
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| Tridiagonalization.h | 196 * - the strict upper triangular part is equal to the input matrix A.
325 * \param[in,out] matA On input the selfadjoint matrix. Only the \b lower triangular part is referenced.
326 * On output, the strict upper part is left unchanged, and the lower triangular part
388 * decomposition is to be computed. Only the lower triangular part referenced.
|
| HessenbergDecomposition.h | 41 * subdiagonal, so it is almost upper triangular. The Hessenberg decomposition
285 * The result is written in the lower triangular part of \a matA.
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 473 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
474 * Upper|Lower can be used to tell both triangular parts can be used as input.
533 * \tparam Options can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used.
535 * Upper|Lower can be used to tell both triangular parts can be used as input.
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 136 eigen_assert((!HasUnitDiag) && "ReverseInnerIterator does not support yet triangular views with a unit diagonal");
|
| SparseSelfAdjointView.h | 18 * \brief Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
23 * This class is an expression of a sefladjoint matrix from a triangular part of a matrix
|
| /external/eigen/bench/ |
| BenchSparseUtil.h | 120 #include <boost/numeric/ublas/triangular.hpp>
|
| /external/eigen/bench/btl/libs/ublas/ |
| ublas_interface.hh | 26 #include <boost/numeric/ublas/triangular.hpp>
|
| /external/eigen/blas/ |
| level2_impl.h | 265 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
323 * non-unit, upper or lower triangular band matrix, with ( k + 1 )
397 * upper or lower triangular matrix, supplied in packed form.
409 * non-unit, upper or lower triangular matrix, supplied in packed form.
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_solvers.cpp | 45 // test triangular solver
|
| /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/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.h | 191 // implemented using CHOLMOD's sparse triangular matrix solve
|
