| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialUtils1.cpp | 11 Eigen::Matrix<double,5,1> polynomial; in main() local
12 roots_to_monicPolynomial( roots, polynomial ); in main()
14 for( int i=0; i<4; ++i ){ cout << polynomial[i] << ".x^" << i << "+ "; } in main()
15 cout << polynomial[4] << ".x^4" << endl; in main()
18 evaluation[i] = poly_eval( polynomial, roots[i] ); } in main()
|
| D | PolynomialSolver1.cpp | 14 Eigen::Matrix<double,6,1> polynomial; in main() local
15 roots_to_monicPolynomial( roots, polynomial ); in main()
17 PolynomialSolver<double,5> psolve( polynomial ); in main()
|
| /external/eigen/unsupported/Eigen/ |
| D | Polynomials | 29 * \brief This module provides a QR based polynomial solver.
44 and a QR based polynomial solver.
48 polynomials, computing estimates about polynomials and next the QR based polynomial
68 evaluates a polynomial at a given point using stabilized Hörner method.
70 …The following code: first computes the coefficients in the monomial basis of the monic polynomial …
71 then, it evaluates the computed polynomial, using a stabilized Hörner method.
81 …um bound (the Cauchy one: \f$C(p)\f$) for the absolute value of a root of the given polynomial i.e.
91 …(the Cauchy one: \f$c(p)\f$) for the absolute value of a non zero root of the given polynomial i.e.
98 \section QR polynomial solver class
99 …Computes the complex roots of a polynomial by computing the eigenvalues of the associated companio…
[all …]
|
| /external/arm-optimized-routines/math/tools/ |
| D | cos.sollya | 1 // polynomial for approximating cos(x)
6 deg = 8; // polynomial degree
10 // find even polynomial with minimal abs error compared to cos(x)
|
| D | v_sin.sollya | 1 // polynomial for approximating sin(x)
6 deg = 15; // polynomial degree
10 // find even polynomial with minimal abs error compared to sin(x)/x
|
| D | log.sollya | 1 // polynomial for approximating log(1+x)
11 // find log(1+x)/x polynomial with minimal relative error
12 // (minimal relative error polynomial for log(1+x) is the same * x)
|
| D | v_log.sollya | 1 // polynomial used for __v_log(x)
10 // find log(1+x)/x polynomial with minimal relative error
11 // (minimal relative error polynomial for log(1+x) is the same * x)
|
| D | sin.sollya | 1 // polynomial for approximating sin(x)
6 deg = 7; // polynomial degree
10 // find even polynomial with minimal abs error compared to sin(x)/x
|
| D | log2.sollya | 1 // polynomial for approximating log2(1+x)
15 // find log2(1+x)/x polynomial with minimal relative error
16 // (minimal relative error polynomial for log2(1+x) is the same * x)
|
| D | v_exp.sollya | 1 // polynomial for approximating e^x
11 // find polynomial with minimal abs error
|
| D | log_abs.sollya | 1 // polynomial for approximating log(1+x)
11 // find log(1+x) polynomial with minimal absolute error
|
| D | exp.sollya | 1 // polynomial for approximating e^x
12 // find polynomial with minimal abs error
|
| /external/llvm-project/libc/AOR_v20.02/math/tools/ |
| D | cos.sollya | 1 // polynomial for approximating cos(x)
7 deg = 8; // polynomial degree
11 // find even polynomial with minimal abs error compared to cos(x)
|
| D | v_sin.sollya | 1 // polynomial for approximating sin(x)
7 deg = 15; // polynomial degree
11 // find even polynomial with minimal abs error compared to sin(x)/x
|
| D | log.sollya | 1 // polynomial for approximating log(1+x)
12 // find log(1+x)/x polynomial with minimal relative error
13 // (minimal relative error polynomial for log(1+x) is the same * x)
|
| D | v_log.sollya | 1 // polynomial used for __v_log(x)
11 // find log(1+x)/x polynomial with minimal relative error
12 // (minimal relative error polynomial for log(1+x) is the same * x)
|
| D | sin.sollya | 1 // polynomial for approximating sin(x)
7 deg = 7; // polynomial degree
11 // find even polynomial with minimal abs error compared to sin(x)/x
|
| D | log2.sollya | 1 // polynomial for approximating log2(1+x)
16 // find log2(1+x)/x polynomial with minimal relative error
17 // (minimal relative error polynomial for log2(1+x) is the same * x)
|
| D | v_exp.sollya | 1 // polynomial for approximating e^x
12 // find polynomial with minimal abs error
|
| /external/flac/src/libFLAC/ |
| D | crc.c | 348 FLAC__uint16 polynomial, crc;
349 polynomial = 0x8005;
355 crc = (crc << 1) ^ (crc & (1 << 15) ? polynomial : 0);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/field/ |
| D | GenericPolynomialExtensionField.java | 12 GenericPolynomialExtensionField(FiniteField subfield, Polynomial polynomial) in GenericPolynomialExtensionField() argument
15 this.minimalPolynomial = polynomial; in GenericPolynomialExtensionField()
|
| /external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/math/field/ |
| D | GenericPolynomialExtensionField.java | 13 GenericPolynomialExtensionField(FiniteField subfield, Polynomial polynomial) in GenericPolynomialExtensionField() argument
16 this.minimalPolynomial = polynomial; in GenericPolynomialExtensionField()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/field/ |
| D | GenericPolynomialExtensionField.java | 13 GenericPolynomialExtensionField(FiniteField subfield, Polynomial polynomial) in GenericPolynomialExtensionField() argument
16 this.minimalPolynomial = polynomial; in GenericPolynomialExtensionField()
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| D | f.cpp | 88 const boost::math::tools::polynomial<boost::math::ntl::RR>& n, in show_extra()
89 const boost::math::tools::polynomial<boost::math::ntl::RR>& d, in show_extra()
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | crc32c.c | 149 uint32_t polynomial EXT2FS_ATTR((unused))) in crc32_le_generic()
156 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0); in crc32_le_generic()
200 uint32_t polynomial EXT2FS_ATTR((unused))) in crc32_be_generic()
208 (crc << 1) ^ ((crc & 0x80000000) ? polynomial : in crc32_be_generic()
|