| /dports/math/gap/gap-4.11.0/pkg/Modules-2019.09.02/gap/ |
| H A D | GrothendieckGroup.gd | 51 ## The ⪆ category of polynomials modulo some power.
73 ## The ⪆ category of Chern polynomials with rank.
133 ## <Prop Arg="C" Name="IsIntegral" Label="for Chern polynomials"/>
159 ## <Oper Arg="chi, dim" Name="IsNumerical" Label="for univariate polynomials"/>
309 ## <Attr Arg="C" Name="AmbientDimension" Label="for Chern polynomials"/>
323 ## <Attr Arg="C" Name="Dimension Label="for Chern polynomials""/>
349 ## <Attr Arg="C" Name="RankOfObject" Label="for Chern polynomials"/>
362 ## <Attr Arg="C" Name="ChernCharacter" Label="for Chern polynomials"/>
375 ## <Attr Arg="C" Name="HilbertPolynomial" Label="for Chern polynomials"/>
388 ## <Attr Arg="C" Name="Dual" Label="for Chern polynomials"/>
|
| /dports/math/mpsolve/mpsolve-3.2.1/ |
| H A D | ChangeLog | 29 - Improved support to Chebyshev polynomials.
50 MPS_ALGORITHM_SECULAR_GA that gives performance boosts on easy polynomials.
59 - Added support for polynomials represented in the Chebyshev base.
61 the Chebyshev polynomials.
|
| /dports/math/fricas/fricas-1.3.7/src/algebra/ |
| H A D | pgrobner.spad | 13 ++ package which allows you to compute groebner bases for polynomials
17 ++ The resulting grobner basis is converted back to ordinary polynomials.
21 ++ computed as if the polynomials were over a field.
35 ++ for the list of polynomials lp in lexicographic order.
40 ++ for the list of polynomials lp with the terms
|
| /dports/math/pari/pari-2.13.3/src/functions/number_fields/ |
| H A D | nfcompositum | 6 of the number fields defined by the polynomials P and Q; flag is
15 be squarefree polynomials in $K[X]$ in the same variable. Outputs
17 The factors are given by a list of polynomials $R$ in $K[X]$, attached to
20 one of the polynomials is not squarefree.
38 both polynomials are irreducible and the corresponding number fields
|
| /dports/math/scilab/scilab-6.1.1/scilab/modules/polynomials/demos/ |
| H A D | polynomials.dem.gateway.sce | 9 demopath = get_absolute_file_path("polynomials.dem.gateway.sce");
11 add_demo("Polynomials",demopath+"polynomials.dem.gateway.sce");
|
| /dports/math/polymake/polymake-4.5/apps/ideal/rules/ |
| H A D | ideal_properties.rules | 56 # True if the ideal can be generated by homogeneous polynomials.
107 …# The initial forms of all polynomials in the [[BASIS]], with respect to either the [[ORDER_VECTOR…
140 # A binomial ideal represents an ideal which is generated by polynomials of
143 # x1^2 + x1 and 2x1 - x3 are not polynomials of this form.
153 # Rows correspond to polynomials, and columns to variables.
162 # and reencodes it into polynomials.
173 # Rows correspond to polynomials, and columns to variables.
|
| /dports/math/reduce/Reduce-svn5758-src/packages/xideal/ |
| H A D | xideal.red | 24 % Description: Tools for calculations with ideals of polynomials in
78 % reduces F with respect to the set of exterior polynomials S, which is
85 % autoreduces the polynomials in S.
88 % returns polynomials variables (as defined by xvars) from F
91 % returns polynomials coefficients (as defined by xvars) from F
137 xstorage % Storage and retrieval of critical pairs and polynomials.
150 !*trxideal := nil; % display new polynomials added to GB
|
| /dports/math/gap/gap-4.11.0/pkg/radiroot-2.8/ |
| H A D | CHANGES | 36 polynomials, to delegate other polynomials to appropriate methods
43 - Bug for linear polynomials reported by David Sevilla fixed in
|
| /dports/math/openturns/openturns-1.18/python/src/ |
| H A D | MeixnerFactory_doc.i.in | 20 Any sequence of orthogonal polynomials has a recurrence formula relating any
21 three consecutive polynomials as follows:
27 The recurrence coefficients for the Meixner polynomials come analytically
|
| /dports/math/pari_galpol/data/galpol/ |
| H A D | README | 1 A database of Galois polynomials (v 4.0)
4 This packages contains a database of polynomials defining Galois extensions of
6 all signatures (3657 groups, 7194 polynomials).
|
| /dports/math/gap/gap-4.11.0/pkg/float-0.9.1/doc/ |
| H A D | manual.six | 20 [ 3, 0, 0 ], 1, 7, "polynomials", "X826D8334845549EC" ],
24 [ "\033[1X\033[33X\033[0;-2YRoots of polynomials\033[133X\033[101X", "3.2",
25 [ 3, 2, 0 ], 25, 7, "roots of polynomials", "X788CDC24834012D7" ],
|
| /dports/math/reduce/Reduce-svn5758-src/packages/redlog/tplp/ |
| H A D | tplpkapur.red | 364 % change formula into set of polynomials
413 % polynomials.
460 % 1. Returns a list of polynomials equivalent to [f].
611 % Returns a list of polynomials.
625 % formula. Returns a list of polynomials.
677 % polynomials.
731 % is 0 or 1. Returns a list of polynomials.
829 % Returns a list of polynomials, beeing the s-polynomials overlapping
836 % Returns a list of polynomials, beeing the s-polynomials overlapping
1706 % the product of the polynomials in [l].
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/idrel-2.43/lib/ |
| H A D | modpoly.gi | 9 ## This file contains generic methods for module polynomials
14 ## . . . . . . . . . . . . . . . . . . . . . . . . . for monoid polynomials
189 InstallOtherMethod( \=, "generic method for module polynomials", true,
360 #M \+ for two module polynomials
362 InstallOtherMethod( \+, "generic method for module polynomials", true,
413 #M \- for a module polynomials
415 InstallOtherMethod( \-, "generic method for module polynomials", true,
454 #M \< for module polynomials
456 InstallOtherMethod( \<, "generic method for module polynomials", true,
559 #M \= for two logged module polynomials
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/math/reduce/Reduce-svn5758-src/packages/invbase/ |
| H A D | invbase.tex | 26 multivariate polynomials, such as solving systems of polynomial equations
96 polynomials $\{p_1,...,p_m\}$ one should type the command
98 where $p_i$ are polynomials in variables listed in the
102 polynomials. If $INVTORDER$ was omitted, all the kernels
105 The coefficients of polynomials $p_i$ may be integers as well as
106 rational numbers (or, accordingly, polynomials and rational functions
111 The value of the $INVBASE$ function is a list of integer polynomials
149 EXCEEDED $$ The resulting list of polynomials which is not an involutive
|
| /dports/databases/percona57-server/boost_1_59_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/databases/percona57-client/boost_1_59_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/devel/boost-libs/boost_1_72_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/devel/hyperscan/boost_1_75_0/libs/math/doc/sf/ |
| H A D | chebyshev.qbk | 47 The Chebyshev polynomials of the first kind are defined by the recurrence /T/[sub n+1](/x/) := /2xT…
110 Chebyshev polynomials of the second kind can be evaluated via `chebyshev_u`:
115 The evaluation of Chebyshev polynomials by a three-term recurrence is known to be
118 For this reason, evaluation of Chebyshev polynomials outside of \[-1, 1\] is strongly discouraged.
126 …jection operator which projects a function onto a finite-dimensional span of Chebyshev polynomials.
127 …he API, let's analyze why we might want to project a function onto a span of Chebyshev polynomials.
133 A projection onto the Chebyshev polynomials with a low accuracy requirement can vastly accelerate t…
163 …a function /f/ and returns a /near-minimax/ approximation to /f/ in terms of Chebyshev polynomials.
|
| /dports/devel/hyperscan/boost_1_75_0/libs/math/doc/internals/ |
| H A D | rational.qbk | 19 // Even polynomials:
29 // Odd polynomials
118 Evaluates the rational function (the ratio of two polynomials) described by
122 polynomials most have order /count-1/ with /count/ coefficients.
123 Otherwise both polynomials have order /N-1/ with /N/ coefficients.
152 with the two polynomials being evaluated
154 If /v/ is greater than one, then the polynomials are evaluated in reverse
155 order as polynomials in ['1\/v]: this avoids unnecessary numerical overflow when the
|
| /dports/math/gap/gap-4.11.0/pkg/gbnp/test/ |
| H A D | test17.test | 3 gap> # GBNP - computing Gröbner bases of noncommutative polynomials
78 #I number of entered polynomials is 3
79 #I number of polynomials after reduction is 3
90 #I G: Cleaning finished, 0 polynomials reduced
118 gap> # converted back to GAP polynomials with <Ref Func="NP2GPList" Style="Text"/>.
119 gap> # The functions used to convert the polynomials also require the algebra as an
|