/external/eigen/doc/ |
D | LeastSquares.dox | 10 The three methods discussed on this page are the SVD decomposition, the QR decomposition and normal 11 equations. Of these, the SVD decomposition is generally the most accurate but the slowest, normal 12 equations is the fastest but least accurate, and the QR decomposition is in between. 17 \section LeastSquaresSVD Using the SVD decomposition 21 this class); you also need the singular vectors but the thin SVD decomposition suffices for 35 \section LeastSquaresQR Using the QR decomposition 37 The solve() method in QR decomposition classes also computes the least squares solution. There are 38 three QR decomposition classes: HouseholderQR (no pivoting, so fast but unstable),
|
D | TutorialLinearAlgebra.dox | 35 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for th… 117 choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a ge… 173 allows Eigen to avoid performing a LU decomposition, and instead use formulas that are more efficie… 186 The most accurate method to do least squares solving is with a SVD decomposition. Eigen provides one 198 Another methods, potentially faster but less reliable, are to use a Cholesky decomposition of the 199 normal matrix or a QR decomposition. Our page on \link LeastSquares least squares solving \endlink 205 In the above examples, the decomposition was computed at the same time that the decomposition objec… 208 decomposition object. 213 on an already-computed decomposition, reinitializing it. 225 Finally, you can tell the decomposition constructor to preallocate storage for decomposing matrices… [all …]
|
D | UsingBlasLapackBackends.dox | 86 <tr><td>LU decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td><td>\code 91 <tr class="alt"><td>Cholesky decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT <… 96 <tr><td>QR decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td><td>\code 103 <tr class="alt"><td>Singular value decomposition \n \c EIGEN_USE_LAPACKE </td><td>\code 122 <tr class="alt"><td>Schur decomposition \n \c EIGEN_USE_LAPACKE \n \c EIGEN_USE_LAPACKE_STRICT </td…
|
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
D | ArabicCharacterData.java | 41 return decomposition; in getDecomposition() 55 decomposition = Normalizer.compose(UCharacter.toString(character), true); in Record() 59 decomposition = Normalizer.decompose(UCharacter.toString(character), true); in Record() 63 decomposition = null; in Record() 70 private String decomposition; field in ArabicCharacterData.Record
|
D | DecompTable.java | 29 DecompEntry(int composedChar, String decomposition) in DecompEntry() argument 31 int decompCount = UTF16.countCodePoint(decomposition); in DecompEntry() 38 for (int in = 0; in < decomposition.length(); in += UTF16.getCharCount(cp)) { in DecompEntry() 39 cp = UTF16.charAt(decomposition, in); in DecompEntry() 106 public void add(int composed, String decomposition) in add() argument 108 DecompEntry entry = new DecompEntry(composed, decomposition); in add()
|
D | CanonGSUBBuilder.java | 78 String decomposition = record.getDecomposition(); in buildArabicContextualForms() local 80 if (decomposition != null && decomposition.length() == 1) { in buildArabicContextualForms() 120 String decomposition = record.getDecomposition(); in buildArabicLigatureTree() local 122 if (decomposition != null && decomposition.length() > 1) { in buildArabicLigatureTree() 131 … contextualTree.insert(convertArabicString(decompType, ligature, decomposition, isolClassTable)); in buildArabicLigatureTree()
|
/external/eigen/bench/btl/data/ |
D | action_settings.txt | 11 cholesky ; "{/*1.5 Cholesky decomposition}" ; "matrix size" ; 4:5000 12 complete_lu_decomp ; "{/*1.5 Complete LU decomposition}" ; "matrix size" ; 4:5000 13 partial_lu_decomp ; "{/*1.5 Partial LU decomposition}" ; "matrix size" ; 4:5000 15 hessenberg ; "{/*1.5 Hessenberg decomposition}" ; "matrix size" ; 4:5000
|
/external/icu/icu4c/source/common/unicode/ |
D | normalizer2.h | 269 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0; 296 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const; 532 getDecomposition(UChar32 c, UnicodeString &decomposition) const; 546 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
|
D | unorm2.h | 355 UChar32 c, UChar *decomposition, int32_t capacity, 389 UChar32 c, UChar *decomposition, int32_t capacity,
|
/external/python/cpython2/Tools/pybench/ |
D | Unicode.py | 474 decomposition = unicodedata.decomposition 487 decomposition(c) 496 decomposition(c) 505 decomposition(c) 514 decomposition(c) 523 decomposition(c) 536 decomposition = unicodedata.decomposition
|
/external/icu/icu4c/source/data/unidata/ |
D | NormalizationCorrections.txt | 13 # ordinarily precludes any change to the decomposition 16 # exceptional (and rare) conditions, an error in a decomposition 36 # Field 1: Original (erroneous) decomposition 37 # Field 2: Corrected decomposition
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/data/unicode/ |
D | NormalizationCorrections.txt | 13 # ordinarily precludes any change to the decomposition 16 # exceptional (and rare) conditions, an error in a decomposition 36 # Field 1: Original (erroneous) decomposition 37 # Field 2: Corrected decomposition
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/unicode/ |
D | NormalizationCorrections.txt | 13 # ordinarily precludes any change to the decomposition 16 # exceptional (and rare) conditions, an error in a decomposition 36 # Field 1: Original (erroneous) decomposition 37 # Field 2: Corrected decomposition
|
/external/eigen/Eigen/ |
D | SparseQR | 16 * \brief Provides QR decomposition for sparse matrices 18 * This module provides a simplicial version of the left-looking Sparse QR decomposition. 20 …* decomposition. Built-in methods (COLAMD, AMD) or external methods (METIS) can be used to this e…
|
D | OrderingMethods | 22 * the sparse matrix decomposition (LLT, LU, QR). 25 * Using for instance the sparse Cholesky decomposition, it is expected that 34 * A simple usage is as a template parameter in the sparse decomposition classes :
|
D | SVD | 21 * This module provides SVD decomposition for matrices (both real and complex). 22 * Two decomposition algorithms are provided:
|
/external/icu/icu4c/source/common/ |
D | normalizer2.cpp | 394 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument 399 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition() 403 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition() 405 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition() 413 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getRawDecomposition() argument 418 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getRawDecomposition() 422 UnicodeString destString(decomposition, 0, capacity); in unorm2_getRawDecomposition() 424 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getRawDecomposition()
|
D | norm2allmodes.h | 108 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() argument 116 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition() 118 decomposition.setTo(FALSE, d, length); // read-only alias in getDecomposition() 123 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() argument 131 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition() 133 decomposition.setTo(FALSE, d, length); // read-only alias in getRawDecomposition()
|
D | filterednormalizer2.cpp | 156 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() 157 return set.contains(c) && norm2.getDecomposition(c, decomposition); in getDecomposition() 161 FilteredNormalizer2::getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() 162 return set.contains(c) && norm2.getRawDecomposition(c, decomposition); in getRawDecomposition()
|
/external/python/cpython2/Doc/library/ |
D | unicodedata.rst | 94 .. function:: decomposition(unichr) 96 Returns the character decomposition mapping assigned to the Unicode character 113 Normal form D (NFD) is also known as canonical decomposition, and translates 115 canonical decomposition, then composes pre-combined characters again. 124 The normal form KD (NFKD) will apply the compatibility decomposition, i.e. 126 (NFKC) first applies the compatibility decomposition, followed by the canonical
|
/external/python/cpython2/Lib/test/ |
D | test_unicodedata.py | 97 self.db.decomposition(char), 158 self.assertEqual(self.db.decomposition(u'\uFFFE'),'') 159 self.assertEqual(self.db.decomposition(u'\u00bc'), '<fraction> 0031 2044 0034') 161 self.assertRaises(TypeError, self.db.decomposition) 162 self.assertRaises(TypeError, self.db.decomposition, u'xx')
|
/external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/text/ |
D | Collator.java | 305 public void setDecomposition(int decomposition) in setDecomposition() argument 310 collator.setDecomposition(decomposition); in setDecomposition()
|
/external/harfbuzz_ng/src/hb-ucdn/ |
D | README | 13 composition/decomposition and compatibility decomposition). More
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
D | TestDeprecatedNormalizerAPI.java | 98 String iterDecomp = iter.decomposition(); in doTestComposedChars() 135 String decomp = iter.decomposition(); in TestRoundTrip()
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/normalizer/ |
D | TestDeprecatedNormalizerAPI.java | 99 String iterDecomp = iter.decomposition(); in doTestComposedChars() 136 String decomp = iter.decomposition(); in TestRoundTrip()
|