Home
last modified time | relevance | path

Searched +refs:p +refs:descending +refs:powers (Results 1 – 25 of 523) sorted by relevance

12345678910>>...21

/dports/math/octave-forge-control/control-3.3.1/inst/@tf/
H A Dtf.m35 ## containing the coefficients of the polynomial in descending powers of
41 ## containing the coefficients of the polynomial in descending powers of
71 ## Logical. True for negative powers of the transfer function variable.
83 ## Cell vector of length p containing strings.
238 [p, m] = __tf_dim__ (num, den); # determine number of outputs and inputs
245 ltisys = lti (p, m, tsam); # parent class for general lti data
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/spadhelp/
H A DMultivariatePolynomial.help18 This polynomial appears with terms in descending powers of the variable x.
35 p : MPOLY([x,y],POLY INT)
42 p :: POLY INT
43 p
49 p
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/hypertex/pages/
H A DMPOLY.ht36 terms in descending powers of the variable \spad{x}.
49 \spadpaste{p : MPOLY([x,y],POLY INT) \bound{pdec}}
53 \spadpaste{p := (a^2*x - b*y^2 + 1)^2 \free{pdec}\bound{p}}
60 \spadpaste{p :: POLY INT \free{p}\bound{prev}}
/dports/math/octave-forge-signal/signal-1.4.1/inst/
H A Diirlp2mb.m176 ## For Pass = 'stop', use powers of (-PP/P)
191 ## Compute and store powers of P as a matrix of coefficients because we will
192 ## need to use them in descending power order
193 global Ppower; # to hold coefficients of powers of P, access inside ppower()
196 ## initialize to "Not Available" with n-1 rows for powers 1 to (n-1) and
294 function PP = revco(p) # reverse components of vector
296 l = length(p);
298 PP(l + 1 - i) = p(i);
307 p = 1; variable
309 p = []; variable
[all …]
/dports/math/gap/gap-4.11.0/pkg/HeLP-3.5/lib/
H A DHeLP.gd43 #! and, for the primes $p$ for which the group is not $p$-solvable, all $p$-Brauer tables which ar…
50 #! and all its powers will also be stored in the list entry <K>HeLP_sol[k]</K>.<P/>
73 #! tables for primes $p$ for which the group is not $p$-solvable and which are available in GAP wi…
79 #! Let $p$ and $q$ be distinct primes such that there are elements of order $p$ and $q$ in $G$ but…
137 #! The function uses the partial augmentations for the powers <M>u^d</M> with <M>d</M>
139 #! Here, the <M>d</M>'s have to be in a descending order (i.e. the orders of the $u^d$'s
183 #! Here, the <M>d</M>'s have to be in a descending order (i.e. the orders of the $u^d$'s
205 #! Here, the <M>d</M>'s have to be in a descending order (i.e. the orders of the $u^d$'s
307 #! involve $p$-singular elements.
416 #! if the partial augmentations if units of order $n/p$ have been already computed for all primes $…
[all …]
/dports/math/fricas/fricas-1.3.7/src/doc/htex/
H A DMPOLY.htex63 terms in descending powers of the variable \spad{x}.
76 \spadcommand{p : MPOLY([x,y],POLY INT) \bound{pdec}}
80 \spadcommand{p := (a^2*x - b*y^2 + 1)^2 \free{pdec}\bound{p}}
87 \spadcommand{p :: POLY INT \free{p}\bound{prev}}
/dports/math/gap/gap-4.11.0/lib/
H A Dctblpope.gi1482 # contains the information for descending at min_class
1657 # $j$ is in `powers[i]' iff there exists a prime $p$ with powermap
1688 # \item as new powers \[ `powers[C]'\:=
1699 # `powers[C]' we have
1749 # `powers' and `rest'.
1983 # compute roots and powers:
1985 powers:= [];
1988 powers[i]:= [];
2051 powers:= List( CompositionMaps( CompositionMaps( fusion, powers ),
2091 for j in powers[i] do
[all …]
H A Dpcgsperm.gi153 desc, # flag: true if a fastest-descending series is wanted
181 # If the series need not be fastest-descending, prepare to add a new
192 p := elab;
268 # For a fastest-descending series, replace the old group. Otherwise, add
373 p[ 1 ] ^ ( LogInt( deg, p[ 1 ] ) ) ) );
450 ord, p,ap,s;
452 # As series need not be fastest-descending, prepare to add a new
490 w := t ^ p;
650 # Precompute the leading coeffs and the powers of pag up to the
865 # Find the relations of the p-th powers. Use the vector space structure
[all …]
H A Dgrp.gd19 ## Unless explicitly declared otherwise, all subgroup series are descending.
418 ## <Index Key="p-group"><M>p</M>-group</Index>
459 ## <M><A>G</A>^{p}</M> if the prime <M>p</M> is odd, or if
461 ## if <M>p = 2</M>. The subgroup <M><A>G</A>^{p}</M> is called the first
516 ## The <M>p</M>-class of a <M>p</M>-group <A>G</A>
850 ## group <A>G</A>. These are given as a list of prime-powers or zeroes and
985 ## subgroups of <A>G</A> contained in each other, sorted by descending size.
2219 ## descending from <A>G</A> to the supersolvable residuum,
4470 ## the <A>n</A>-th powers of the elements in the <M>i</M>-th class
4487 ## class containimg the <A>n</A>-th powers of elements in class <M>i</M>
[all …]
H A Dgrplatt.gi389 Info(InfoLattice,1,"powers computed");
737 if p=2 then
1045 p:=List(p,x->Position(nts,x));
1046 p:=Filtered(p,x->x<>fail and x in nim);
1546 # relevant prime powers
1904 p^(Length(mpcgs)*LogInt(Index(j,M),p))>100)
2473 p:=basl;
2633 if p<>fail and not mark[p] then
3295 # determine minimal degrees by descending through lattice
3420 # descending order: First low layer, then all classes. Does not guarantee
[all …]
H A Dgrp.gi61 # if <G> is finite, test if the <p>-th powers of the generators
218 if ord <> p^PValuation( ord, p ) then
305 if (RankPGroup(G)=Log(Order(Omega(G,p)),p)) then
1239 p->p<>One(G)));
1345 List(GeneratorsOfGroup(L[QuoInt(n+p-1,p)]),x->x^p));
1638 ## The algorithm constructs a descending series of normal subgroups with
1721 p:= p+1;
2764 "generic method: build descending series with abelian or p'-factors",
3033 # Start with the derived subgroup of <G> and add <p>-powers.
3818 and size = (p-1) * ((p-1)^2-1) / Gcd(2,(p-1)-1)
[all …]
H A Dgrpprmcs.gi289 # appropriate powers of g will divide the cyclic factor group into
1197 p := PreImagesRepresentative(homlist[lenhomlist+1-i],p);
1199 return p;
1300 p, # position
1310 if p=fail then
1354 ## O_p(G), the p-core of G, is the maximal normal p-subgroup
1409 ppart := p^primes[PositionProperty( primes, x->x[1]=p )][2];
1437 # p-core. The normal closure of this p-core is a solvable normal
2571 # ser is descending subnormal series, nt a descending series of normal subs
2749 p:=Index(U,cs);
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/scope/
H A Dcodhrn.red22 % tation. From this tree a list of terms is extracted with the powers ;
23 % in descending order.This list is rewritten into a Horner scheme. ;
170 p := reval p;
195 p := reval p;
208 p := schema(p, var, kpow(car p, var))
246 % the powers are equal the coefficients are added. ;
360 % form' in decsending order w.r.t. the powers of these ;
525 p:=p$
545 p:=p$
576 if numberp p then p
[all …]
H A Dcodopt.red141 % descending order. A scope_row-Zstrt contains (negative) column-indices, ;
341 % found in Van Hulzen '83, p.295 : ;
546 begin scalar zz,zzhr,x1,y,p,ljsi,cljsi;
574 then p:=cljsi.p;
578 then p:=cljsi.p;
595 return p
709 % ZZc, a Zstrt in descending order. ;
851 % The set LPsi defines Psi in descending order, i.e. the ordering ;
855 % called ZZcse.ZZ is in descending order. During the WHILE-loop exe-;
939 % The Zstrt of such a column contains IVal's being powers of Var,;
/dports/math/reduce/Reduce-svn5758-src/packages/factor/
H A Dezgcdf.red77 % (e.g., in invlap(c/(p^3/8-9p^2/4+27/2*p-27)^2,p,t)), and
110 p := simp!* car p;
144 %powers of leading kernel;
146 else if null red p then lpow p . poly!-abs lc p
156 p:=red p >>;
232 % about the powers of variables in it;
297 (reorder p . total!-degree!-in!-powers(p,nil)))
321 % degree anywhere in L first, and the rest in descending order;
870 symbolic procedure total!-degree!-in!-powers(form,powlst);
879 return total!-degree!-in!-powers(red form,
[all …]
/dports/math/giacxcas/giac-1.6.0/doc/en/
H A Dcas.tex110 by descending power ({\tt [1,2,3]} for $x^2+2x+3$)
117 term of the couple is a vector of indices, the powers of the variables
158 {\tt ( jordan testjordan ; cas p j ) | sto }\\
159 or {\tt cas 'sto(jordan(testjordan),[p,j])'}
161 passage matrix in {\tt p} and the Jordan normal form in {\tt j}.
162 If you want to check that $p j p^{-1}$ is the original matrix,
164 \verb?cas p j 'inv(p)' | \* | normal ?\\
165 or {\tt cas 'normal(p*j*inv(p))'}
/dports/science/py-scipy/scipy-1.7.1/doc/source/tutorial/
H A Dsignal.rst447 …z_{m}\left[n\right]=\sum_{p=0}^{K-m-1}\left(b_{m+p+1}x\left[n-p\right]-a_{m+p+1}y\left[n-p\right]\…
627 `N`-order denominator, as positive, descending powers of the transfer function
651 This "positive powers" form is found more commonly in controls
654 to the "negative powers" discrete-time form preferred in DSP:
668 powers" form before finding the poles and zeros.
676 The ``zpk`` format is a 3-tuple ``(z, p, k)``, where `z` is an `M`-length
678 :math:`z = [z_0, z_1, ..., z_{M-1}]`, `p` is an `N`-length array of the
679 complex poles of the transfer function :math:`p = [p_0, p_1, ..., p_{N-1}]`,
889 >>> z, p, k = signal.tf2zpk(b, a)
892 >>> plt.plot(np.real(p), np.imag(p), 'or')
/dports/math/octave/octave-6.4.0/doc/interpreter/
H A Dpoly.texi25 in descending order). For example, a vector @var{c} of length
146 $$ p(x) = x^2 - 5. $$
151 p(x) = x^2 - 5.
272 p = [2 3 1 1 2];
273 [m, n] = mpoles (p)
501 p = [2; 2; 1];
516 p = [2; 1; 2];
1015 denominator coefficients in descending powers of s. Both are
1048 p = [ 0, 1, 0;
1051 pp = mkpp (x, p);
[all …]
/dports/math/pari/pari-2.13.3/src/test/32/
H A Dcompat321 compute the ray class group modulo cycmod-th powers.
335 compute the ray class group modulo cycmod-th powers.
349 compute the ray class group modulo cycmod-th powers.
1735 the permutation instead of the permuted vector, 4: use descending instead of
2290 the permutation instead of the permuted vector, 4: use descending instead of
3612 sigma(x,{k=1}): sum of the k-th powers of the divisors of x. k is optional and
3810 the permutation instead of the permuted vector, 4: use descending instead of
4061 the permutation instead of the permuted vector, 4: use descending instead of
4076 the permutation instead of the permuted vector, 4: use descending instead of
4162 present, only compute the group modulo cycmod-th powers. flag is optional, and
[all …]
/dports/math/gap/gap-4.11.0/pkg/fr-2.4.6/gap/
H A Dhelpers.gd219 ## <Mark><C>point:=p</C></Mark> <Item> to compute the
220 ## growth of the orbit of <C>p</C> under <A>g</A>, rather than the growth
339 ## This function assumes <A>t</A> is a descending tower of domains, such
512 ## <Func Name="SurfaceBraidFpGroup" Arg="n,g,p"/>
513 ## <Func Name="PureSurfaceBraidFpGroup" Arg="n,g,p"/>
518 ## with <A>p</A> punctures. In particular,
569 ## <Func Name="Draw" Arg="p" Label="poset"/>
570 ## <Func Name="HeightOfPoset" Arg="p"/>
612 inc[i+1] := Filtered(List(Cartesian(inc[i],[G.1,G.2,G.3]),p->p[1]*p[2]),function(g)
648 ## This command computes the powers of the augmentation ideal of <A>a</A>,
/dports/math/reduce/Reduce-svn5758-src/doc/manual/
H A Dgroebner.tex109 If terms (products of powers of variables) are compared with \emph{lex},
479 glexconvert(g,{w,p,z,t,s,b},maxdeg=5,newvars={p});
482 6000*p - 2360*p + 3051
619 of variable powers occurring as a factor, e.g. $ x**2*y$ in $x**3*y -
712 ~~~~~~~~~~$p := p - lt(p)/lt(b) * b$ (the leading term vanishes) \\
1246 {{x=(sqrt( - a*p + a*q + s )*q - p*s)/(p - q ),
1248 y= - (sqrt( - a*p + a*q + s )*p - q*s)/(p - q )},
1250 {x= - (sqrt( - a*p + a*q + s )*q + p*s)/(p - q ),
1252 y=(sqrt( - a*p + a*q + s )*p + q*s)/(p - q )}}
1346 i:f = \{ p \;| \; p * f \;\mbox{ member of }\; i\}\;.
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/groebner/
H A Dgroebner.tex131 If terms (products of powers of variables) are compared with $lex$,
510 glexconvert(g,{w,p,z,t,s,b},maxdeg=5,newvars={p});
513 6000*p - 2360*p + 3051
646 of variable powers occurring as a factor, e.g. $ x**2*y$ in $x**3*y -
739 $p := p - lt(p)/lt(b) * b$ (the leading term vanishes)\\
745 $p := p - s/lt(b) * b$ (the term $s$ vanishes) \\
1281 {{x=(sqrt( - a*p + a*q + s )*q - p*s)/(p - q ),
1283 y= - (sqrt( - a*p + a*q + s )*p - q*s)/(p - q )},
1285 {x= - (sqrt( - a*p + a*q + s )*q + p*s)/(p - q ),
1287 y=(sqrt( - a*p + a*q + s )*p + q*s)/(p - q )}}
[all …]
/dports/games/pcgen/pcgen/data/pathfinder/paizo/roleplaying_game/ultimate_combat/
H A Duc_abilities_class.lst174 …nja uses the light steps class feature, she can walk on air, rising or descending as she desires. …
251 …powers' prerequisites can select and use the following new rage powers. Totem rage powers grant po…
271 …powers and be 16th level before selecting this rage power. …
304 …powers complement the armored hulk archetype - boasting taunt**, greater guarded life*, guarded li…
311 …powers complement the scarred rager archetype - auspicious mark*, body bludgeon*, come and get me*…
319 …powers complement the sea reaver archetype - bestial leaper, bestial swimmer, come and get me**, h…
329 …powers complement the titan mauler archetype - body bludgeon*, greater ground breaker*, ground bre…
337 …powers complement the true primitive archetype - animal fury, eater of magic*, ghost rager*, low-l…
363 …powers complement the wild rager archetype - animal fury, bloody blow*, body bludgeon*, brawler**,…
1245 …powers at 20th level). This ability replaces the ranger's second, third, fourth, and fifth favored…
[all …]
/dports/games/pcgen/pcgen/data/pathfinder/super_genius_games/the_talented_rogue/
H A Dttr_abilities_class.lst29 …powers is activated as a swift action. A rogue can gain additional powers that consume points from…
66 … SOURCEPAGE:p.8
67 … SOURCEPAGE:p.9
84 … SOURCEPAGE:p.10
87 … SOURCEPAGE:p.10
90 … SOURCEPAGE:p.10
143 … SOURCEPAGE:p.16
148 … SOURCEPAGE:p.17
154 …descending great distances with a single check. The DC is 10 + 5 for every additional 10-foot incr…
162 … SOURCEPAGE:p.18
[all …]
/dports/math/reduce/Reduce-svn5758-src/csl/cslbase/
H A Dhelpdata875 operator p;
876 antisymmetric p;
3009 p
3090 ?- p
5810 let m + n = p;
6543 let p*r = s;
6544 match p*q = ss;
7342 NUM_MIN tries to find the next local minimum along the descending path
8941 resultant(p(x),q(x),x) = (-1)^{deg p(x)*deg q(x)} * resultant(q(x),p(x),x),
8942 resultant(a,p(x),x) = a^{deg p(x)},
[all …]

12345678910>>...21