Home
last modified time | relevance | path

Searched refs:degree (Results 1 – 25 of 334) sorted by relevance

12345678910>>...14

/external/eigen/unsupported/Eigen/src/Splines/
DSplineFitting.h45 void KnotAveraging(const KnotVectorType& parameters, DenseIndex degree, KnotVectorType& knots) in KnotAveraging() argument
47 knots.resize(parameters.size()+degree+1); in KnotAveraging()
49 for (DenseIndex j=1; j<parameters.size()-degree; ++j) in KnotAveraging()
50 knots(j+degree) = parameters.segment(j,degree).mean(); in KnotAveraging()
52 knots.segment(0,degree+1) = KnotVectorType::Zero(degree+1); in KnotAveraging()
53 knots.segment(knots.size()-degree-1,degree+1) = KnotVectorType::Ones(degree+1); in KnotAveraging()
79 const unsigned int degree, in KnotAveragingWithDerivatives() argument
90 KnotAveraging(parameters, degree, knots); in KnotAveragingWithDerivatives()
110 endIndex = numParameters - degree; in KnotAveragingWithDerivatives()
115 endIndex = numParameters - degree - 1; in KnotAveragingWithDerivatives()
[all …]
DSpline.h185 DenseIndex degree() const;
196 …static DenseIndex Span(typename SplineTraits<Spline>::Scalar u, DenseIndex degree, const typename …
210 static BasisVectorType BasisFunctions(Scalar u, DenseIndex degree, const KnotVectorType& knots);
218 const Scalar u, const DenseIndex order, const DenseIndex degree, const KnotVectorType& knots);
236 DenseIndex degree, in Span() argument
240 if (u <= knots(0)) return degree; in Span()
241 …const Scalar* pos = std::upper_bound(knots.data()+degree-1, knots.data()+knots.size()-degree-1, u); in Span()
249 DenseIndex degree, in BasisFunctions() argument
254 const DenseIndex p = degree; in BasisFunctions()
255 const DenseIndex i = Spline::Span(u, degree, knots); in BasisFunctions()
[all …]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
DMatrixLogarithm.h77 int degree = minPadeDegree; in matrix_log_get_pade_degree() local
78 for (; degree <= maxPadeDegree; ++degree) in matrix_log_get_pade_degree()
79 if (normTminusI <= maxNormForPade[degree - minPadeDegree]) in matrix_log_get_pade_degree()
81 return degree; in matrix_log_get_pade_degree()
91 int degree = minPadeDegree; in matrix_log_get_pade_degree() local
92 for (; degree <= maxPadeDegree; ++degree) in matrix_log_get_pade_degree()
93 if (normTminusI <= maxNormForPade[degree - minPadeDegree]) in matrix_log_get_pade_degree()
95 return degree; in matrix_log_get_pade_degree()
123 int degree = minPadeDegree; in matrix_log_get_pade_degree() local
124 for (; degree <= maxPadeDegree; ++degree) in matrix_log_get_pade_degree()
[all …]
DMatrixPower.h103 void computePade(int degree, const MatrixType& IminusT, ResultType& res) const;
162 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, ResultType& … in computePade() argument
164 int i = 2*degree; in computePade()
165 res = (m_p-degree) / (2*i-2) * IminusT; in computePade()
206 int degree, degree2, numberOfSquareRoots = 0; in computeBig() local
216 degree = getPadeDegree(normIminusT); in computeBig()
218 if (degree - degree2 <= 1 || hasExtraSquareRoot) in computeBig()
226 computePade(degree, IminusT, res); in computeBig()
239 int degree = 3; in getPadeDegree() local
240 for (; degree <= 4; ++degree) in getPadeDegree()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
DPolynomialsUtils.java95 public static PolynomialFunction createChebyshevPolynomial(final int degree) { in createChebyshevPolynomial() argument
96 return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS, in createChebyshevPolynomial()
120 public static PolynomialFunction createHermitePolynomial(final int degree) { in createHermitePolynomial() argument
121 return buildPolynomial(degree, HERMITE_COEFFICIENTS, in createHermitePolynomial()
146 public static PolynomialFunction createLaguerrePolynomial(final int degree) {
147 return buildPolynomial(degree, LAGUERRE_COEFFICIENTS,
173 public static PolynomialFunction createLegendrePolynomial(final int degree) {
174 return buildPolynomial(degree, LEGENDRE_COEFFICIENTS,
193 private static PolynomialFunction buildPolynomial(final int degree,
199 if (degree > maxDegree) {
[all …]
DPolynomialFunctionNewtonForm.java101 public int degree() { in degree() method in PolynomialFunctionNewtonForm
178 final int n = degree(); in computeCoefficients()
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
DPolynomialFitter.java39 private final int degree; field in PolynomialFitter
47 …public PolynomialFitter(int degree, final DifferentiableMultivariateVectorialOptimizer optimizer) { in PolynomialFitter() argument
49 this.degree = degree; in PolynomialFitter()
76 … return new PolynomialFunction(fitter.fit(new ParametricPolynomial(), new double[degree + 1])); in fit()
/external/epid-sdk/epid/common-testhelper/
Dfinite_field_wrapper-testhelper.cc140 FfElementObj const& ground_element, int degree) in FiniteFieldObj() argument
144 NewFiniteFieldViaBinomalExtension(ground_field, ground_element, degree, in FiniteFieldObj()
147 state_->size_ = ground_field.GetElementMaxSize() * degree; in FiniteFieldObj()
151 BigNumStr const* irr_polynomial, int degree) in FiniteFieldObj() argument
155 NewFiniteFieldViaPolynomialExtension(ground_field, irr_polynomial, degree, in FiniteFieldObj()
158 state_->size_ = ground_field.GetElementMaxSize() * degree; in FiniteFieldObj()
Dfinite_field_wrapper-testhelper.h49 FfElementObj const& ground_element, int degree);
52 BigNumStr const* irr_polynomial, int degree);
/external/epid-sdk/ext/ipp/sources/ippcp/
Dpcpgfpxgetsize.c90 IPPFUN(IppStatus, ippsGFpxGetSize, (const IppsGFpState* pGroundGF, int degree, int* pSize))
93 IPP_BADARG_RET( degree<IPP_MIN_GF_EXTDEG || degree >IPP_MAX_GF_EXTDEG, ippStsBadArgErr);
100 Ipp64u elmLen64 = (Ipp64u)(groundElmLen) *sizeof(BNU_CHUNK_T) *degree;
Dpcpgfpx_inv.c70 int degA = degree(pA, pGFEx); in gfpxPolyDiv()
71 int degB = degree(pB, pGFEx); in gfpxPolyDiv()
152 int degB = degree(pB, pGFEx); in gfpxGeneratorDiv()
183 if(0==degree(pA, pGFEx)) { in cpGFpxInv()
216 while(degree(rem, pGFEx) > 0) { in cpGFpxInv()
Dpcpgfpxstuff.h62 __INLINE int degree(const BNU_CHUNK_T* pE, const gsModEngine* pGFEx) in degree() function
81 int degree = GFP_EXTDEGREE(pGFEx); in cpGFpBasicDegreeExtension() local
84 degree *= GFP_EXTDEGREE(pGFEx); in cpGFpBasicDegreeExtension()
86 return degree; in cpGFpBasicDegreeExtension()
/external/u-boot/doc/device-tree-bindings/exynos/
Dtmu.txt6 - samsung,min-temp : Minimum temperature value (25 degree celsius)
8 - samsung,max-temp : Maximum temperature value (125 degree celsius)
10 - samsung,start-warning : Temperature at which TMU starts giving warning (degree celsius)
11 - samsung,start-tripping : Temperature at which TMU shuts down the system (degree celsius)
13 in case TMU fails to power off (degree celsius)
/external/pdfium/fxbarcode/common/reedsolomon/
DBC_ReedSolomon.cpp43 size_t degree) { in BuildGenerator() argument
44 if (degree >= m_cachedGenerators.size()) { in BuildGenerator()
46 for (size_t d = m_cachedGenerators.size(); d <= degree; ++d) { in BuildGenerator()
60 return m_cachedGenerators[degree].get(); in BuildGenerator()
DBC_ReedSolomonGF256.cpp78 int32_t degree, in BuildMonomial() argument
81 if (degree < 0) { in BuildMonomial()
91 std::vector<int32_t> coefficients(degree + 1); in BuildMonomial()
DBC_ReedSolomonGF256Poly.cpp83 int32_t CBC_ReedSolomonGF256Poly::GetCoefficients(int32_t degree) const { in GetCoefficients()
84 return m_coefficients[m_coefficients.size() - 1 - degree]; in GetCoefficients()
183 CBC_ReedSolomonGF256Poly::MultiplyByMonomial(int32_t degree, in MultiplyByMonomial() argument
185 if (degree < 0) in MultiplyByMonomial()
191 std::vector<int32_t> product(size + degree); in MultiplyByMonomial()
DBC_ReedSolomonGF256Poly.h25 int32_t GetCoefficients(int32_t degree) const;
36 int32_t degree,
/external/eigen/Eigen/src/OrderingMethods/
DAmd.h118 StorageIndex* degree = W + 5*(n+1); in minimum_degree_ordering() local
140 degree[i] = len[i]; // degree of node i in minimum_degree_ordering()
155 d = degree[i]; in minimum_degree_ordering()
250 head[degree[i]] = next[i]; in minimum_degree_ordering()
260 degree[k] = dk; /* external degree of k - |Lk\i| */ in minimum_degree_ordering()
282 w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */ in minimum_degree_ordering()
336 degree[i] = std::min<StorageIndex> (degree[i], d); /* update degree(i) */ in minimum_degree_ordering()
347 degree[k] = dk; /* finalize |Lk| */ in minimum_degree_ordering()
396 d = degree[i] + dk - nvi; /* compute external degree(i) */ in minimum_degree_ordering()
403 degree[i] = d; in minimum_degree_ordering()
/external/epid-sdk/epid/common/math/src/
Dfinitefield.c166 int degree, FiniteField** ff) { in NewFiniteFieldViaBinomalExtension() argument
179 } else if (degree < 2 || !ground_field->ipp_ff || in NewFiniteFieldViaBinomalExtension()
186 sts = ippsGFpxGetSize(ground_field->ipp_ff, degree, &state_size_in_bytes); in NewFiniteFieldViaBinomalExtension()
205 ground_field->ipp_ff, degree, ground_element->ipp_ff_elem, in NewFiniteFieldViaBinomalExtension()
206 2 == degree in NewFiniteFieldViaBinomalExtension()
225 ground_field->element_strlen_required * degree; in NewFiniteFieldViaBinomalExtension()
251 finitefield_ptr->basic_degree = ground_field->basic_degree * degree; in NewFiniteFieldViaBinomalExtension()
252 finitefield_ptr->ground_degree = degree; in NewFiniteFieldViaBinomalExtension()
253 finitefield_ptr->element_len = ground_field->element_len * degree; in NewFiniteFieldViaBinomalExtension()
277 int degree, FiniteField** ff) { in NewFiniteFieldViaPolynomialExtension() argument
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
DSmoothingPolynomialBicubicSplineInterpolator.java54 public SmoothingPolynomialBicubicSplineInterpolator(int degree) { in SmoothingPolynomialBicubicSplineInterpolator() argument
55 this(degree, degree); in SmoothingPolynomialBicubicSplineInterpolator()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DGraph.h59 unsigned degree; variable
62 NodeEntry(const Vector &costs) : costs(costs), degree(0) {} in NodeEntry()
65 unsigned getDegree() const { return degree; } in getDegree()
69 ++degree; in addEdge()
73 --degree; in removeEdge()
/external/libxkbcommon/xkbcommon/test/data/symbols/
Dlatin15 key <AE10> { [ 0, parenright, braceright, degree ] };
75 key <AE10> { [ 0, equal, braceright, degree ] };
130 key <AE10> { [ 0, equal, braceright, degree ] };
143 key <AD11> { [bracketleft, braceleft, diaeresis, degree ] };
156 key <AD11> { [ aring, Aring, diaeresis, degree ] };
215 key <AE10> { [ 0, parenright, degree, dead_abovering ] };
Dca45 key <LSGT> { [guillemotleft, guillemotright, degree] };
105 key <LSGT> { [guillemotleft, guillemotright, degree] };
129 key <TLDE> { [ degree, degree, notsign ] };
147 key <AD11> { [dead_circumflex, dead_circumflex, degree ] };
194 key <AC10> { [ semicolon, colon, degree ] };
409 key <AC10> { [ semicolon, colon, degree, NoSymbol,
418 key <LSGT> { [ ugrave, Ugrave, degree, NoSymbol,
463 key <I219> { [ guillemotleft, guillemotright, degree, VoidSymbol ] };
/external/libxcam/xcore/base/
Dxcam_defs.h123 #define degree2radian(degree) ((degree) * PI / 180.0f) argument
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DLongArray.java447 public int degree() in degree() method in LongArray
868 int aDeg = degree(); in modMultiplyLD()
873 int bDeg = other.degree(); in modMultiplyLD()
1000 int aDeg = degree(); in modMultiply()
1005 int bDeg = other.degree(); in modMultiply()
1132 int aDeg = degree(); in modMultiplyAlt()
1137 int bDeg = other.degree(); in modMultiplyAlt()
1356 int aDeg = degree(); in multiply()
1361 int bDeg = other.degree(); in multiply()
2061 int uzDegree = degree(); in modInverse()

12345678910>>...14