Home
last modified time | relevance | path

Searched +refs:reorder +refs:eqns (Results 1 – 13 of 13) sorted by relevance

/dports/math/reduce/Reduce-svn5758-src/packages/solve/
H A Dliqsimp2.red61 begin scalar x,l,u,t1,e1,e2,pts,eqns,y;
71 eqns := for each q in delete(car infinities!*,
75 t1:=eqns;
83 if null (y:=assoc(q,eqns)) or cdr y then {q};
85 if null (y:=assoc(q,eqns)) or cdr y then {q};
176 w:=(reorder numr f) where kord!*={x};
H A Dsolvelnr.red1 module solvelnr; % Code for solving a general system of linear eqns.
135 % Reset kernel order and reorder equations.
144 sys := for each q in sys collect reorder q >>
H A Dppsoln.red1 module ppsoln; % Solve surd eqns, mainly by principle of powers method.
65 z := reorder ex;
H A Dsolve1.red69 % Xlst is a kernel or list of kernels. Solves eqns in elst for
216 e1 := reorder ex;
221 then return {{{quotsq(negf reorder red e1 ./1,
222 reorder lc e1 ./ 1)},
239 else if (degr(y := reorder e1,var) where kord!*={var}) = 1
242 then <<y := {{quotsq(!*f2q negf reorder red y,
243 !*f2q reorder lc y)},
656 clist := reorder ex;
685 % ***** Procedures for solving a system of eqns *****
715 exlis := for each j in exlis collect reorder j;
/dports/math/reduce/Reduce-svn5758-src/packages/crack/
H A Dcrsep.red137 sv:=itercoeff(reorder numr get(de,'sqval),splitvar)$
592 for each p in eqns do <<
648 k:=search_li2(eqns,'expt)$
660 if car p = '!*sq then reorder numr cadr p
680 eqns:=nil$
703 if s and (p=q) then eqns:=union({p},eqns)
715 eqns:=union({numr car simplifySQ((q . 1),fll,nil,nil,nil)},eqns)
729 if null q then eqns:=cons(1,eqns) else
732 eqns:=union({h},eqns)
741 else eqns:=union({ q},eqns)
[all …]
H A Dcrshort.red109 mi:=car h; % mi ={list of 2 used eqns}
110 newp:=cdr h; % newp=({list of new values} . {list of eqns to be dropped})
120 s:=(h . cdr newp); % = ({list of new eqn names} . {list of eqns to be dropped})
292 l:=reorder numr get(de,'sqval);
H A Dcrutil.red822 begin scalar pdes,eqns,q$
824 eqns:=cadddr arglist$
825 while eqns and null contradiction_ do <<
826 if zerop car eqns then q:=nil else
829 eqns:=cdr eqns
2519 alg_length_reduction (11) (to be tried out, not for very many eqns.)
6860 % eqns .. list of remaining unsolved equations
6862 % freef .. list of functiones either free or in eqns
6893 print eqns$write" "$terpri()$
6898 % modulo eqns (see end of merge_two() ).
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/algint/
H A Dfixsubf.red70 x := reorder numr x ./ reorder denr x;
142 !*nosubs := t; % We don't want left side of eqns to change.
/dports/math/reduce/Reduce-svn5758-src/packages/sstools/
H A Dsstools.red438 begin scalar w,ineq_bak,nopowersbak,eqns,m,k,cpu,p,len_es$
450 eqns:=nil$
470 if null p then eqns:=cons(1,eqns) else <<
474 else eqns:=union({p},eqns)
477 es:=cons('LIST,eqns); eqns:=nil
481 eqns:=nconc(es,w)$
489 return eqns
859 algebraic procedure power_parti(eqns)$
864 h:=for each equa in eqns collect <<
1575 algebraic procedure crack_out(eqns,assigns,freef,ineq,sol_count)$
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/occal/
H A Doczusatz.red55 % further the system of linear eqns so defined is non-singular, then
88 exlis := for each j in exlis collect reorder j;
/dports/math/fricas/fricas-1.3.7/pre-generated/target/algebra/
H A Dinterp.daase20316 ((|reorder| (*1 *1 *1 *2)
51139 ((|reorder| (*1 *1 *1 *2)
66988 ((|reorder| (*1 *1 *1 *2)
116713 (|:| |eqns|
116724 (|:| |eqns|
116763 (|:| |eqns|
116929 (|:| |eqns|
116958 (|:| |eqns|
117733 (|:| |eqns|
117762 (|:| |eqns|
[all …]
H A Doperation.daase21590 (|:| |eqns|
21610 (|:| |eqns|
21684 (|:| |eqns|
43678 (|lfunc| . 1517429) (|inHallBasis?| . 1517303) (|reorder| . 1516539)
H A Dbrowse.daase5401 (|reorder|
5403 …"\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and retu…
14542 (|reorder|
14544 …"\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and retu…
16458 (|reorder|
16460 …"\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and retu…
31402 (|:| |eqns|
31413 (|:| |eqns|
31445 (|:| |eqns|