Home
last modified time | relevance | path

Searched refs:polynomials (Results 151 – 175 of 3917) sorted by relevance

12345678910>>...157

/dports/math/coxeter3/coxeter-7b5a1f0/
H A Dpolynomials.h14 namespace polynomials {
20 namespace polynomials {
30 namespace polynomials {
42 namespace polynomials {
46 namespace polynomials {
95 namespace polynomials {
99 namespace polynomials {
188 namespace polynomials {
/dports/math/libpoly/libpoly-0.1.11/examples/cad/
H A DSMT 2017 (CAD).ipynb44 "- poly_map: map from variables to polynomials\n",
57 "# Add polynomials to projection map\n",
61 " # Add non-constant polynomials\n",
77 "# Add a collection of polynomials to projection map\n",
86 "Project the given polynomials:\n",
87 "- poly_map: polynomials arranged by top variable\n",
126 "- poly_map: projected polynomials\n",
190 "- add all polynomials\n",
/dports/math/gap/gap-4.11.0/lib/
H A Dpolyconw.gi12 ## Conway polynomials.
69 minimal polynomials of all compatible elements (~2004-2005)\n"),
87 ## List of lists caching (pre-)computed Conway polynomials.
101 ## polynomials of proper subfield. (But doesn't check that it is the
103 ## polynomials.
186 ## number of polynomials for GF(p^n) compatible with Conway polynomials for
251 cpols, # Conway polynomials for `d' in `nfacs'
258 pow, # powers of several polynomials
310 # Note that we enumerate monic polynomials with constant term
335 # Compute the Conway polynomials for all values $<n> / d$
[all …]
H A Dratfun.gd12 ## for rational functions, Laurent polynomials and polynomials and their
19 ## ignored when creating Laurent polynomials.
31 ## is the info class for univariate polynomials.
101 ## polynomials.
352 ## denominator are polynomials of degree 0.
1419 ## univariate polynomials as arguments.
1443 ## polynomials.
1467 ## representations of cancelled polynomials.
1488 ## both polynomials,
1509 ## indeed are polynomials.
[all …]
/dports/math/gap/gap-4.11.0/hpcgap/lib/
H A Dpolyconw.gi12 ## Conway polynomials.
69 minimal polynomials of all compatible elements (~2004-2005)\n"),
87 ## List of lists caching (pre-)computed Conway polynomials.
101 ## polynomials of proper subfield. (But doesn't check that it is the
103 ## polynomials.
186 ## number of polynomials for GF(p^n) compatible with Conway polynomials for
251 cpols, # Conway polynomials for `d' in `nfacs'
258 pow, # powers of several polynomials
310 # Note that we enumerate monic polynomials with constant term
335 # Compute the Conway polynomials for all values $<n> / d$
[all …]
/dports/math/maxima/maxima-5.43.2/doc/info/
H A Dgrobner.texi109 This switch indicates the coefficient ring of the polynomials that
215 are the arithmetical operations on polynomials.
220 Adds two polynomials @var{poly1} and @var{poly2}.
250 Returns the product of polynomials @var{poly1} and @var{poly2}.
300 This function parses polynomials to internal form and back. It
400 to a set of polynomials @var{polylist}.
422 polynomials and returns the resulting Groebner basis.
471 each polynomial is fully reduced with respect to the other polynomials.
551 where @math{polylist1} and @math{polylist2} are two lists of polynomials.
700 @var{polylist2} ist a list of n polynomials @code{[poly1,...,polyn]}.
[all …]
/dports/math/fricas/fricas-1.3.7/src/doc/sphinx/source/
H A Dfeatures.rst11 - non-commutative polynomials
14 - combinatorics, symmetric polynomials, special functions, number
26 polynomials over finite fields or polynomials having square matrices
/dports/math/pari/pari-2.13.3/src/functions/number_fields/
H A Dpolred7 polynomial T (gives minimal polynomials only). The following binary digits of
10 Finds polynomials with reasonably small coefficients defining subfields of
11 the number field defined by $T$. One of the polynomials always defines $\Q$
30 corresponding minimal polynomials.
/dports/math/octave-forge-geometry/geometry-4.0.0/inst/
H A Dpolygon2shape.m21 ## Converts a polygon to a shape with edges defined by smooth polynomials.
24 ## @var{shape} is a N-by-1 cell, where each element is a pair of polynomials
27 ## In its current state, the shape is formed by polynomials of degree 1. Therefore
45 # Transform edges into polynomials of degree 1;
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/hypertex/pages/
H A DGUESSPI.ht11 sequences of polynomials or rational functions over integers, given the
15 alebraic numbers, \spadtype{GuessPolynomial} for polynomials
20 Hermite polynomials.
H A DMPOLY.ht29 refer to the domain of multivariate polynomials in the variables
56 Conversions can be used to re-express such polynomials in terms of
80 Multivariate polynomials may be combined with univariate polynomials
87 quotients of polynomials in \spad{y} and \spad{z}.
100 whose coefficients are fractions in polynomials in \spad{y}.
/dports/math/pari_seadata/data/seadata/
H A DREADME1 Modular polynomials for PARI/GP
4 This package contains modular polynomials for p < 500, for use with ellsea.
6 These polynomials were extracted from the ECHIDNA databases
/dports/math/cln/cln-1.3.6/
H A DTODO16 modular polynomials: powmod etc.
20 + polynomials cl_MUP_MI, cl_MUP_I
25 + roots of polynomials mod N 1.6.1
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/
H A DDUPLICATE-askey1 Blurb::Select the standardized random variables (and associated basis polynomials) from the Askey f…
7 Laguerre orthogonal polynomials, respectively.
9 Specific mappings for the basis polynomials are based on a closest
/dports/math/py-libpoly/libpoly-0.1.11/debian/
H A Dcontrol14 Description: C library for manipulating multivariate polynomials
21 Description: C library for manipulating multivariate polynomials
34 Description: C library for manipulating multivariate polynomials
/dports/math/libpoly/libpoly-0.1.11/debian/
H A Dcontrol14 Description: C library for manipulating multivariate polynomials
21 Description: C library for manipulating multivariate polynomials
34 Description: C library for manipulating multivariate polynomials
/dports/math/openturns/openturns-1.18/python/src/
H A DKrawtchoukFactory_doc.i.in20 Any sequence of orthogonal polynomials has a recurrence formula relating any
21 three consecutive polynomials as follows:
27 The recurrence coefficients for the Krawtchouk polynomials come analytically
46 The Krawtchouk polynomials are only defined up to a degree :math:`m` equal
/dports/math/scilab/scilab-6.1.1/scilab/modules/core/tests/unit_tests/
H A Dfor.tst11 // polynomials, and complex polynomials.
61 // Loop over a vector of real polynomials
69 // Loop over a vector of complex polynomials
H A Dfor.dia.ref11 // polynomials, and complex polynomials.
54 // Loop over a vector of real polynomials
61 // Loop over a vector of complex polynomials
/dports/math/scilab/scilab-6.1.1/scilab/modules/overloading/macros/
H A D%choose.sci17 // for eigenspace associated to selected polynomials
19 // %sel = list of selected polynomials (user defined)
20 // eps = threshold for polynomials selection (eps= 0.0001 as default value)
26 // %sel=list(w(2),w(3)); // two selected polynomials
/dports/math/gap/gap-4.11.0/pkg/gbnp/lib/
H A Dnparith.gi2 # GBNP - computing Gröbner bases of noncommutative polynomials
231 ### of polynomials in NP format. The polynomials of <A>Lnp</A> are required to
529 ### G - set of non-commutative polynomials
564 ### G - set of non-commutative polynomials
681 ### contain the NP polynomials in <A>Lnp</A>. If <A>Lnp</A> only contains polynomials
691 ### the polynomials in Lnp.
694 ### - Lnp a list of NP polynomials
812 ### polynomials in <A>Lnpm</A>. If there are only polynomials in
821 ### the polynomials in Lnpm.
824 ### - Lnpm a list of npm polynomials
[all …]
/dports/math/gap/gap-4.11.0/pkg/DeepThought-1.0.2/gap/
H A Dapplications.g23 # polynomials := DTObj![PC_DTPPolynomials].
24 # Since the condition IsInt(polynomials[1][1][1]) is true if and only if
25 # "polynomials" is the ouput of DTP_DTpols_r, we can decide which
28 # polynomials[1] <-> f_1
29 # polynomials[1][1] <-> first g_alpha in f_1
30 # polynomials[1][1][1] <-> constant coefficient in first g_alpha in f_1
33 # polynomials[1] <-> list of the n polynomials f_{r, 1} (1 <= r <= n)
34 # polynomials[1][1] <-> polynomial f_{1, 1}
35 # polynomials[1][1][1] <-> first g_alpha in f_{1, 1}, this is a list
48 # polynomials f_r or f_rs were computed for DTObj.
[all …]
/dports/math/reduce/Reduce-svn5758-src/doc/manual/
H A Dbibasis.tex9 All this takes place not only in rings of commutative polynomials but also in Boolean rings.
39 Elements in $\mathbb{B\,}[\mathbf{X}]$ are {\em Boolean polynomials} and can be represented as fini…
91 …\item \texttt{initial\_polynomial\_list} is the list of polynomials containing the known basis of …
92 Boolean ideal. All given polynomials are treated modulo 2. See Example 1.
109 \item The list of polynomials which constitute the reduced Boolean Gr\"obner or Pommaret basis.
133 3: polynomials := {x0*x3+x1*x2,x2*x4+x0}$
134 4: bibasis(polynomials, variables, lex, t);
142 3: polynomials := {x0*x3+x1*x2,x2*x4+x0}$
143 4: bibasis(polynomials, variables, deglex, t);
156 3: polynomials := {x0*x3+x1*x2,x2*x4+x0}$
[all …]
/dports/math/gap/gap-4.11.0/pkg/gbnp/test/
H A Dtest18.test3 gap> # GBNP - computing Gröbner bases of noncommutative polynomials
48 gap> # Now enter the relations as GAP polynomials. It is possible to enter them with
75 #I number of entered polynomials is 3
76 #I number of polynomials after reduction is 3
82 #I number of entered polynomials is 7
83 #I number of polynomials after reduction is 7
139 #I number of entered polynomials is 6
140 #I number of polynomials after reduction is 6
146 #I number of entered polynomials is 7
147 #I number of polynomials after reduction is 7
/dports/math/reduce/Reduce-svn5758-src/packages/groebner/
H A Dgroebner.tst33 % Example 2. (Little) Trinks problem with 7 polynomials in 6 variables.
51 % Example 3. Hairer, Runge-Kutta 1, 6 polynomials 8 variables.
88 % Example 6. (Big) Trinks problem with 6 polynomials in 6 variables.
120 % form of polynomials.
135 % the basis polynomials.
137 % First example for tagged polynomials: show how a polynomial is
138 % represented as linear combination of the basis polynomials.
156 % Second example for tagged polynomials: representing a Groebner basis
157 % as a combination of the input polynomials, here in a simple geometric
163 % In the third example I enter two polynomials that have no common zero.

12345678910>>...157