/dports/math/eclib/eclib-20210318/libsrc/eclib/ |
H A D | symb.h | 40 long ceered() const {return N->reduce(c);} in ceered() 41 long deered() const {return N->reduce(d);} in deered() 50 {long n=N->modulus, cr=N->reduce(c); cr=cr*cr; in orbitlength() 56 rational a,b; 58 modsym() {a=rational(0); b=rational(0);} in modsym() 59 modsym(const rational& ra, const rational& rb) {a=ra; b=rb;} in modsym() 61 rational alpha() const {return a;} in alpha() 62 rational beta() const {return b;} in beta() 71 map<pair<long,long>,long> hashtable;
|
/dports/math/eclib/eclib-20210318/libsrc/ |
H A D | symb.cc | 44 long cc=N->reduce(xmodmul(c,u,n)); in normalize() 45 long dd=N->reduce(xmodmul(d,u,n))%(n/cc); in normalize() 66 a=rational(-x , d/h); in modsym() 67 b=rational( y , c/h); in modsym() 125 map<pair<long,long>,long>::const_iterator in index() 176 return reduce(xmodmul(c,kd,modulus)); // (c:d) = (c*kd:1) in index2() 225 return modsym(rational(-invmod(c1,d1),d1),rational(-invmod(c2,d2),d2)); in jumpsymb()
|
/dports/math/fricas/fricas-1.3.7/src/algebra/ |
H A D | aggcat2.spad | 5 ++ different. An example of this might be creating a list of rational 16 map : (S -> R, A) -> B 37 ++ \spad{[reduce(f, [a1], r), reduce(f, [a1, a2], r), ...]}. 55 map(f, l) == 80 map(f, v) == 92 map(f, v) == 112 map(f, v) == 128 ++ different. An example of this is to create a set of rational 138 map : (S -> R, A) -> B 159 ++ \spad {[reduce(f, [a1], r), reduce(f, [a1, a2], r), ...]}. [all …]
|
H A D | solverad.spad | 13 reduce : UP R1 -> Record(pol : UP R1, deg : PI) 14 ++ reduce(p) returns [q, d] such that p(x) = q(x^d) 29 reduce(u : UP R1) == 91 ++ univariate rational function. 108 ++ list of rational functions. 128 ++ symbols for common subexpressions in order to reduce the 134 ++ symbols for common subexpressions in order to reduce the 166 quadratic u == quadratic(map(coerce, u)$UPF2)$SOLVEFOR 167 cubic u == cubic(map(coerce, u)$UPF2)$SOLVEFOR 168 quartic u == quartic(map(coerce, u)$UPF2)$SOLVEFOR [all …]
|
H A D | divisor.spad | 206 map(f, i) == 566 ++ Category for finite rational divisors on a curve 572 ++ P's are finite rational points on the curve. 634 ++ Finite rational divisors on an hyperelliptic curve 640 ++ P's are finite rational points on the curve. 811 ++ Finite rational divisors on a curve 817 ++ P's are finite rational points on the curve. 848 reduce d == reduce(d)$Rep 913 reduce map((s : RF) : RF +-> (retract(s)@UP rem b)/e, 973 map(f, d) == [all …]
|
H A D | numeigen.spad | 63 ++ to reduce the characteristic polynomial into irreducible factors. 102 polf := map(numeric, 120 -- compute the eigenvectors, rational case 133 alg : MM := reduce(monomial(1, 1), ppol) 136 for j in 1..dimA repeat B(i, j) := reduce(A(i, j) ::SUK, ppol) 152 upi : SUP(I) := map(numer, 161 upgi := map((c1 : GRN) : GI +-> complex(numer(real c1), numer(imag c1)), 238 ++ rational numbers depending on the type of eps (float or rational). 279 ++ complex rational numbers 313 ++ complex rational numbers depending on the type of eps (float or rational). [all …]
|
H A D | intaf.spad | 45 ++ r is rational function of x, c and t are rational functions of z. 62 ++ r is rational function of x, c and t are rational functions of z. 85 ++ r is rational function of x, c and t are rational functions of z. 446 -- xx = h(dumk2::F), x = h(ry), c == h' and r is rational in x, 447 -- where h is a rational function. Will not fail if 448 -- there exist r rational in x such that p(x, y/r) is linear 538 -- returns the integral as an integral of a rational function in u 612 reduce univariate(g, x, k, p))$RDALG 647 neq := neq + monomial(reduce univariate(f, kx, y, p), i) 812 red : UPUP -> curve:= reduce$curve [all …]
|
H A D | algfact.spad | 8 ++ References: B. M. Trager, Algebraic factoring and rational 27 ++ f is a factorisation map for elements of UP; 39 monomial(reduce monomial(k::F, 1)$UP , 0) 43 monomial(reduce monomial(k::F, 1)$UP, 0) 79 newp := map(x +-> x::UP, p)$UPCF2(F, UP, UP, NUP) 82 change q == map(coerce, q)$UPCF2(F, UP, AlExt, AlPol) 85 swap(map(lift, q)$UPCF2(AlExt, AlPol, 94 ++ are rational functions with integer coefficients. 119 map(x +-> likuniv(x, dummy, d), 174 liftpoly p == map(x +-> x::AN, p)$UPCF2(Q, UPQ, AN, UP) [all …]
|
H A D | pfo.spad | 16 dd := d := reduce d 19 dd := reduce(d + dd) 52 algOrder(d, modulus, reduce) == 53 redmod := map(reduce, modulus)$MultipleMap(F1, UP, UPUP, F2, UP2, UPUP2) 55 order(map(reduce, 59 rootOrder(d, radicand, n, reduce) == 60 redrad := map(reduce, 63 order(map(reduce, 120 ++ Finds the order of a divisor on a rational curve 196 ++ Reduction from a function space to the rational numbers [all …]
|
H A D | gaussian.spad | 52 rational? : % -> Boolean 53 ++ rational?(x) tests if x is a rational number. 55 ++ rational(x) returns x as a rational number. 91 map(retract@(%->R), pp * map(conjugate, pp)) 151 reduce(pol : SUP R) == 199 vertConcat(map(real, m), map(imag, m)) 244 rational? x == zero? imag x 246 rational x == 248 error "Not a rational number" 539 map(makeComplex, [all …]
|
H A D | numsolve.spad | 55 p1 := map(real, q)$PolynomialFunctions2(Complex I, I) 56 p2 := map(imag, q)$PolynomialFunctions2(Complex I, I) 146 rpp := map(numeric, pol)$PolynomialFunctions2(K, F) 216 rpp := map(K_to_CI, pol)$PolynomialFunctions2(K, CI) 329 lnorm : Integer := reduce("+", laval) 374 ++ system lp of rational functions over the rational numbers 386 ++ univariate rational function p with rational coefficients 398 ++ solutions of the list lp of rational functions with rational 462 ++ systems of equations of rational functions with complex rational 503 ++ rational function p with complex rational coefficients [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/dd/ |
H A D | dd_pdd.h | 114 typedef map<rational, const_info, rational::hash_proc, rational::eq_proc> mpq_table; 144 vector<rational> m_values; 165 rational m_freeze_value; 184 PDD imk_val(rational const& r); 236 rational m_pc, m_qc; 238 …rs(pdd const& a, pdd const& b, unsigned_vector& p, unsigned_vector& q, rational& pc, rational& qc); 265 pdd mk_val(rational const& r); 271 pdd add(rational const& a, pdd const& b); 279 pdd reduce(pdd const& a, pdd const& b); 352 pdd reduce(pdd const& other) const { return m.reduce(*this, other); } in reduce() function [all …]
|
/dports/lang/mit-scheme/mit-scheme-9.2/src/6001/ |
H A D | 6001.pkg | 44 flo:->rational 54 reduce-comparator 55 reduce-max/min) 97 rational? 124 picture-map
|
/dports/math/z3/z3-z3-4.8.13/src/math/dd/ |
H A D | dd_pdd.h | 114 typedef map<rational, const_info, rational::hash_proc, rational::eq_proc> mpq_table; 144 vector<rational> m_values; 165 rational m_freeze_value; 166 rational m_mod2N; 186 PDD imk_val(rational const& r); 242 rational m_pc, m_qc; 244 …rs(pdd const& a, pdd const& b, unsigned_vector& p, unsigned_vector& q, rational& pc, rational& qc); 271 pdd mk_val(rational const& r); 285 pdd reduce(pdd const& a, pdd const& b); 362 pdd reduce(pdd const& other) const { return m.reduce(*this, other); } in reduce() function [all …]
|
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/hypertex/pages/ |
H A D | ODPOL.ht | 33 integers, or the field of rational numbers. 35 field of rational functions in a single indeterminate. 54 differential indeterminates with rational numbers as coefficients. 66 element of type \spadtype{Symbol} to a map from the natural numbers to the 76 The fifth derivative of \spad{w} can be obtained by applying the map 116 creates a map to facilitate referencing the derivatives of \spad{f}, 117 similar to the map \spad{w}. 238 Using these three operations, it is possible to reduce \spad{f} modulo the 240 The general scheme is to first reduce the order, then reduce the degree in
|
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/spadhelp/ |
H A D | OrderlyDifferentialPolynomial.help | 12 the ring of integers, or the field of rational numbers. However, 14 rational functions in a single indeterminate. 27 arbitrary number of differential indeterminates with rational numbers 37 an element of type Symbol to a map from the natural numbers to the 48 The fifth derivative of w can be obtained by applying the map w to the 103 The operation makeVariable creates a map to facilitate referencing the 104 derivatives of f, similar to the map w. 250 Using these three operations, it is possible to reduce f modulo the 252 reduce the order, then reduce the degree in the leader. First, eliminate
|
/dports/math/fricas/fricas-1.3.7/src/input/ |
H A D | reclos.input | 7 -- of degree 16 of the rational numbers. 46 removeDuplicates map(mainDefiningPolynomial,l) 47 map(mainCharacterization,l) 48 [reduce(+,l),reduce(*,l)-2]
|
/dports/math/z3/z3-z3-4.8.13/src/muz/spacer/ |
H A D | spacer_qe_project.cpp | 998 map.get (fml, new_fml, pr); in mod2div() 1027 mod2div (t1, map); in mod2div() 1028 mod2div (t2, map); in mod2div() 1060 mod2div (ch, map); in mod2div() 1159 map.get (m_var->x (), x_term, pr); in substitute() 1208 expr_map map (m); in operator ()() local 1209 operator()(mdl, vars, fml, map); in operator ()() 1242 map.reset (); in operator ()() 1862 bool reduce (expr_ref& e) { in reduce() function in spacer_qe::array_select_reducer 1993 if (reduce (fml)) { in operator ()() [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/spacer/ |
H A D | spacer_qe_project.cpp | 998 map.get (fml, new_fml, pr); in mod2div() 1027 mod2div (t1, map); in mod2div() 1028 mod2div (t2, map); in mod2div() 1060 mod2div (ch, map); in mod2div() 1159 map.get (m_var->x (), x_term, pr); in substitute() 1208 expr_map map (m); in operator ()() local 1209 operator()(mdl, vars, fml, map); in operator ()() 1242 map.reset (); in operator ()() 1862 bool reduce (expr_ref& e) { in reduce() function in spacer_qe::array_select_reducer 1993 if (reduce (fml)) { in operator ()() [all …]
|
/dports/math/polymake/polymake-4.5/apps/fulton/rules/ |
H A D | toric_divisor_classes.rules | 47 # the Mori cone in the space of the rational divisor class group 50 # Take the matrix 'proj' of the projection to the rational divisor class 60 $this->NEF_CONE = List::Util::reduce { 62 } map {
|
/dports/math/fricas/fricas-1.3.7/src/doc/htex/ |
H A D | ODPOL.htex | 50 integers, or the field of rational numbers. 52 field of rational functions in a single indeterminate. 71 differential indeterminates with rational numbers as coefficients. 83 element of type \spadtype{Symbol} to a map from the natural numbers to the 93 The fifth derivative of \spad{w} can be obtained by applying the map 133 creates a map to facilitate referencing the derivatives of \spad{f}, 134 similar to the map \spad{w}. 255 Using these three operations, it is possible to reduce \spad{f} modulo the 257 The general scheme is to first reduce the order, then reduce the degree in
|
/dports/lang/abcl/abcl-src-1.8.0/src/org/armedbear/lisp/ |
H A D | known-functions.lisp | 152 map 173 reduce 255 (defknown (rational rationalize) (number) rational) 369 map
|
/dports/math/reduce/Reduce-svn5758-src/packages/mathml/ |
H A D | mtables.red | 45 % reduce function to be executed as well as the argument 46 % the reduce function should take. 69 % reduce function to be executed as well as the argument 70 % the reduce function should take. 166 % constructor tags, the reduce function to be executed and the 184 % in the intermediate representation and the reduce functions to be 291 (rational . (rationalml nil naryom)) 416 (rational . (nums1)) 446 (rational_type . (typmml rational nil)) 468 (rational . (numir)) [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/vas/ |
H A D | vas.red | 194 if first cl < 0 then cl:=map(~x => -x,cl); 199 % reduce does not support ops with infinity; 243 if first cl < 0 then cl:=map(~x => -x,cl); 249 % reduce does not support ops with infinity; 507 then %---copy the list a and change signs; reduce cannot negate a list 1032 temp:=map(mainvar, temp); 1033 temp:=map(~x => if (x eq 0) then 1 else 0 ,temp); 1149 flist:=map(~xx=>first(xx),sqfdec( p )); 1228 temp:=map(mainvar, temp); 1229 temp:=map(~x => if (x eq 0) then 1 else 0 ,temp); [all …]
|
/dports/lang/racket/racket-8.3/share/pkgs/r6rs-lib/rnrs/ |
H A D | base-6.rkt | 57 number? complex? real? rational? integer? 58 real-valued? rational-valued? integer-valued? 127 [r5rs:map map] 154 vector-map 191 (define (rational-valued? o) 192 (or (rational? o) 195 (rational? (real-part o))))) 225 [(rational? y) 406 (define vector-map 416 (map (lambda (s) [all …]
|