/external/eigen/bench/btl/data/ |
D | action_settings.txt | 11 cholesky ; "{/*1.5 Cholesky decomposition}" ; "matrix size" ; 4:3000 12 complete_lu_decomp ; "{/*1.5 Complete LU decomposition}" ; "matrix size" ; 4:3000 13 partial_lu_decomp ; "{/*1.5 Partial LU decomposition}" ; "matrix size" ; 4:3000 15 hessenberg ; "{/*1.5 Hessenberg decomposition}" ; "matrix size" ; 4:3000
|
/external/chromium_org/third_party/gtk+/gtk/ |
D | compose-parse.py | 846 (name, decomposition, combiningclass) = unicodedatabase[codepoint] 847 if decomposition[0] == '' or decomposition[0] == '0': 849 if match('<\w+>', decomposition[0]): 850 numdecomposition = map(stringtohex, decomposition[1:]) 852 numdecomposition = map(stringtohex, decomposition) 878 decomposition = uniproperties[5] 879 unicodedatabase[codepoint] = [name, split('\s+', decomposition), combiningclass] 887 (name, decomposition, combiningclass) = unicodedatabase[item] 888 if decomposition[0] == '': 891 elif match('<\w+>', decomposition[0]): [all …]
|
/external/eigen/doc/ |
D | TutorialLinearAlgebra.dox | 35 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for th… 101 choice is then the LDLT decomposition. Here's an example, also demonstrating that using a general 157 allows Eigen to avoid performing a LU decomposition, and instead use formulas that are more efficie… 170 The best way to do least squares solving is with a SVD decomposition. Eigen provides one as the Jac… 182 Another way, potentially faster but less reliable, is to use a LDLT decomposition 188 In the above examples, the decomposition was computed at the same time that the decomposition objec… 191 decomposition object. 196 on an already-computed decomposition, reinitializing it. 208 Finally, you can tell the decomposition constructor to preallocate storage for decomposing matrices… 211 passing the size to the decomposition constructor, as in this example: [all …]
|
D | UsingIntelMKL.dox | 92 <tr><td>LU decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td><td>\code 97 <tr class="alt"><td>Cholesky decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT <… 102 <tr><td>QR decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td><td>\code 109 <tr class="alt"><td>Singular value decomposition \n \c EIGEN_USE_LAPACKE </td><td>\code 128 <tr class="alt"><td>Schur decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td…
|
/external/eigen/Eigen/ |
D | SparseQR | 9 * \brief Provides QR decomposition for sparse matrices 11 * This module provides a simplicial version of the left-looking Sparse QR decomposition. 13 …* decomposition. Built-in methods (COLAMD, AMD) or external methods (METIS) can be used to this e…
|
D | SVD | 14 * This module provides SVD decomposition for matrices (both real and complex). 15 * This decomposition is accessible via the following MatrixBase method:
|
D | OrderingMethods | 15 * the sparse matrix decomposition (LLT, LU, QR). 18 * Using for instance the sparse Cholesky decomposition, it is expected that 27 * A simple usage is as a template parameter in the sparse decomposition classes :
|
D | Cholesky | 12 …* This module provides two variants of the Cholesky decomposition for selfadjoint (hermitian) matr…
|
D | LU | 9 …* This module includes %LU decomposition and related notions such as matrix inversion and determin…
|
D | IterativeLinearSolvers | 22 …* Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, …
|
/external/chromium_org/third_party/icu/source/common/unicode/ |
D | normalizer2.h | 267 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0; 294 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const; 530 getDecomposition(UChar32 c, UnicodeString &decomposition) const; 544 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
|
D | unorm2.h | 353 UChar32 c, UChar *decomposition, int32_t capacity, 387 UChar32 c, UChar *decomposition, int32_t capacity,
|
/external/chromium_org/third_party/icu/source/data/unidata/ |
D | NormalizationCorrections.txt | 11 # ordinarily precludes any change to the decomposition 14 # exceptional (and rare) conditions, an error in a decomposition 34 # Field 1: Original (erroneous) decomposition 35 # Field 2: Corrected decomposition
|
/external/icu/icu4c/source/common/unicode/ |
D | normalizer2.h | 267 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0; 294 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const; 530 getDecomposition(UChar32 c, UnicodeString &decomposition) const; 544 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
|
D | unorm2.h | 353 UChar32 c, UChar *decomposition, int32_t capacity, 387 UChar32 c, UChar *decomposition, int32_t capacity,
|
/external/icu/icu4c/source/data/unidata/ |
D | NormalizationCorrections.txt | 11 # ordinarily precludes any change to the decomposition 14 # exceptional (and rare) conditions, an error in a decomposition 34 # Field 1: Original (erroneous) decomposition 35 # Field 2: Corrected decomposition
|
/external/chromium_org/v8/src/ |
D | hydrogen-bch.cc | 300 InductionVariableData::BitwiseDecompositionResult decomposition; in CollectInductionVariableData() local 301 InductionVariableData::DecomposeBitwise(check->index(), &decomposition); in CollectInductionVariableData() 302 if (!decomposition.base->IsPhi()) continue; in CollectInductionVariableData() 303 HPhi* phi = HPhi::cast(decomposition.base); in CollectInductionVariableData() 322 int32_t limit = data->ComputeUpperLimit(decomposition.and_mask, in CollectInductionVariableData() 323 decomposition.or_mask); in CollectInductionVariableData()
|
/external/icu/icu4c/source/common/ |
D | normalizer2.cpp | 201 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() 209 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition() 211 decomposition.setTo(FALSE, d, length); // read-only alias in getDecomposition() 216 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() 224 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition() 226 decomposition.setTo(FALSE, d, length); // read-only alias in getRawDecomposition() 854 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument 859 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition() 863 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition() 865 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition() [all …]
|
D | filterednormalizer2.cpp | 154 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() 155 return set.contains(c) && norm2.getDecomposition(c, decomposition); in getDecomposition() 159 FilteredNormalizer2::getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() 160 return set.contains(c) && norm2.getRawDecomposition(c, decomposition); in getRawDecomposition()
|
/external/chromium_org/third_party/icu/source/common/ |
D | normalizer2.cpp | 201 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() 209 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition() 211 decomposition.setTo(FALSE, d, length); // read-only alias in getDecomposition() 216 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() 224 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition() 226 decomposition.setTo(FALSE, d, length); // read-only alias in getRawDecomposition() 854 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument 859 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition() 863 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition() 865 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition() [all …]
|
D | filterednormalizer2.cpp | 154 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() 155 return set.contains(c) && norm2.getDecomposition(c, decomposition); in getDecomposition() 159 FilteredNormalizer2::getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() 160 return set.contains(c) && norm2.getRawDecomposition(c, decomposition); in getRawDecomposition()
|
/external/eigen/unsupported/Eigen/ |
D | SVD | 14 * This module provides SVD decomposition for matrices (both real and complex). 15 * This decomposition is accessible via the following MatrixBase method:
|
D | ArpackSupport | 18 * This module provides a wrapper to Arpack, a library for sparse eigenvalue decomposition.
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
D | SVGRenderingContext.cpp | 270 AffineTransform::DecomposedType decomposition; in clear2DRotation() local 271 transform.decompose(decomposition); in clear2DRotation() 272 decomposition.angle = 0; in clear2DRotation() 273 transform.recompose(decomposition); in clear2DRotation()
|
/external/harfbuzz_ng/src/hb-ucdn/ |
D | README | 14 composition/decomposition and compatibility decomposition). More
|