Home
last modified time | relevance | path

Searched refs:decomposition (Results 1 – 25 of 131) sorted by relevance

123456

/external/eigen/doc/
DLeastSquares.dox10 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),
DTutorialLinearAlgebra.dox35 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 …]
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
DArabicCharacterData.java41 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
DDecompTable.java29 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()
DCanonGSUBBuilder.java78 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/
Daction_settings.txt11 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/eigen/Eigen/
DSparseQR16 * \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…
DOrderingMethods22 * 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 :
DSVD21 * This module provides SVD decomposition for matrices (both real and complex).
22 * Two decomposition algorithms are provided:
/external/icu/android_icu4j/src/main/tests/android/icu/dev/data/unicode/
DNormalizationCorrections.txt13 # 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/
DNormalizationCorrections.txt13 # 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/icu4c/source/data/unidata/
DNormalizationCorrections.txt13 # 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/python/cpython2/Tools/pybench/
DUnicode.py474 decomposition = unicodedata.decomposition
487 decomposition(c)
496 decomposition(c)
505 decomposition(c)
514 decomposition(c)
523 decomposition(c)
536 decomposition = unicodedata.decomposition
/external/tensorflow/tensorflow/compiler/mlir/tensorflow/transforms/
Ddecompose_resource_ops.td66 // This decomposition is only correct inside XLA as it ignores use_locking
80 // This decomposition is only correct inside XLA as it ignores use_locking
102 // This decomposition is only correct inside XLA as it ignores use_locking
130 // This decomposition is only correct inside XLA as it ignores use_locking
152 // This decomposition is only correct inside XLA as it ignores use_locking
181 // This decomposition is only correct inside XLA as it ignores use_locking
222 // This decomposition is only correct inside XLA as it ignores use_locking
267 // This decomposition is only correct inside XLA as it ignores use_locking
331 // TODO(b/178725329): Support scalar `updates` during decomposition.
350 // This decomposition is only correct inside XLA as it ignores use_locking
[all …]
/external/icu/icu4c/source/common/unicode/
Dnormalizer2.h303 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0;
330 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
619 getDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
633 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
/external/icu/libicu/cts_headers/unicode/
Dnormalizer2.h303 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0;
330 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
619 getDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
633 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
/external/icu/icu4c/source/common/
Dnormalizer2.cpp442 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument
447 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition()
451 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition()
453 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition()
461 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getRawDecomposition() argument
466 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getRawDecomposition()
470 UnicodeString destString(decomposition, 0, capacity); in unorm2_getRawDecomposition()
472 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getRawDecomposition()
Dnorm2allmodes.h110 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() argument
118 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition()
120 decomposition.setTo(false, d, length); // read-only alias in getDecomposition()
125 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() argument
133 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition()
135 decomposition.setTo(false, d, length); // read-only alias in getRawDecomposition()
Dfilterednormalizer2.cpp204 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition()
205 return set.contains(c) && norm2.getDecomposition(c, decomposition); in getDecomposition()
209 FilteredNormalizer2::getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition()
210 return set.contains(c) && norm2.getRawDecomposition(c, decomposition); in getRawDecomposition()
/external/python/cpython2/Doc/library/
Dunicodedata.rst94 .. 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/icu/libicu/cts_headers/
Dnorm2allmodes.h110 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition() argument
118 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition()
120 decomposition.setTo(false, d, length); // read-only alias in getDecomposition()
125 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition() argument
133 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition()
135 decomposition.setTo(false, d, length); // read-only alias in getRawDecomposition()
/external/python/cpython3/Doc/library/
Dunicodedata.rst97 .. function:: decomposition(chr)
99 Returns the character decomposition mapping assigned to the character
116 Normal form D (NFD) is also known as canonical decomposition, and translates
118 canonical decomposition, then composes pre-combined characters again.
127 The normal form KD (NFKD) will apply the compatibility decomposition, i.e.
129 (NFKC) first applies the compatibility decomposition, followed by the canonical
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_Qr.pbtxt34 Computes the QR decomposition of each inner matrix in `tensor` such that
37 Currently, the gradient for the QR decomposition is well-defined only when
/external/python/cpython2/Lib/test/
Dtest_unicodedata.py97 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/llvm-project/mlir/test/Transforms/
Ddecompose-call-graph-types.mlir3 // Test case: Most basic case of a 1:N decomposition, an identity function.
18 // Test case: Ensure no materializations in the case of 1:1 decomposition.
40 // Test case: Check decomposition of calls.
63 // Test case: Type that decomposes to nothing (that is, a 1:0 decomposition).

123456