| /external/eigen/unsupported/Eigen/ |
| MatrixFunctions | 453 quasi-triangular form with the real Schur decomposition. The square
454 root of the quasi-triangular matrix can then be computed directly. The
476 triangular matrix. The theoretical cost is the same. Details are in:
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 79 * This class is capable of computing triangular real/complex matrices
84 * faciliate future development of triangular matrix functions.
121 * (or destroyed) before evaluation. Only the upper triangular
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| HybridNonLinearSolver.h | 68 /* TODO: if eigen provides a triangular storage, use it here */
222 /* copy the triangular factor of the qr factorization into r. */
465 /* copy the triangular factor of the qr factorization into r. */
|
| /external/tensorflow/tensorflow/contrib/bayesflow/python/ops/ |
| csiszar_divergence_impl.py | 33 @@triangular
429 def triangular(logu, name=None): function
430 """The Triangular Csiszar-function in log-space.
438 The Triangular Csiszar-function is:
459 with ops.name_scope(name, "triangular", [logu]):
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 53 * Only the \b lower \b triangular \b part of the input matrix is referenced.
148 * be computed. Only the lower triangular part of the matrix is referenced.
174 * be computed. Only the lower triangular part of the matrix is referenced.
[all...] |
| ComplexEigenSolver.h | 294 // The matrix X is unit triangular.
|
| EigenSolver.h | 471 // Backsubstitute to find vectors of upper triangular form
534 // Last vector component imaginary so matrix is triangular
|
| /external/ImageMagick/ImageMagick/api/ |
| shear.html | 141 <p>ShearRotateImage() creates a new image that is a rotated copy of an existing one. Positive angles rotate counter-clockwise (right-hand rule), while negative angles rotate clockwise. Rotated images are usually larger than the originals and have 'empty' triangular corners. X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image. ShearRotateImage allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
|
| /external/ImageMagick/www/api/ |
| shear.html | 145 <p>ShearRotateImage() creates a new image that is a rotated copy of an existing one. Positive angles rotate counter-clockwise (right-hand rule), while negative angles rotate clockwise. Rotated images are usually larger than the originals and have 'empty' triangular corners. X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image. ShearRotateImage allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
|
| shear.php | 141 <p>ShearRotateImage() creates a new image that is a rotated copy of an existing one. Positive angles rotate counter-clockwise (right-hand rule), while negative angles rotate clockwise. Rotated images are usually larger than the originals and have 'empty' triangular corners. X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image. ShearRotateImage allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| CholeskyDecompositionImpl.java | 28 * matrix A consists of a lower triangular matrix L with same size that
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 165 // solve upper triangular system
|
| MINRES.h | 168 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower,
|
| /external/python/cpython3/Lib/test/ |
| test_random.py | 702 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
712 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
741 (g.triangular, (10.0, 10.0), 10.0),
742 (g.triangular, (10.0, 10.0, 10.0), 10.0),
[all...] |
| /external/skia/src/codec/ |
| SkAndroidCodec.cpp | 38 * Calculates the area of the triangular gamut.
|
| /external/skqp/src/codec/ |
| SkAndroidCodec.cpp | 38 * Calculates the area of the triangular gamut.
|
| /frameworks/native/libs/input/ |
| VelocityTracker.cpp | 432 * and an m by n upper triangular matrix R. Because R is upper triangular (lower
467 float r[n][n]; // upper triangular matrix, row-major order
513 // Solve R B = Qt W Y to find B. This is easy because R is upper triangular.
[all...] |
| /art/test/530-checker-loops1/src/ |
| Main.java | 678 // Verifier for triangular loops.
691 // Verifier for triangular loops.
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_random.py | 497 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0)
507 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0),
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 39 * upper triangular matrix.
197 * Only the upper triangular part should be referenced. To get it, use
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 321 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
412 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
|
| /external/eigen/Eigen/src/SparseCore/ |
| 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/doc/ |
| SparseLinearSystems.dox | 113 For \c SPD solvers, a second optional template argument allows to specify which triangular part have to be used, e.g.:
121 In the above example, only the upper triangular part of the input matrix A is considered for solving. The opposite triangle might either be empty or contain arbitrary values.
|
| /external/python/cpython3/Doc/library/ |
| random.rst | 229 .. function:: triangular(low, high, mode)
473 (gauss, uniform, sample, betavariate, choice, triangular, and randrange).
|
| /external/vixl/src/aarch64/ |
| instructions-aarch64.h | 721 // The triangular format map uses between two and five bits to encode the NEON
756 // The triangular scalar format map uses between one and four bits to encode
|
