Home
last modified time | relevance | path

Searched +refs:coeff +refs:contains +refs:powers (Results 1 – 25 of 161) sorted by relevance

1234567

/dports/math/reduce/Reduce-svn5758-src/packages/taylor/
H A Dtaysimp.red59 addto!-all!-taytpelorders, get!-cst!-coeff, smallest!-increment,
76 if the argument contains a Taylor kernel and everything
102 then quotsq(get!-cst!-coeff mvar numr nm,dd)
174 then return addsq(get!-cst!-coeff tay,notay)
204 % Remark: the call to SMEMQLP checks if rest contains one of
234 % this requires Taylor expansion of p if it contains
237 % Remark: the call to SMEMQLP checks if p contains one of
253 then multpq(p,get!-cst!-coeff tk)
317 % algorithm is a scheme that computes powers of two.
329 COMMENT non-integer powers of Taylor kernels;
[all …]
/dports/math/gap/gap-4.11.0/pkg/wedderga-4.9.5/lib/
H A Didempot.gi65 ## The list ltrace contains information about the trace of a n-th roots of 1.
112 ## The list ltrace contains information about the trace of a n-th roots of 1.
326 exp, # Exponent of the elements of Trans as powers of x
403 ## The list ltrace contains information about the traces of the n-th roots of 1.
442 coeff := [];
448 coeff:=Inverse(Size(K)*One(Fq))*coeff;
462 ## The list ltrace contains information about the traces of the n-th roots of 1.
493 coeff := [];
499 coeff:=Inverse(Size(K)*One(Fq))*coeff;
574 coeff:=Inverse(Size(K)*One(Fq))*coeff;
[all …]
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/integration/
H A DintegrationTestsLib.mpl74 # coeff((epsilon+v1)^(M+d)*1
83 coeff(LL,epsilon,starting[2]-1);
108 # Decomposing a monomial in powers of linear forms.
193 {seq([coeff(X,x[subL[i]],1),subL[i]],i=1..nops(subL))};
246 #Makes a random polynomial. Each polynomial contains at most r monomilas of degree between [1, M].
247 #Then converts the polynomial to our list syntax: [ [coeff., [exps]]+ ]
255 #Makes a random homogeneous polynomial. Each polynomial contains at most r monomilas of degree betw…
266 if ( rationalCoeff = 0) then #make integer coeff. polynomials.
273 else #make rational coeff. polynomials.
289 #Makes a random non-homogeneous polynomial. Each polynomial contains at most r monomilas of degree …
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/odesolve/
H A Dodenon1.red72 %% If ode contains exponentials then the above sub can produce a
74 odecoeffs := coeff(ode_p, p);
290 %% F, or a quotient of powers (quotient (expt ... ) (expt ... )) which
328 length(tmp := coeff(first tmp, x)) neq 2 or % coeff of y^0
332 length(tmp := coeff(first tmp, x)) neq 2 or % coeff of y^0
351 %% symbolic powers (expt forms) that both depend on `x'.
356 if eqcar(cadr u, 'expt) then % symbolic powers
410 %% In the latter case, combine the powers of y.
495 c := coeff(rhs, y);
550 c := coeff(ode_p, y);
[all …]
/dports/math/gap/gap-4.11.0/lib/
H A Dcyclotom.gi16 ## This file contains methods for cyclotomics.
448 coeff:= val;
459 if coeff < 0 then
1060 coeff:= sign;
1063 return coeff;
1110 irrat:= coeff * qN;
1538 # and contains no unknowns.
1712 # The row is rational or contains unknowns.
1800 powers:= [ 1 ];
1804 powers[i]:= pow;
[all …]
H A Dctblmono.gi11 ## This file contains the functions dealing with monomiality questions for
1548 # the list `Delta( G )' contains an entry that is bigger
1553 comment := "list Delta( G ) contains entry > 1" );
1817 # of $G$ that contains <N>.
2294 coeff:= IntVecFFE(
2304 v[j]:= coeff[ j+2 ] - coeff[j];
2369 # generators 3 to $3+s-1$ are the powers of $t$ that are
2428 Atr[i][m]:= coeff[i];
2444 coeff := IntVecFFE( coeff );
2500 inv:= Int( coeff[1]^-1 );
[all …]
H A Dratfun.gi11 ## This file contains methods for rational functions, laurent
981 #M <coeff> * <rat-fun>
1024 #M <coeff> * <rat-fun>
1027 InstallMethod( \*, "coeff * rat-fun", IsCoeffsElms,
1036 #M <rat-fun> * <coeff>
1039 InstallMethod( \*, "rat-fun * coeff", IsElmsCoeffs,
1061 #M <polynomial> + <coeff>
1261 #M <ratfun> + <coeff>
1288 InstallMethod( \+, "ratfun + coeff", IsElmsCoeffs,
1294 InstallMethod( \+, "coeff + ratfun ", IsCoeffsElms,
[all …]
/dports/math/gap/gap-4.11.0/pkg/guarana-0.96.2/tst/completeOldCode/
H A Dbch.g34 # c+1 contains the old series plus some new terms.
184 # contains only y_i
305 # deal with powers
729 # if zero coeff then add
752 # c+1 contains the old series plus some new terms.
985 local basisL,coeff,i,e;
988 for i in [1..Length(coeff)] do
989 e := coeff[i];
1088 local basis, coeff,i,ll;
1092 for i in [1..Length(coeff)] do
[all …]
/dports/math/barvinok/barvinok-0.41.5/doc/
H A DInternal.tex63 and the final column contains the constant $c$.
70 $d v_i$ and the final column contains $d$.
71 For a ray, the final column contains $0$.
716 vec_QQ coeff;
729 In the numerator, each element of \ai[\tt]{coeff} and each row of \ai[\tt]{power}
731 The vector \ai[\tt]{coeff} contains the rational coefficients
733 The columns of \ai[\tt]{power} correspond to the powers
756 n.coeff & 3 & 2 \\
819 It makes all powers in the denominator lexico-positive,
822 order of the combined powers in the denominator.
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/scope/
H A Dcodhrn.red9 % This module contains procedures which implement a generalized Horner;
22 % tation. From this tree a list of terms is extracted with the powers ;
246 % the powers are equal the coefficients are added. ;
360 % form' in decsending order w.r.t. the powers of these ;
376 % hn contains the coefficients for the terms var^n upto ;
526 c:=reverse coeff(p,x)$
547 c:=reverse coeff(p,x)$
/dports/math/form/form-4.2.1/check/
H A Dfixes.frm248 * Freeze when PolyRatFun contains dot products
480 CFunction coeff,coeff2;
485 Local test2 = + dum_(1 + 576/7117*zeta2)*coeff(- 7117,81)*ca^2*cf;
488 Identify coeff(x?neg_,y?) = -coeff(-x,y);
489 Identify dum_(z?)*coeff(x?,y?) = dum_(z * x/y);
493 PolyRatFun coeff;
500 Identify coeff(x?neg_,y?) = -coeff(-x,y);
501 *Identify coeff(x?,y?) = coeff2(x,y);
735 * Freeze when pattern matchings with powers of dollar variables ($x^n?)
815 * Errors in symbol powers
/dports/math/reduce/Reduce-svn5758-src/packages/laplace/
H A Dlaplace.red327 % U is standard form, not containing integer powers of lp!&.
340 % U is standard term, not containing integer powers of lp!&.
344 w:=cdr u; % l.coeff. - i.e. st.f.
361 w1:=cdar w; % l.coeff - i.e. st.f.
444 % U and v are standard powers for one-func., w is leading coeff.
445 % Returns standard quotient if all coeff. are domains, otherwise nil.
696 % contains only powers from numerator of expression, depends on il!&,
698 % contains only powers from denominator of expression, depends on il!&
1022 % Now n is polynomial of il!& with constant coeff.
/dports/editors/neovim/neovim-0.6.1/runtime/syntax/
H A Dmaxima.vim17 …matchgroup=Delimiter start="(" matchgroup=Delimiter end=")" transparent contains=ALLBUT,maximaErro…
18 …matchgroup=Delimiter start="{" matchgroup=Delimiter end="}" transparent contains=ALLBUT,maximaErro…
19 …atchgroup=Delimiter start="\[" matchgroup=Delimiter end="]" transparent contains=ALLBUT,maximaErro…
50 syn keyword maximaFunc clear_rules closefile closeps cmetric cnonmet_flag coeff
143 syn keyword maximaFunc polartorect polynome2ele posfun potential powerdisp powers
211 syn region maximaString start=+"+ skip=+\\\\\|\\"+ end=+"+ contains=maximaSpecial
227 syn region maximaCommentBlock start="/\*" end="\*/" contains=maximaString,maximaTodo,maximaComment…
/dports/editors/vim/vim-8.2.3745/runtime/syntax/
H A Dmaxima.vim17 …matchgroup=Delimiter start="(" matchgroup=Delimiter end=")" transparent contains=ALLBUT,maximaErro…
18 …matchgroup=Delimiter start="{" matchgroup=Delimiter end="}" transparent contains=ALLBUT,maximaErro…
19 …atchgroup=Delimiter start="\[" matchgroup=Delimiter end="]" transparent contains=ALLBUT,maximaErro…
50 syn keyword maximaFunc clear_rules closefile closeps cmetric cnonmet_flag coeff
143 syn keyword maximaFunc polartorect polynome2ele posfun potential powerdisp powers
211 syn region maximaString start=+"+ skip=+\\\\\|\\"+ end=+"+ contains=maximaSpecial
227 syn region maximaCommentBlock start="/\*" end="\*/" contains=maximaString,maximaTodo,maximaComment…
/dports/math/maxima/maxima-5.43.2/doc/info/
H A DPolynomials.texi50 contains any subexpressions in CRE form, the symbol @code{/R/} will follow the
173 @deffn {Function} coeff @
284 @c coeff (c*(a + b)^3, a);
286 @c coeff (%, a);
289 @c coeff (%, (a + b)^3);
293 (%i1) coeff (c*(a + b)^3, a);
302 (%i3) coeff (%, a);
316 (%i6) coeff (%, (a + b)^3);
324 @c coeff ([4*a, -3*a, 2*a], a);
1809 @code{coeff} returns 1.
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/arnum/
H A Dbath.red481 (lambda coeff;
482 if not null coeff then <<
483 form := adjust!-algebraics coeff;
484 f := addf(f,negf(coeff))
489 (lambda coeff;
490 if not null coeff then <<
492 f := addf(f,negf( (ker .** i) .* coeff .+ nil ))
789 % there is a fudge for :expt, which doesn't expect powers of domain
1201 else contains!-algebraic(lc f) or contains!-algebraic(red f);
1367 else contains!-alpha(lc f,a) or contains!-alpha(red f,a);
[all …]
/dports/math/gap/gap-4.11.0/pkg/guarana-0.96.2/gap/malcor/
H A Dbch.gi16 ## In addition, this file contains code for the computation of
161 # contains only y_i
281 # deal with powers
712 # delete entries with zero coeff
715 # if zero coeff then add
736 # c+1 contains the old series plus some new terms.
/dports/math/reduce/Reduce-svn5758-src/csl/reduce.doc/
H A Dstructr.tex198 is a separation command. All terms involving fixed powers of the declared
199 expressions are printed as a product of the fixed powers and a sum of the
207 causes all powers of {\tt X} and {\tt SIN(X)} and all functions of
250 fractions and negative powers appear in the output. With {\tt DIV} on, our
512 will generate a file {\tt forfil} that contains:
621 will generate a file {\tt out} that contains
649 Let us suppose that the workspace contains
695 Let us suppose that {\tt M}, a 2 by 1 matrix, contains the elements {\tt
758 coeff((y^2+z)^3/z,y);
767 coeff((y^2+z)^3/y,y);
/dports/math/cmh/cmh-1.1.0/scripts/
H A Dshimura.gp415 /* Since the defining polynomial of K contains only even powers of y,
417 powers of y preserves this property. The same holds for complex
420 Since xi defining the symplectic form E contains only odd powers
944 my (coeff);
949 coeff = polcoeff (Omega [i,j], 2*k);
950 if (coeff != 0,
951 if (coeff > 0,
1032 /* treat generator i and its powers */
1072 /* treat generator i and its powers */
1363 /* Otherwise a is in fact a list of powers. */
[all …]
/dports/math/gap/gap-4.11.0/hpcgap/lib/
H A Dratfun.gi11 ## This file contains methods for rational functions, laurent
987 #M <coeff> * <rat-fun>
1030 #M <coeff> * <rat-fun>
1033 InstallMethod( \*, "coeff * rat-fun", IsCoeffsElms,
1042 #M <rat-fun> * <coeff>
1045 InstallMethod( \*, "rat-fun * coeff", IsElmsCoeffs,
1067 #M <polynomial> + <coeff>
1267 #M <ratfun> + <coeff>
1294 InstallMethod( \+, "ratfun + coeff", IsElmsCoeffs,
1300 InstallMethod( \+, "coeff + ratfun ", IsCoeffsElms,
[all …]
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dmantepse.spad1423 ++ guessers to the successive differences if ops contains the symbol
1424 ++ guessSum and quotients if ops contains the symbol guessProduct to
1430 ++ guessers to the successive differences if ops contains the symbol
1431 ++ \spad{guessSum} and quotients if ops contains the symbol
2357 -- differentiation, we substitute powers of $x$ into $f$.
2855 its lowest degree term contains the transcendental element, it depends on
3192 vanishes. When the first coefficient that does not vanish contains the
3842 iim2(coeff : R) : EXPRR == coeff::EXPRR
3852 iim2(coeff : R) : EXPRR == (convert(coeff)@Integer)::EXPRR
3869 (coeff : R) : EXPRR +-> iim2 coeff, p)$PL1
[all …]
/dports/math/reduce/Reduce-svn5758-src/doc/manual/
H A Dstructr.tex207 is a separation command. All terms involving fixed powers of the declared
208 expressions are printed as a product of the fixed powers and a sum of the
225 causes all powers of \texttt{X} and \texttt{SIN(X)} and all functions of
273 fractions and negative powers appear in the output. With \sw{DIV} on, our
565 will generate a file \texttt{forfil} that contains:
679 will generate a file \texttt{out} that contains
708 Let us suppose that the workspace contains
754 Let us suppose that \texttt{M}, a 2 by 1 matrix, contains the elements {\tt
821 coeff((y^2+z)^3/z,y);
830 coeff((y^2+z)^3/y,y);
/dports/math/latte-integrale/latte-version_1_7_6/doc/
H A Dmanual.tex171 integrating powers of linear forms can be done in polynomial time
173 polynomial as a sum of powers of linear forms is known as the polynomial
211 weight function is a polynomial or a sum of powers of linear forms. See
224 \latte contains three key executables:
732 \item Sets the file that contains the polynomial, powers of linear forms, or products of powers of …
1378 one variable $t$, can be extremely costly due to the high powers in
1594 will be decomposed into $68,920$ powers of linear forms. Run
1775 %% \textbf{latte\_v1.*.tar.gz}. The archive contains the following files:
2032 This License applies to any program or other work which contains a notice
2076 whole or in part contains or is derived from the Program or any
[all …]
/dports/math/e-antic/flint2-ae7ec89/doc/source/
H A Dfmpz.rst315 Returns `0` if the string contains a valid input and `-1` otherwise.
965 powers. No guarantee is made about `r` or `k` being the smallest
1117 An optional borrow of `1` can be subtracted from ``coeff`` before
1118 it is packed. If ``coeff`` is negative after the borrow, then a
1125 The value of ``coeff`` may also be optionally (and notionally) negated
1131 starting after ``shift`` bits, and placed into ``coeff``. An
1134 ``coeff`` may be negated by setting the ``negate`` parameter to `-1`.
1138 .. function:: void fmpz_bit_unpack_unsigned(fmpz_t coeff, const mp_limb_t * arr, flint_bitcnt_t shi…
1141 starting after ``shift`` bits, and placed into ``coeff``.
1389 `F` of prime powers which divide `n - 1`.
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/
H A Dfmpz.rst315 Returns `0` if the string contains a valid input and `-1` otherwise.
965 powers. No guarantee is made about `r` or `k` being the smallest
1117 An optional borrow of `1` can be subtracted from ``coeff`` before
1118 it is packed. If ``coeff`` is negative after the borrow, then a
1125 The value of ``coeff`` may also be optionally (and notionally) negated
1131 starting after ``shift`` bits, and placed into ``coeff``. An
1134 ``coeff`` may be negated by setting the ``negate`` parameter to `-1`.
1138 .. function:: void fmpz_bit_unpack_unsigned(fmpz_t coeff, const mp_limb_t * arr, flint_bitcnt_t shi…
1141 starting after ``shift`` bits, and placed into ``coeff``.
1389 `F` of prime powers which divide `n - 1`.
[all …]

1234567