Home
last modified time | relevance | path

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

12

/external/eigen/bench/btl/data/
Daction_settings.txt11 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/
Dcompose-parse.py846 (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/
DC06_TutorialLinearAlgebra.dox47 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for th…
113 choice is then the LDLT decomposition. Here's an example, also demonstrating that using a general
169 allows Eigen to avoid performing a LU decomposition, and instead use formulas that are more efficie…
182 The best way to do least squares solving is with a SVD decomposition. Eigen provides one as the Jac…
194 Another way, potentially faster but less reliable, is to use a LDLT decomposition
200 In the above examples, the decomposition was computed at the same time that the decomposition objec…
203 decomposition object.
208 on an already-computed decomposition, reinitializing it.
220 Finally, you can tell the decomposition constructor to preallocate storage for decomposing matrices…
223 passing the size to the decomposition constructor, as in this example:
[all …]
DUsingIntelMKL.dox92 <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/icu4c/common/unicode/
Dnormalizer2.h267 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;
Dunorm2.h353 UChar32 c, UChar *decomposition, int32_t capacity,
387 UChar32 c, UChar *decomposition, int32_t capacity,
/external/icu4c/data/unidata/
DNormalizationCorrections.txt11 # 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/third_party/icu/source/data/unidata/
DNormalizationCorrections.txt11 # Consortium 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/
Dhydrogen-bch.cc323 InductionVariableData::BitwiseDecompositionResult decomposition; in CollectInductionVariableData() local
324 InductionVariableData::DecomposeBitwise(check->index(), &decomposition); in CollectInductionVariableData()
325 if (!decomposition.base->IsPhi()) continue; in CollectInductionVariableData()
326 HPhi* phi = HPhi::cast(decomposition.base); in CollectInductionVariableData()
345 int32_t limit = data->ComputeUpperLimit(decomposition.and_mask, in CollectInductionVariableData()
346 decomposition.or_mask); in CollectInductionVariableData()
Dhydrogen-instructions.cc864 DecompositionResult decomposition; in ApplyIndexChange() local
865 bool index_is_decomposable = index()->TryDecompose(&decomposition); in ApplyIndexChange()
867 ASSERT(decomposition.base() == base()); in ApplyIndexChange()
868 if (decomposition.offset() == offset() && in ApplyIndexChange()
869 decomposition.scale() == scale()) return; in ApplyIndexChange()
876 HValue* current_index = decomposition.base(); in ApplyIndexChange()
877 int actual_offset = decomposition.offset() + offset(); in ApplyIndexChange()
878 int actual_scale = decomposition.scale() + scale(); in ApplyIndexChange()
1979 BitwiseDecompositionResult decomposition; in AddCheck() local
1980 InductionVariableData::DecomposeBitwise(check->index(), &decomposition); in AddCheck()
[all …]
Dhydrogen-instructions.h902 virtual bool TryDecompose(DecompositionResult* decomposition) { in TryDecompose() argument
904 return RedefinedOperand()->TryDecompose(decomposition); in TryDecompose()
3998 DecompositionResult decomposition; in DetectCompoundIndex() local
3999 if (index()->TryDecompose(&decomposition)) { in DetectCompoundIndex()
4000 base_ = decomposition.base(); in DetectCompoundIndex()
4001 offset_ = decomposition.offset(); in DetectCompoundIndex()
4002 scale_ = decomposition.scale(); in DetectCompoundIndex()
4069 DecompositionResult decomposition; in HBoundsCheckBaseIndexInformation() local
4070 if (check->index()->TryDecompose(&decomposition)) { in HBoundsCheckBaseIndexInformation()
4071 SetOperandAt(0, decomposition.base()); in HBoundsCheckBaseIndexInformation()
[all …]
/external/eigen/Eigen/
DSVD14 * This module provides SVD decomposition for matrices (both real and complex).
15 * This decomposition is accessible via the following MatrixBase method:
DSparseCholesky11 …* This module currently provides two variants of the direct sparse Cholesky decomposition for self…
DCholesky12 …* This module provides two variants of the Cholesky decomposition for selfadjoint (hermitian) matr…
DLU9 …* This module includes %LU decomposition and related notions such as matrix inversion and determin…
DIterativeLinearSolvers22 …* Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, …
/external/icu4c/common/
Dnormalizer2.cpp200 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition()
208 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition()
210 decomposition.setTo(FALSE, d, length); // read-only alias in getDecomposition()
215 getRawDecomposition(UChar32 c, UnicodeString &decomposition) const { in getRawDecomposition()
223 decomposition.setTo(buffer, length); // copy the string (algorithmic decomposition) in getRawDecomposition()
225 decomposition.setTo(FALSE, d, length); // read-only alias in getRawDecomposition()
860 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument
865 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition()
869 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition()
871 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition()
[all …]
Dfilterednormalizer2.cpp154 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/WebKit/Source/core/rendering/svg/
DSVGRenderingContext.cpp267 AffineTransform::DecomposedType decomposition; in clear2DRotation() local
268 transform.decompose(decomposition); in clear2DRotation()
269 decomposition.angle = 0; in clear2DRotation()
270 transform.recompose(decomposition); in clear2DRotation()
/external/chromium_org/third_party/icu/source/common/unicode/
Dnormalizer2.h188 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0;
392 getDecomposition(UChar32 c, UnicodeString &decomposition) const;
Dunorm2.h280 UChar32 c, UChar *decomposition, int32_t capacity,
/external/harfbuzz_ng/src/hb-ucdn/
DREADME13 composition/decomposition and compatibility decomposition). More
/external/chromium_org/third_party/icu/source/common/
Dnormalizer2.cpp168 getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition()
176 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c) in getDecomposition()
178 decomposition.setTo(FALSE, d, length); // read-only alias in getDecomposition()
743 UChar32 c, UChar *decomposition, int32_t capacity, in unorm2_getDecomposition() argument
748 if(decomposition==NULL ? capacity!=0 : capacity<0) { in unorm2_getDecomposition()
752 UnicodeString destString(decomposition, 0, capacity); in unorm2_getDecomposition()
754 return destString.extract(decomposition, capacity, *pErrorCode); in unorm2_getDecomposition()
Dfilterednormalizer2.cpp152 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const { in getDecomposition()
153 return set.contains(c) && norm2.getDecomposition(c, decomposition); in getDecomposition()
/external/chromium_org/third_party/WebKit/Source/core/frame/
DLocation.idl43 // URI decomposition attributes

12