/dports/devel/tcllib/tcllib-1.20/modules/math/ |
H A D | polynomials.test | 2 # polynomials.test -- 3 # Test cases for the ::math::polynomials package 19 useLocal polynomials.tcl math::polynomials 41 set f1 [::math::polynomials::polynomial {1 2 3 4}] 53 set f1 [::math::polynomials::polynomial {A B C}] 107 set idx [::math::polynomials::degreePolyn $f1] 120 set f2 [::math::polynomials::derivPolyn $f1] 134 set f2 [::math::polynomials::polynomial {1 2}] 135 set f3 [::math::polynomials::addPolyn $f1 $f2] 219 set f2 [::math::polynomials::polynomial {0}] [all …]
|
H A D | polynomials.tcllib.man | 2 [manpage_begin math::polynomials n 1.0.1] 10 [require math::polynomials [opt 1.0.1]] 18 the basic arithmetic operations are extended to polynomials 31 [call [cmd ::math::polynomials::polynomial] [arg coeffs]] 39 set f [::math::polynomials::polynomial [list $a $b $c $d] 49 [call [cmd ::math::polynomials::polynCmd] [arg coeffs]] 148 [call [cmd ::math::polynomials::derivPolyn] [arg polyn]] 159 [call [cmd ::math::polynomials::primitivePolyn] [arg polyn]] 171 [call [cmd ::math::polynomials::degreePolyn] [arg polyn]] 195 [call [cmd ::math::polynomials::allCoeffsPolyn] [arg polyn]] [all …]
|
/dports/devel/tcllibc/tcllib-1.20/modules/math/ |
H A D | polynomials.test | 2 # polynomials.test -- 3 # Test cases for the ::math::polynomials package 19 useLocal polynomials.tcl math::polynomials 41 set f1 [::math::polynomials::polynomial {1 2 3 4}] 53 set f1 [::math::polynomials::polynomial {A B C}] 107 set idx [::math::polynomials::degreePolyn $f1] 120 set f2 [::math::polynomials::derivPolyn $f1] 134 set f2 [::math::polynomials::polynomial {1 2}] 135 set f3 [::math::polynomials::addPolyn $f1 $f2] 219 set f2 [::math::polynomials::polynomial {0}] [all …]
|
H A D | polynomials.tcllib.man | 2 [manpage_begin math::polynomials n 1.0.1] 10 [require math::polynomials [opt 1.0.1]] 18 the basic arithmetic operations are extended to polynomials 31 [call [cmd ::math::polynomials::polynomial] [arg coeffs]] 39 set f [::math::polynomials::polynomial [list $a $b $c $d] 49 [call [cmd ::math::polynomials::polynCmd] [arg coeffs]] 148 [call [cmd ::math::polynomials::derivPolyn] [arg polyn]] 159 [call [cmd ::math::polynomials::primitivePolyn] [arg polyn]] 171 [call [cmd ::math::polynomials::degreePolyn] [arg polyn]] 195 [call [cmd ::math::polynomials::allCoeffsPolyn] [arg polyn]] [all …]
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/ |
H A D | files.nodist | 73 parameters/polynomials/README 83 parameters/polynomials/c60.poly 84 parameters/polynomials/c65.poly 85 parameters/polynomials/c70.poly 86 parameters/polynomials/c75.poly 87 parameters/polynomials/c80.poly 88 parameters/polynomials/c85.poly 89 parameters/polynomials/c90.poly 90 parameters/polynomials/c95.poly 91 parameters/polynomials/c100.poly [all …]
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/polynomials/locales/ |
H A D | polynomials.pot | 1 # Localization of the module polynomials 254 # File: modules/polynomials/demos/polynomials.dem.gateway.sce, line: 10 259 # File: modules/polynomials/demos/polynomials.dem.gateway.sce, line: 13 267 # File: modules/polynomials/macros/detr.sci, line: 38 278 # File: modules/polynomials/macros/detr.sci, line: 27 285 # File: modules/polynomials/macros/detr.sci, line: 20 327 # File: modules/polynomials/macros/gcd.sci, line: 22 333 # File: modules/polynomials/macros/gcd.sci, line: 26 341 # File: modules/polynomials/macros/gcd.sci, line: 34 342 # File: modules/polynomials/macros/lcm.sci, line: 29 [all …]
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/ode/nonstiff/ |
H A D | GraggBulirschStoerStepInterpolator.java | 172 polynomials = null; in GraggBulirschStoerStepInterpolator() 194 polynomials = null; in resetTables() 200 if (polynomials != null) { in resetTables() 201 System.arraycopy(polynomials, 0, newPols, 0, polynomials.length); in resetTables() 210 polynomials = newPols; in resetTables() 246 if ((polynomials == null) || (polynomials.length <= (mu + 4))) { in computeCoefficients() 261 polynomials[1][i] = ydiff; in computeCoefficients() 262 polynomials[2][i] = aspl; in computeCoefficients() 263 polynomials[3][i] = bspl; in computeCoefficients() 279 polynomials[6][i] = 16 * (yMidDots[2][i] - ph2 + polynomials[4][i]); in computeCoefficients() [all …]
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/analysis/interpolation/ |
H A D | SplineInterpolatorTest.java | 25 import org.apache.commons.math3.analysis.polynomials.PolynomialFunction; 26 import org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction; 57 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinearDegenerateTwoSegment() local 59 TestUtils.assertEquals(polynomials[0].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateTwoSegment() 80 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinearDegenerateThreeSegment() local 104 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinear() local 141 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateSin() local 212 PolynomialFunction polynomials[] = f.getPolynomials(); in verifyConsistency() local 215 … Assert.assertEquals(polynomials[i].value(x[i +1] - x[i]), polynomials[i + 1].value(0), 0.1); in verifyConsistency() 216 Assert.assertEquals(polynomials[i].derivative().value(x[i +1] - x[i]), in verifyConsistency() [all …]
|
H A D | LinearInterpolatorTest.java | 24 import org.apache.commons.math3.analysis.polynomials.PolynomialFunction; 25 import org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction; 53 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinearDegenerateTwoSegment() local 55 TestUtils.assertEquals(polynomials[0].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateTwoSegment() 57 TestUtils.assertEquals(polynomials[1].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateTwoSegment() 75 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinearDegenerateThreeSegment() local 77 TestUtils.assertEquals(polynomials[0].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateThreeSegment() 79 TestUtils.assertEquals(polynomials[1].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateThreeSegment() 81 TestUtils.assertEquals(polynomials[2].getCoefficients(), target, coefficientTolerance); in testInterpolateLinearDegenerateThreeSegment() 98 PolynomialFunction polynomials[] = ((PolynomialSplineFunction) f).getPolynomials(); in testInterpolateLinear() local [all …]
|
/dports/math/py-chaospy/chaospy-4.3.3/chaospy/expansion/ |
H A D | stieltjes.py | 111 _, polynomials, norms, = chaospy.stieltjes(numpy.max(order), dist) 113 polynomials = numpoly.true_divide( 114 numpoly.polynomial(polynomials), numpy.sqrt(norms)) 117 polynomials = polynomials.reshape((len(dist), numpy.max(order)+1)) 124 polynomials = numpoly.prod(chaospy.polynomial([ 125 poly[idx] for poly, idx in zip(polynomials, indices.T)]), 0) 129 polynomials = polynomials.flatten() 133 return polynomials, norms 134 return polynomials
|
H A D | chebyshev.py | 46 _, [polynomials], [norms] = chaospy.recurrence.analytical_stieltjes( 49 polynomials = chaospy.true_divide(polynomials, numpy.sqrt(norms)) 51 return (polynomials, norms) if retall else polynomials 94 _, [polynomials], [norms] = chaospy.recurrence.analytical_stieltjes( 97 polynomials= chaospy.true_divide(polynomials, numpy.sqrt(norms)) 99 return (polynomials, norms) if retall else polynomials
|
H A D | gram_schmidt.py | 67 polynomials = [basis[0]] 74 orth = chaospy.E(basis[idx]*polynomials[idy], dist, **kws) 75 basis[idx] = basis[idx]-polynomials[idy]*orth/norms[idy] 84 polynomials.append(basis[idx]) 86 polynomials = chaospy.polynomial(polynomials).flatten() 89 return polynomials, norms 90 return polynomials
|
H A D | laguerre.py | 28 _, [polynomials], [norms] = chaospy.recurrence.analytical_stieltjes( 31 polynomials = chaospy.true_divide(polynomials, numpy.sqrt(norms)) 33 return (polynomials, norms) if retall else polynomials
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/analysis/polynomials/ |
H A D | PolynomialSplineFunction.java | 17 package org.apache.commons.math3.analysis.polynomials; 79 private final PolynomialFunction polynomials[]; field in PolynomialSplineFunction 105 polynomials == null) { in PolynomialSplineFunction() 112 if (knots.length - 1 != polynomials.length) { in PolynomialSplineFunction() 120 this.polynomials = new PolynomialFunction[n]; in PolynomialSplineFunction() 121 System.arraycopy(polynomials, 0, this.polynomials, 0, n); in PolynomialSplineFunction() 146 if ( i >= polynomials.length ) { in value() 149 return polynomials[i].value(v - knots[i]); in value() 190 if ( i >= polynomials.length ) { in value() 193 return polynomials[i].value(t.subtract(knots[i])); in value() [all …]
|
/dports/devel/tcllib/tcllib-1.20/embedded/md/tcllib/files/modules/math/ |
H A D | polynomials.md | 2 [//000000001]: # (math::polynomials \- Tcl Math Library) 16 math::polynomials \- Polynomial functions 41 package require math::polynomials ?1\.0\.1? 43 [__::math::polynomials::polynomial__ *coeffs*](#1) 44 [__::math::polynomials::polynCmd__ *coeffs*](#2) 45 [__::math::polynomials::evalPolyn__ *polynomial* *x*](#3) 46 [__::math::polynomials::addPolyn__ *polyn1* *polyn2*](#4) 51 [__::math::polynomials::derivPolyn__ *polyn*](#9) 52 [__::math::polynomials::primitivePolyn__ *polyn*](#10) 53 [__::math::polynomials::degreePolyn__ *polyn*](#11) [all …]
|
/dports/devel/tcllibc/tcllib-1.20/embedded/md/tcllib/files/modules/math/ |
H A D | polynomials.md | 2 [//000000001]: # (math::polynomials \- Tcl Math Library) 16 math::polynomials \- Polynomial functions 41 package require math::polynomials ?1\.0\.1? 43 [__::math::polynomials::polynomial__ *coeffs*](#1) 44 [__::math::polynomials::polynCmd__ *coeffs*](#2) 45 [__::math::polynomials::evalPolyn__ *polynomial* *x*](#3) 46 [__::math::polynomials::addPolyn__ *polyn1* *polyn2*](#4) 51 [__::math::polynomials::derivPolyn__ *polyn*](#9) 52 [__::math::polynomials::primitivePolyn__ *polyn*](#10) 53 [__::math::polynomials::degreePolyn__ *polyn*](#11) [all …]
|
/dports/math/gap/gap-4.11.0/pkg/idrel-2.43/doc/ |
H A D | manual.six | 41 [ 4, 0, 0 ], 1, 19, "monoid polynomials", "X83B25026816C87CE" ], 44 01X", "4.1", [ 4, 1, 0 ], 9, 19, "construction of monoid polynomials", 57 [ 5, 0, 0 ], 1, 23, "module polynomials", "X7B5CEEDF82747121" ], 60 01X", "5.1", [ 5, 1, 0 ], 19, 23, "construction of module polynomials", 143 20, "terms for monoid polynomials", "X810C636178EA42D0" ], 156 [ "=,+,* for monoid polynomials", "4.3", [ 4, 3, 0 ], 114, 21, 157 "= + * for monoid polynomials", "X832341AB7A04BA45" ], 171 24, "terms for module polynomials", "X79E2DD9879D9182C" ], 177 61, 24, "length for module polynomials", "X79E2DD9879D9182C" ], 180 [ "=,+,* for module polynomials", "5.3", [ 5, 3, 0 ], 99, 25, [all …]
|
/dports/math/py-numpy/numpy-1.20.3/doc/source/reference/ |
H A D | routines.polynomials.rst | 7 the :doc:`convenience classes <routines.polynomials.classes>` 29 routines.polynomials.classes 30 routines.polynomials.polynomial 31 routines.polynomials.chebyshev 32 routines.polynomials.hermite 33 routines.polynomials.hermite_e 34 routines.polynomials.laguerre 35 routines.polynomials.legendre 36 routines.polynomials.polyutils 42 routines.polynomials.poly1d
|
/dports/science/octopus/octopus-10.5/src/grid/ |
H A D | derivatives.F90 | 436 integer, allocatable :: polynomials(:,:) local 487 SAFE_DEALLOCATE_A(polynomials) 505 SAFE_DEALLOCATE_A(polynomials) 516 SAFE_DEALLOCATE_A(polynomials) 525 SAFE_DEALLOCATE_A(polynomials) 544 SAFE_DEALLOCATE_A(polynomials) 557 SAFE_DEALLOCATE_A(polynomials) 775 integer, allocatable :: polynomials(:,:) local 796 SAFE_ALLOCATE(polynomials(1:this%dim, 1:op(1)%stencil%npoly)) 809 if(k == i .and. polynomials(k, j) /= 2) this_one = .false. [all …]
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/analysis/polynomials/ |
H A D | PolynomialSplineFunctionTest.java | 17 package org.apache.commons.math3.analysis.polynomials; 47 protected PolynomialFunction[] polynomials = { field in PolynomialSplineFunctionTest 64 new PolynomialSplineFunction(knots, polynomials); in testConstructor() 70 new PolynomialSplineFunction(new double[] {0}, polynomials); in testConstructor() 77 new PolynomialSplineFunction(new double[] {0,1,2,3,4}, polynomials); in testConstructor() 84 new PolynomialSplineFunction(new double[] {0,1, 3, 2}, polynomials); in testConstructor() 94 new PolynomialSplineFunction(knots, polynomials); in testValues() 108 polynomials[index].value(x - knots[index]), spline.value(x), tolerance); in testValues() 116 polynomials[i].value(0), spline.value(knots[i]), tolerance); in testValues() 139 new PolynomialSplineFunction(knots, polynomials); in testIsValidPoint()
|
/dports/math/pari/pari-2.13.3/src/functions/polynomials/ |
H A D | polcyclofactors | 2 Section: polynomials 5 Help: polcyclofactors(f): returns a vector of polynomials, whose product is 6 the product of distinct cyclotomic polynomials dividing f. 7 Doc: returns a vector of polynomials, whose product is the product of 8 distinct cyclotomic polynomials dividing $f$. 17 @eprog\noindent In general, the polynomials are products of cyclotomic 18 polynomials and not themselves irreducible:
|
/dports/math/gap/gap-4.11.0/pkg/float-0.9.1/tst/ |
H A D | polynomials.tst | 3 #W polynomials.tst Float Package Laurent Bartholdi 9 ## This file tests polynomials 13 gap> START_TEST("polynomials"); 27 gap> STOP_TEST( "polynomials.tst", 3*10^8 ); 28 polynomials 30 #E polynomials.tst . . . . . . . . . . . . . . . . . . . . . . . . .ends here
|
/dports/math/py-numpoly/numpoly-1.2.3/numpoly/array_function/ |
H A D | apply_along_axis.py | 104 polynomials = numpoly.align.align_exponents(*collection) 105 dtype = numpoly.result_type(*polynomials) 109 exponents=polynomials[0].exponents, 111 names=polynomials[0].indeterminants, 114 for idx, polynomial in enumerate(polynomials): 120 names=polynomials[0].indeterminants, 121 allocation=polynomials[0].allocation,
|
/dports/math/openturns/openturns-1.18/python/doc/theory/meta_modeling/ |
H A D | orthogonal_polynomials.rst | 3 Orthogonal polynomials 7 orthogonal polynomials. Some of these sequences will be used to 30 The chosen inner product induces a norm on polynomials in the usual 44 Moreover, we consider families of *orthonormal* polynomials 45 :math:`(P_n)_{n\geq 0}`, that is polynomials with a unit norm: 51 | Any sequence of orthogonal polynomials has a recurrence formula 52 relating any three consecutive polynomials as follows: 58 | **Orthogonormal polynomials with respect to usual probability 63 | Note that the orthonormal polynomials are 81 the so-called Charlier and Krawtchouk polynomials: [all …]
|
/dports/math/py-Diofant/Diofant-0.13.0/docs/modules/functions/ |
H A D | special.rst | 133 .. automodule:: diofant.functions.special.polynomials 138 .. autoclass:: diofant.functions.special.polynomials.jacobi 146 .. autoclass:: diofant.functions.special.polynomials.gegenbauer 152 .. autoclass:: diofant.functions.special.polynomials.chebyshevt 155 .. autoclass:: diofant.functions.special.polynomials.chebyshevu 158 .. autoclass:: diofant.functions.special.polynomials.chebyshevt_root 167 .. autoclass:: diofant.functions.special.polynomials.legendre 170 .. autoclass:: diofant.functions.special.polynomials.assoc_legendre 176 .. autoclass:: diofant.functions.special.polynomials.hermite 182 .. autoclass:: diofant.functions.special.polynomials.laguerre [all …]
|