Home
last modified time | relevance | path

Searched refs:xreduce (Results 1 – 25 of 76) sorted by relevance

1234

/dports/math/maxima/maxima-5.43.2/tests/
H A Drtestnset.mac1545 xreduce('max,[]);
1548 xreduce('min,[]);
1551 xreduce('max,[0,1]);
1554 xreduce('min,[0,1]);
1557 xreduce('max,[],x);
1560 xreduce('min,[],x);
1563 xreduce("and",[]);
1566 xreduce("or",[]);
1587 xreduce("and",[]);
1590 xreduce("or",[]);
[all …]
/dports/math/maxima/maxima-5.43.2/share/contrib/
H A Dceline.mac59 recur : xreduce("+", outermap('fff, p, q) . v),
60 e : xreduce("+", outermap(lambda([i,j], subst([n=i, k=j], f)), p, q) . v),
61 v : xreduce('append,v),
68 cnd : xreduce("%and", map(lambda([s], factor(first(s)) # 0),cnd)),
69 sol : block([scalarmatrixp : false], algsys(xreduce('append, args(mat . transpose(v))),v)),
/dports/math/reduce/Reduce-svn5758-src/packages/xideal/
H A Dxreduct.red48 return !*pf2sq repartit xreduce(xpartitop car u,
64 if f := xreduce(f,x) then {!*q2a1(!*pf2sq repartit f,v)};
86 return !*pf2sq repartit xreduce(u,x);
102 if f := xreduce(f,x) then {!*q2a1(!*pf2sq repartit f,v)};
120 symbolic procedure xreduce(f,p);
121 % f:pf, p:list of pf -> xreduce:pf
206 k := xreduce(k,g);
/dports/math/maxima/maxima-5.43.2/share/contrib/symplectic_ode/
H A Drtest_symplectic_ode.mac153 every('floatnump, xreduce('append, pp)) and every('floatnump, xreduce('append, qq));
187 block([listarith : true], is(lmax(map('abs, xreduce('append,x-z))) < 2.0e-4)));
191 block([listarith : true], is(lmax(map('abs, xreduce('append,x-z))) < 2.0e-4)));
195 block([listarith : true], is(lmax(map('abs, xreduce('append,x-z))) < 2.0e-4)));
199 block([listarith : true], is(lmax(map('abs, xreduce('append,x-z))) < 2.0e-4)));
/dports/math/reduce/Reduce-svn5758-src/packages/eds/
H A Dedsequiv.red86 if f := xreduce(f,q) then {f};
88 if f := xreduce(f,p) then {f};
96 if f := xreduce(f,g) then {f}>>;
102 if f := xreduce(f,g) then {f}>>;
H A Dsystems.red133 if f := xreduce(f,g) then {f};
221 p := xidealpf foreach f in p collect xreduce(exdfpf f,p);
222 while s and null xreduce(car s,p) do s := cdr s;
245 (f := xreduce(xreorder exdfpf f,p)) then {f};
309 f := xreduce(exdfpf f,s);
314 while p and null xreduce(car p,s) do p := cdr p;
340 while s and null xreduce(car s,p) do s := cdr s;
442 foreach f in q join if f := xreduce(f,xx) then {f});
H A Dtransfrm.red195 eds_sys s := foreach f in eds_sys s collect xreduce(xreorder f,x);
196 eds_ind s := foreach f in eds_ind s collect xreduce(xreorder f,x);
221 eds_sys s := foreach f in eds_sys s collect xreduce(xreorder f,x);
222 eds_ind s := foreach f in eds_ind s collect xreduce(xreorder f,x);
295 !*pf2a xreduce(exdfpf cdr p,x)}};
311 !*pf2a xreduce(exdfpf cdr p,x)}};
H A Dedsnorml.red113 if f := xreduce(f,p) then
158 if f := xreduce(xreorder f,p) then {f},
167 if xreduce(f := xreorder f,car i) then {f}
H A Dedsuser.red210 f := xreduce(f,foreach g in x collect
256 s := edssolve(xcoeffs xreduce(exdfpf f,s),c);
/dports/science/afni/afni-AFNI_21.3.16/src/
H A Dpowell_int.c93 static void xreduce( int n , double *x ) in xreduce() function
350 xreduce( ndim , x01 ) ; /* make sure is in the legal range */ in powell_newuoa_con()
367 if( AO_VALUE(scalx) != SC_BOX ) xreduce( ndim, xtest ) ; in powell_newuoa_con()
387 xreduce( ndim , x01 ) ; in powell_newuoa_con()
556 if( AO_VALUE(scalx) != SC_BOX ) xreduce( ndim, x01[0] ) ; in powell_newuoa_constrained()
582 if( AO_VALUE(scalx) != SC_BOX ) xreduce( ndim, xtest ) ; in powell_newuoa_constrained()
612 if( AO_VALUE(scalx) != SC_BOX ) xreduce(ndim,x01[tt]) ; in powell_newuoa_constrained()
670 if( AO_VALUE(scalx) != SC_BOX ) xreduce(ndim,x01[tt]) ; in powell_newuoa_constrained()
684 if( AO_VALUE(scalx) != SC_BOX ) xreduce(ndim,x01[tbest]) ; in powell_newuoa_constrained()
/dports/math/maxima/maxima-5.43.2/share/graphs/
H A Dgraph_polynomials.mac111 xreduce("*", map(lambda([gr], tutte_polynomial(gr, x, y)), components))*y^n_loops)
119 (x+xreduce("+", makelist(y^i, i, 1, get_edge_weight(e, g) - 1)))*
123 (y + xreduce("+", makelist(x^i, i, 1, graph_order(g)-1)))*
144 mfactor: xreduce("+", makelist(y^i, i, 1, get_edge_weight(non_bridge, g)-1))),
/dports/math/maxima/maxima-5.43.2/share/bernstein/
H A Dbernstein_utilities.mac18 bbinomial : lambda([a,b], xreduce("*", map(lambda([s,w], binomial(s,w)), a, b))),
27 xreduce("+",q))$
/dports/math/maxima/maxima-5.43.2/share/cobyla/ex/
H A Dtransport.mac38 HH(X) := -xreduce("+",map(lambda([x],x*log(x)),X));
52 [xreduce("+",C)=1,
H A Ddie.mac21 HH(X) := -xreduce("+",map(lambda([x],x*log(x)),X));
/dports/math/maxima/maxima-5.43.2/share/contrib/integration/
H A Dabs_integrate.mac91 e : subst('max = lambda([[x]], xreduce(lambda([a,b], (a + b +abs(a-b))/2),x)),e),
92 e : subst('min = lambda([[x]], xreduce(lambda([a,b], (a + b -abs(a-b))/2),x)),e),
103 p : xreduce('min, p),
146 sgn : xreduce("*", map(lambda([s], diff(s,x)),acc)),
151 if member(false, f) then false else xreduce("+", f))
204 l : xreduce('append, (gatherargs(e, 'signum))),
296 l : setify(xreduce('append, gatherargs(q,'floor))),
297 l : union(l, setify(xreduce('append, gatherargs(q,'ceiling)))),
368 else xreduce('union, map('possible_singular_pts, args(e))));
435 q : [[xreduce("%and", map(lambda([s], s # 0), listify(npoles))), ee]],
[all …]
H A Dhyperint.mac108 eq : xreduce('append, map(lambda([s], all_poly_coefs(ratnumer(s),x)),eq)),
187 eq : xreduce('append, map(lambda([s], all_poly_coefs(ratnumer(s),x)),eq)),
/dports/math/maxima/maxima-5.43.2/
H A DChangeLog-5.11.0106 * Unnumbered: xreduce(f,[a,b,c]) and xreduce(union, set(set(a),set(b)))
H A DChangeLog-5.1791 unnumbered: bug fixes for xreduce, cardinality, and equiv_classes
/dports/math/maxima/maxima-5.43.2/share/to_poly_solve/
H A Dto_poly_solve.mac61 simp_and(l) := if listp(l) or setp(l) then xreduce("%and",l, true)
74 else xreduce('union, (map('set_of_variables, args(e))), set()));
134 listify(setify(sublist(xreduce('append, gatherargs(e, 'conjugate)), lambda([s], mapatom(s))))));
279 xreduce('append, map('top_level_ops, args(e))))
286 [xreduce("*", map('first, e)), xreduce('union,map('second,e)), xreduce('union,map('third,e))])
433 %union(xreduce('append, makelist([s = new_variable('real)], s, v))))
461 xreduce('%union, sol, %union())))))
594 xreduce('%union, true_sol, %union()));
/dports/math/maxima/maxima-5.43.2/share/physics/
H A Ddimension.mac91 xreduce("*", map ('dimension, args (e))))
190 args(map(lambda([s], xreduce("*", map("^", e, first(transpose(s))))),
201 s : xreduce("*", map("^", e, map('rhs, s))),
/dports/math/reduce/Reduce-svn5758-src/psl/xr/
H A DMakefile49 file.h main.h output.h xredplus.h xreduce.h
/dports/math/maxima/maxima-5.43.2/share/cobyla/
H A Drtest_cobyla.mac212 (HH(X) := -xreduce("+",map(lambda([x],x*log(x)),X)),
283 (HH(X) := -xreduce("+",map(lambda([x],x*log(x)),X)),
295 [xreduce("+",C)=1,
/dports/math/maxima/maxima-5.43.2/doc/info/
H A DLists.texi1076 See also @mref{rreduce}, @mref{xreduce}, and @mref{tree_reduce}.
1984 @anchor{xreduce}
1985 @deffn {Function} xreduce @
1986 @fname{xreduce} (@var{F}, @var{s}) @
1987 @fname{xreduce} (@var{F}, @var{s}, @var{s_0})
2011 @code{xreduce} applied to a function known to be n-ary.
2017 @c xreduce (F, [a, b, c, d, e]);
2029 (%i3) xreduce (F, [a, b, c, d, e]);
2034 @code{xreduce} applied to a function not known to be n-ary.
2039 @c xreduce (G, [a, b, c, d, e]);
[all …]
/dports/science/berkeleygw/BGW-2.0.0/Sigma/
H A Dsigma_main.f901804 if (.not.sig%use_xdat) call xreduce(ax, size(ax))
1815 call xreduce(asx, size(asx))
1816 call xreduce(ach, size(ach))
1818 call xreduce(ach_n1, size(ach_n1))
1821 call xreduce(achcor_n1, size(achcor_n1))
2387 subroutine xreduce(ar, sz) subroutine
2391 PUSH_SUB(sigma.xreduce)
2393 POP_SUB(sigma.xreduce)
2395 end subroutine xreduce
/dports/math/maxima/maxima-5.43.2/share/linearalgebra/
H A Dlinearalgebra.mac228 …if p = 1 then lmax(xreduce("+", map(lambda([s], map('cabs, s)), if args(m) = [] then [[]] else arg…
229 else if p = 'inf then lmax(map(lambda([s], xreduce("+", map('cabs, s))), args(m)))
230 else if p = 'frobenius then sqrt(xreduce("+", lreduce('append, args(cabs(m)^2))))

1234