| /external/eigen/Eigen/src/Core/ |
| SelfAdjointView.h | 124 /** Perform a symmetric rank 2 update of the selfadjoint matrix \c *this:
137 /** Perform a symmetric rank K update of the selfadjoint matrix \c *this:
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 162 * \brief A minimal residual solver for sparse symmetric problems
165 * of Paige and Saunders (1975). The sparse matrix A must be symmetric (possibly indefinite).
|
| /external/libopus/silk/float/ |
| main_FLP.h | 255 /* Function to solve linear equation Ax = b, where A is an MxM symmetric matrix */
257 silk_float *A, /* I/O Symmetric square matrix, out: reg. */
|
| residual_energy_FLP.c | 62 /* compute c' * wXX * c, assuming wXX is symmetric */
|
| /frameworks/base/core/java/android/net/ |
| PskKeyManager.java | 29 * <p>TLS-PSK is a set of TLS/SSL cipher suites which rely on a symmetric pre-shared key (PSK) to
33 * step) and requires both peers to authenticate each other. In such scenarios a symmetric key (PSK)
|
| /frameworks/rs/cpp/ |
| rsCppStructs.h | [all...] |
| /frameworks/base/rs/java/android/renderscript/ |
| ScriptIntrinsicBLAS.java | [all...] |
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| ScriptIntrinsicBLAS.java | [all...] |
| /cts/apps/CameraITS/tests/scene1/ |
| test_crop_region_raw.py | 123 # be larger than the YUV images). Assume a symmetric padded border.
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_framestitching.cpp | 48 is symmetric and solutions might otherwise be lost
|
| /docs/source.android.com/src/security/keystore/ |
| features.jd | 37 <li>Import of raw symmetric keys (again, no wrapping)
41 <li>Symmetric encryption and decryption in appropriate modes, including an AEAD
43 <li>Generation and verification of symmetric message authentication codes
253 <li>Symmetric keys as raw bytes
|
| index.jd | 33 Android 6.0 with the addition of symmetric cryptographic primitives, AES and
|
| /external/ceres-solver/internal/ceres/ |
| cgnr_linear_operator.h | 72 // Thus, the symmetric system we need to solve for CGNR is
|
| cxsparse.h | 57 // Solves a symmetric linear system A * x = b using Cholesky factorization.
|
| dense_normal_cholesky_solver.cc | 84 // symmetric.
|
| implicit_schur_complement.h | 118 // The Schur complement is a symmetric positive definite matrix,
|
| preconditioner.h | 122 // LinearOperator interface. Since the operator is symmetric,
|
| /external/chromium-trace/catapult/third_party/Paste/paste/util/ |
| intset.py | 329 # Symmetric difference.
331 "Symmetric difference of two sets as a new set.",
334 "Symmetric difference of two sets as a new set.",
337 "Symmetric difference of two sets as a new set.",
|
| /external/dbus/dbus/ |
| dbus-marshal-basic.h | 133 /* The transformation is symmetric, so the FROM just maps to the TO. */
|
| /external/deqp/framework/delibs/debase/ |
| deMath.c | 140 /* \note Sign bit is separate so the range is symmetric */
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseColEtree.h | 88 /* Compute etree by Liu's algorithm for symmetric matrices,
|
| SparseDiagonalProduct.h | 25 // The two other cases are symmetric.
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_heap_relax_snode.h | 37 * This routine applied to a symmetric elimination tree.
|
| /external/eigen/doc/ |
| TutorialSparse.dox | 104 Since the resulting matrix \c A is symmetric by construction, we can perform a direct Cholesky factorization via the SimplicialLDLT class which behaves like its LDLT counterpart for dense objects.
283 - \b symmetric \b sparse-dense. The product of a sparse symmetric matrix with a dense matrix (or vector) can also be optimized by specifying the symmetry with selfadjointView():
330 - application of symmetric permutations:
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MatrixMarketIterator.h | 27 * and matname_SPD.mtx if the matrix is Symmetric and positive definite (or Hermitian)
|
