| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| CMakeLists.txt | 5 DESTINATION ${INCLUDE_INSTALL_DIR}/unsupported/Eigen/src/Polynomials COMPONENT Devel
|
| PolynomialUtils.h | 26 template <typename Polynomials, typename T>
28 T poly_eval_horner( const Polynomials& poly, const T& x )
44 template <typename Polynomials, typename T>
46 T poly_eval( const Polynomials& poly, const T& x )
|
| /external/eigen/unsupported/Eigen/src/ |
| CMakeLists.txt | 11 ADD_SUBDIRECTORY(Polynomials)
|
| /external/eigen/unsupported/Eigen/ |
| CMakeLists.txt | 2 MatrixFunctions MoreVectorization MPRealSupport NonLinearOptimization NumericalDiff OpenGLSupport Polynomials
|
| Polynomials | 28 * \defgroup Polynomials_Module Polynomials module
33 * #include <unsupported/Eigen/Polynomials>
38 #include "src/Polynomials/PolynomialUtils.h"
39 #include "src/Polynomials/Companion.h"
40 #include "src/Polynomials/PolynomialSolver.h"
43 \page polynomials Polynomials defines functions for dealing with polynomials
48 polynomials, computing estimates about polynomials and next the QR based polynomia
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialSplineFunction.java | 17 package org.apache.commons.math.analysis.polynomials;
31 * <i>interpolating polynomials</i> and an ascending array of domain
33 * is defined by the constituent polynomials. The polynomials are assumed to
37 * the polynomials and knot points passed to the constructor.</p>
39 * N.B.: The polynomials in the <code>polynomials</code> property must be
57 * <code>polynomials[j](x - knot[j])</code></li></ol></p>
74 private final PolynomialFunction polynomials[]; field in class:PolynomialSplineFunction
77 * Number of spline segments = number of polynomials
[all...] |
| PolynomialsUtils.java | 17 package org.apache.commons.math.analysis.polynomials;
25 * A collection of static methods that operate on or return polynomials.
32 /** Coefficients for Chebyshev polynomials. */
35 /** Coefficients for Hermite polynomials. */
38 /** Coefficients for Laguerre polynomials. */
41 /** Coefficients for Legendre polynomials. */
46 // initialize recurrence for Chebyshev polynomials
53 // initialize recurrence for Hermite polynomials
60 // initialize recurrence for Laguerre polynomials
67 // initialize recurrence for Legendre polynomials
[all...] |
| package.html | 20 Univariate real polynomials implementations, seen as differentiable
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| SplineInterpolator.java | 22 import org.apache.commons.math.analysis.polynomials.PolynomialFunction;
23 import org.apache.commons.math.analysis.polynomials.PolynomialSplineFunction;
30 * consisting of n cubic polynomials, defined over the subintervals determined by the x values,
39 * The interpolating polynomials satisfy: <ol>
42 * <li>Adjacent polynomials are equal through two derivatives at the knot points (i.e., adjacent polynomials
114 PolynomialFunction polynomials[] = new PolynomialFunction[n]; local
121 polynomials[i] = new PolynomialFunction(coefficients);
124 return new PolynomialSplineFunction(x, polynomials);
|
| LinearInterpolator.java | 22 import org.apache.commons.math.analysis.polynomials.PolynomialFunction;
23 import org.apache.commons.math.analysis.polynomials.PolynomialSplineFunction;
65 PolynomialFunction polynomials[] = new PolynomialFunction[n]; local
70 polynomials[i] = new PolynomialFunction(coefficients);
73 return new PolynomialSplineFunction(x, polynomials);
|
| NevilleInterpolator.java | 22 import org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
|
| /external/eigen/unsupported/doc/examples/ |
| PolynomialUtils1.cpp | 1 #include <unsupported/Eigen/Polynomials>
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/field/ |
| FiniteFields.java | 14 throw new IllegalArgumentException("Irreducible polynomials in GF(2) must have constant term");
|
| /external/llvm/test/CodeGen/X86/ |
| scev-interchange.ll | 8 %"struct.PolynomialSpace<1>" = type { %"struct.std::vector<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >", i32, %"struct.std::vector<int,std::allocator<int> >", %"struct.std::vector<int,std::allocator<int> >" }
9 %"struct.Polynomials::Polynomial<double>" = type { %struct.Subscriptor, %"struct.std::vector<double,std::allocator<double> >" }
17 %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >" = type { %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >::_Vector_impl" }
18 %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >::_Vector_impl" = type { %"struct.Polynomials::Polynomial<double>"*, %"struct.Polynomials::Polynomial<double>"*, %"struct.Polynomials::Polynomia (…)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| PolynomialFitter.java | 21 import org.apache.commons.math.analysis.polynomials.PolynomialFunction;
25 /** This class implements a curve fitting specialized for polynomials.
42 * <p>The polynomial fitter built this way are complete polynomials,
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/ |
| README | 23 what polynomials to use in your application. If someone has not specified the
24 polynomials to use, you will need to do some research to find one suitable for
27 polynomials.
93 polynomials over the integers mod 2.
|
| /external/fec/ |
| encode_rs.c | 38 * always be for the polynomials constructed by init_rs()
|
| simd-viterbi.3 | 149 code generator polynomials. Although only one set of polynomials are generally
153 The default polynomials for the viterbi27 routes
176 The default polynomials for the viterbi615 routines
179 swap the third and fourth polynomials.
202 generator polynomials for \fIall\fR instances of corresponding Viterbi decoder,
|
| fec.h | 9 /* r=1/2 k=7 convolutional encoder polynomials
62 /* r=1/2 k=9 convolutional encoder polynomials */
112 /* r=1/3 k=9 convolutional encoder polynomials */
164 /* r=1/6 k=15 Cassini convolutional encoder polynomials without symbol inversion
169 * Some other spacecraft use the same code, but with the polynomials in a different order.
|
| encode_rs.h | 44 * always be for the polynomials constructed by init_rs()
|
| /external/srtp/test/ |
| lfsr.c | 56 uint32_t polynomials[39] = { variable
280 u32_bit_string(polynomials[i],8), period(polynomials[i]));
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/ |
| intro.rst | 29 It is up to you to decide what polynomials to use in your application. Some
31 has not specified the polynomials to use, you will need to do some research to
100 implementing polynomials over the integers mod 2.
|
| /external/libopus/silk/ |
| A2NLSF.c | 46 /* Transforms polynomials from cos(n*f) to cos(f)^n */
89 /* Convert filter coefs to even and odd polynomials */
105 /* Transform polynomials from cos(n*f) to cos(f)^n */
|
| /external/e2fsprogs/e2fsck/ |
| crc32defs.h | 2 * There are multiple 16-bit CRC polynomials in common use, but this is
|
| /external/eigen/unsupported/test/ |
| polynomialutils.cpp | 11 #include <unsupported/Eigen/Polynomials>
|
