You can subscribe to this list here.
2001 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(20) |
Dec
(17) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2002 |
Jan
(39) |
Feb
(21) |
Mar
(33) |
Apr
(135) |
May
(53) |
Jun
(88) |
Jul
(47) |
Aug
(59) |
Sep
(207) |
Oct
(40) |
Nov
(7) |
Dec
(26) |
2003 |
Jan
(49) |
Feb
(39) |
Mar
(117) |
Apr
(50) |
May
(62) |
Jun
(6) |
Jul
(19) |
Aug
(24) |
Sep
(11) |
Oct
(11) |
Nov
(49) |
Dec
(9) |
2004 |
Jan
(29) |
Feb
(123) |
Mar
(32) |
Apr
(53) |
May
(52) |
Jun
(19) |
Jul
(33) |
Aug
(10) |
Sep
(76) |
Oct
(86) |
Nov
(171) |
Dec
(163) |
2005 |
Jan
(147) |
Feb
(121) |
Mar
(120) |
Apr
(126) |
May
(120) |
Jun
(213) |
Jul
(76) |
Aug
(79) |
Sep
(140) |
Oct
(83) |
Nov
(156) |
Dec
(202) |
2006 |
Jan
(181) |
Feb
(171) |
Mar
(157) |
Apr
(98) |
May
(96) |
Jun
(97) |
Jul
(193) |
Aug
(76) |
Sep
(130) |
Oct
(63) |
Nov
(196) |
Dec
(253) |
2007 |
Jan
(256) |
Feb
(293) |
Mar
(276) |
Apr
(258) |
May
(181) |
Jun
(91) |
Jul
(108) |
Aug
(69) |
Sep
(107) |
Oct
(179) |
Nov
(137) |
Dec
(121) |
2008 |
Jan
(124) |
Feb
(129) |
Mar
(192) |
Apr
(201) |
May
(90) |
Jun
(86) |
Jul
(115) |
Aug
(142) |
Sep
(49) |
Oct
(91) |
Nov
(95) |
Dec
(218) |
2009 |
Jan
(230) |
Feb
(149) |
Mar
(118) |
Apr
(72) |
May
(77) |
Jun
(68) |
Jul
(102) |
Aug
(72) |
Sep
(89) |
Oct
(76) |
Nov
(125) |
Dec
(86) |
2010 |
Jan
(75) |
Feb
(90) |
Mar
(89) |
Apr
(121) |
May
(111) |
Jun
(66) |
Jul
(75) |
Aug
(66) |
Sep
(66) |
Oct
(166) |
Nov
(121) |
Dec
(73) |
2011 |
Jan
(74) |
Feb
|
Mar
|
Apr
(14) |
May
(22) |
Jun
(31) |
Jul
(53) |
Aug
(37) |
Sep
(23) |
Oct
(25) |
Nov
(31) |
Dec
(28) |
2012 |
Jan
(18) |
Feb
(11) |
Mar
(32) |
Apr
(17) |
May
(48) |
Jun
(37) |
Jul
(23) |
Aug
(54) |
Sep
(15) |
Oct
(11) |
Nov
(19) |
Dec
(22) |
2013 |
Jan
(11) |
Feb
(32) |
Mar
(24) |
Apr
(37) |
May
(31) |
Jun
(14) |
Jul
(26) |
Aug
(33) |
Sep
(40) |
Oct
(21) |
Nov
(36) |
Dec
(84) |
2014 |
Jan
(23) |
Feb
(20) |
Mar
(27) |
Apr
(24) |
May
(31) |
Jun
(27) |
Jul
(34) |
Aug
(26) |
Sep
(21) |
Oct
(45) |
Nov
(23) |
Dec
(73) |
2015 |
Jan
(33) |
Feb
(8) |
Mar
(24) |
Apr
(45) |
May
(27) |
Jun
(19) |
Jul
(21) |
Aug
(51) |
Sep
(43) |
Oct
(29) |
Nov
(61) |
Dec
(86) |
2016 |
Jan
(99) |
Feb
(52) |
Mar
(80) |
Apr
(61) |
May
(24) |
Jun
(23) |
Jul
(36) |
Aug
(30) |
Sep
(41) |
Oct
(43) |
Nov
(27) |
Dec
(46) |
2017 |
Jan
(57) |
Feb
(34) |
Mar
(40) |
Apr
(31) |
May
(78) |
Jun
(49) |
Jul
(72) |
Aug
(33) |
Sep
(26) |
Oct
(82) |
Nov
(69) |
Dec
(29) |
2018 |
Jan
(43) |
Feb
(9) |
Mar
|
Apr
(40) |
May
(34) |
Jun
(49) |
Jul
(45) |
Aug
(8) |
Sep
(51) |
Oct
(75) |
Nov
(103) |
Dec
(80) |
2019 |
Jan
(153) |
Feb
(78) |
Mar
(47) |
Apr
(48) |
May
(63) |
Jun
(54) |
Jul
(10) |
Aug
(7) |
Sep
(17) |
Oct
(24) |
Nov
(29) |
Dec
(17) |
2020 |
Jan
(22) |
Feb
(74) |
Mar
(47) |
Apr
(48) |
May
(12) |
Jun
(44) |
Jul
(13) |
Aug
(18) |
Sep
(26) |
Oct
(36) |
Nov
(25) |
Dec
(23) |
2021 |
Jan
(28) |
Feb
(25) |
Mar
(58) |
Apr
(76) |
May
(72) |
Jun
(70) |
Jul
(25) |
Aug
(67) |
Sep
(17) |
Oct
(24) |
Nov
(30) |
Dec
(30) |
2022 |
Jan
(51) |
Feb
(39) |
Mar
(72) |
Apr
(65) |
May
(30) |
Jun
(72) |
Jul
(129) |
Aug
(44) |
Sep
(45) |
Oct
(30) |
Nov
(48) |
Dec
(275) |
2023 |
Jan
(235) |
Feb
(232) |
Mar
(68) |
Apr
(16) |
May
(52) |
Jun
(87) |
Jul
(143) |
Aug
(32) |
Sep
(26) |
Oct
(15) |
Nov
(20) |
Dec
(74) |
2024 |
Jan
(119) |
Feb
(32) |
Mar
(64) |
Apr
(45) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
From: Douglas <dt...@us...> - 2006-11-08 03:29:37
|
Update of /cvsroot/maxima/maxima/share/affine In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv24295 Modified Files: polyb.lisp polyc.lisp Log Message: * Symbol case downcasing - for support of the Scieneer lower case mode and the ACL modern mode. Index: polyb.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/share/affine/polyb.lisp,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- polyb.lisp 7 Nov 2005 17:37:10 -0000 1.6 +++ polyb.lisp 8 Nov 2006 03:29:31 -0000 1.7 @@ -41,7 +41,7 @@ collect w)))) #+lispm (progn - (setq tem (MAKE-ARRAY (length a-list))) + (setq tem (make-array (length a-list))) (format t "~%Having to sort") (fillarray tem a-list) (sort-grouped-array tem group-size pred) @@ -148,7 +148,7 @@ do (return t))) (t (sloop for v on (cdr $dot_simplifications) by 'cddr when (eq 0 (second v)) - do (cond ((atom (setq u (car v)))(cond ((zl-MEMBER u form)(return t)))) + do (cond ((atom (setq u (car v)))(cond ((zl-member u form)(return t)))) (t (cond ((ordered-sublist (cdr u) form)(return t)))))))))) (defun contains-a-replacement (form &aux tem1 u) @@ -163,7 +163,7 @@ (sloop while tem1 do (setq u (car tem1)) (setq tem1 (cddr tem1)) - (cond ((atom u)(cond ((zl-MEMBER u form)(return t)))) + (cond ((atom u)(cond ((zl-member u form)(return t)))) (t (cond ((ordered-sublist (cdr u) form )(return t))))))))) @@ -794,9 +794,9 @@ ;; #+3600 -;; (DEFUN *RED (N D &aux tem ) -;; (COND ((ZEROP N) 0) -;; ((EQUAL D 1) N) +;; (defun *red (n d &aux tem ) +;; (cond ((zerop n) 0) +;; ((equal d 1) n) ;; (t (setq n (/ n d)) ;; (cond ((integerp n) n) ;; (t (list '(rat simp) @@ -813,7 +813,7 @@ collecting v into tem finally (return (cons '(mlist simp) (sort tem $order_function))))) -(defun Parse-string (a-string) +(defun parse-string (a-string) (cond ((null (or (string-search "$" a-string) (string-search ";" a-string))) (setq a-string (string-append a-string "$")))) (with-input-from-string (stream a-string) @@ -1174,7 +1174,7 @@ when (not (sloop for key in key-strings when (string-search key string-v) do (return t))) - do (setq tem (zl-DELETE v tem)) + do (setq tem (zl-delete v tem)) finally (return tem))))) (defun $socle (variables deg &aux f unknowns eqns tem1 parameters answer ) (setq variables (cons '(mlist) (sort (cdr variables) $order_function))) @@ -1252,7 +1252,7 @@ (setq $centralizers (append `((mlist) ,v ,f) (cdr $centralizers))) (displa f) finally (return ($separate_parameters f))))) -(Defun $fast_central_elements (variables deg &aux f unknowns eqns tem1 parameters answer ) +(defun $fast_central_elements (variables deg &aux f unknowns eqns tem1 parameters answer ) (setq variables (cons '(mlist) (sort (cdr variables) $order_function))) (setq $commutators nil $centralizers nil) (let* ((monoms ($mono variables deg)) @@ -1299,9 +1299,9 @@ (let ((linel (- linel 10))) (sloop for i from n below $linenum do (format t "~% ~4A: ~A" (string-trim "$" (string (setq tem ($concat '$c i)))) - (string-GRIND (MEVAL* tem)))))) + (string-grind (meval* tem)))))) -(defvar *pbi-string* (MAKE-ARRAY '(64) :element-type 'standard-char +(defvar *pbi-string* (make-array '(64) :element-type 'standard-char :fill-pointer 0 :adjustable t)) (defun new-concat (a &rest b &aux me) @@ -1321,7 +1321,7 @@ #+lispm (progn -(defvar *my-stream* (MAKE-ARRAY '(0) :element-type 'standard-char +(defvar *my-stream* (make-array '(0) :element-type 'standard-char :fill-pointer 0 :adjustable t)) (defun my-stream (op &optional arg1 &rest rest) @@ -1335,36 +1335,36 @@ (stream-default-handler (function my-stream) op arg1 rest)))) -(defun my-displa (x &optional fromx fromy ($DISPLAY2D )&AUX ANSWER) +(defun my-displa (x &optional fromx fromy ($display2d )&aux answer) (set-fill-pointer *my-stream* 0) - (let (($linedisp nil)(smart-tty)($cursordisp nil)($display2d T)) + (let (($linedisp nil)(smart-tty)($cursordisp nil)($display2d t)) (let ((*standard-output* 'my-stream)) (displa x))) - (SETQ ANSWER (string-trim '(141 #\space) *my-stream*)) - (LET ((STREAM *standard-output*)) - (MULTIPLE-VALUE-BIND (XPOS YPOS) (SEND STREAM :READ-CURSORPOS :CHARACTER) + (setq answer (string-trim '(141 #\space) *my-stream*)) + (let ((stream *standard-output*)) + (multiple-value-bind (xpos ypos) (send stream :read-cursorpos :character) (cond ((null fromx)(setq fromx xpos fromy (f+ 2 ypos)))) - (MY-DRAW-STRING ANSWER XPOS (F1+ YPOS))))) + (my-draw-string answer xpos (f1+ ypos))))) -(DEFUN MY-DRAW-STRING ( A-STRING FROMX FROMY &OPTIONAL (STREAM *standard-output*)) - (MULTIPLE-VALUE-BIND (X Y) (SEND STREAM :READ-CURSORPOS :CHARACTER) - (SEND STREAM :SET-CURSORPOS (F1+ FROMX) FROMY :CHARACTER) - (SLOOP FOR I FROM 0 BELOW (length (the cl:array A-STRING)) - UNLESS (EQ (AREF A-STRING I) 141) - DO (SEND STREAM :TYO (AREF A-STRING I)) - ELSE DO (INCF FROMY) (SEND STREAM :SET-CURSORPOS FROMX FROMY :CHARACTER) - FINALLY (SEND STREAM :SET-CURSORPOS X (f+ 2 Y) :CHARACTER)))) +(defun my-draw-string ( a-string fromx fromy &optional (stream *standard-output*)) + (multiple-value-bind (x y) (send stream :read-cursorpos :character) + (send stream :set-cursorpos (f1+ fromx) fromy :character) + (sloop for i from 0 below (length (the cl:array a-string)) + unless (eq (aref a-string i) 141) + do (send stream :tyo (aref a-string i)) + else do (incf fromy) (send stream :set-cursorpos fromx fromy :character) + finally (send stream :set-cursorpos x (f+ 2 y) :character)))) -(defun string-displa (x &optional ($DISPLAY2D )&AUX ANSWER) +(defun string-displa (x &optional ($display2d )&aux answer) "Converts the displa into a string" (setf (fill-pointer *my-stream* )0) (let (($linedisp nil)(smart-tty)($cursordisp nil)) - (let ((*standard-output* 'my-stream)(LINEL 40)) + (let ((*standard-output* 'my-stream)(linel 40)) (displa x) - (SETQ ANSWER (string-trim-replace '(#\newline) '#\space *my-stream*))))) + (setq answer (string-trim-replace '(#\newline) '#\space *my-stream*))))) (defun string-trim-replace ( replace replace-by sstring) Index: polyc.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/share/affine/polyc.lisp,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- polyc.lisp 1 Feb 2006 05:51:13 -0000 1.6 +++ polyc.lisp 8 Nov 2006 03:29:31 -0000 1.7 @@ -166,7 +166,7 @@ (defun $list_factors(poly) (cond ((atom poly ) poly) - ((MBAGP poly) (CONS (CAR poly) (MAPCAR #'$list_factors (CDR poly)))) + ((mbagp poly) (cons (car poly) (mapcar #'$list_factors (cdr poly)))) ((eq (caar poly) 'mtimes) (cons '(mlist) (cdr poly))) (t poly))) @@ -197,14 +197,14 @@ (defun remove-from-*genpairs* (expr) - (setq *genvar* (zl-DELETE (get-genvar expr) *genvar*)) + (setq *genvar* (zl-delete (get-genvar expr) *genvar*)) (sloop for v in *genpairs* for i from 0 when (equal (car v) expr) do (cond ((eq i 0)(setq *genpairs* (cdr *genpairs*))) - (t (setq *genpairs* (zl-DELETE v *genpairs*))))) - (setq *varlist* (zl-DELETE expr *varlist*))) + (t (setq *genpairs* (zl-delete v *genpairs*))))) + (setq *varlist* (zl-delete expr *varlist*))) ; ;(defmacro must-replacep (symbol-to-set rat-poly) @@ -413,13 +413,13 @@ do (setq ind (quotient ind dimv)))) -(defun tensor-ind-to-list-ind (dimV &rest ll) +(defun tensor-ind-to-list-ind (dimv &rest ll) (sloop for m in ll for i from 0 summing (f* (expt dimv i) (f1- m)) into tem finally (return (1+ tem)))) -(defun tensor-ind-to-list-ind (dimV &rest ll) +(defun tensor-ind-to-list-ind (dimv &rest ll) (sloop for m in ll for i to 0 downfrom (f1- (length ll)) summing (f* (expt dimv i) (f1- m)) into tem @@ -490,7 +490,7 @@ finally (return ($transpose (cons '($matrix simp) tem))))) -(defun $Restriction_representation (repr elt-gln vector sub-basis) +(defun $restriction_representation (repr elt-gln vector sub-basis) (let ((repr-of-p ($find_matrix_of_operator `(lambda (x) (mfuncall ',repr ',elt-gln x)) sub-basis))) (ncmul* repr-of-p vector))) @@ -564,7 +564,7 @@ (sloop for i from 1 when (not (zerop (mod n (expt u i)))) do (return (f1- i))))) - ((equal (caar n) 'Rat)(setq num (second n) denom (third n)) + ((equal (caar n) 'rat)(setq num (second n) denom (third n)) (setq wnum (exponent-vector num length-vector)) (setq wdnom (exponent-vector denom length-vector)) (sloop for v in wnum @@ -889,12 +889,12 @@ (return 'bad-order)) (new-ratf expr)) (t expr))) - ((mbagp expr) (CONS (CAR EXPr) (MAPCAR #'$new_RAT (CDR EXPr))) ($new_RAT EXPr)) + ((mbagp expr) (cons (car expr) (mapcar #'$new_rat (cdr expr))) ($new_rat expr)) ((and (not (atom expr))(not (atom (car expr))))(cond ((equal (caar expr) 'rat) expr) (t (new-ratf expr)))) (t (new-ratf expr)))) -;(IF (MBAGP EXP) (CONS (CAR EXP) (MAPCAR #'RAT0 (CDR EXP))) (RATF EXP))) +;(if (mbagp exp) (cons (car exp) (mapcar #'rat0 (cdr exp))) (ratf exp))) (defun $shift (expr &optional (variables $current_variables) &aux tem) @@ -961,15 +961,15 @@ (sloop for i from 1 to (length ind-used) collecting (mul* (nth i vect)(nth (f1- i) relat-mat)) into tem finally (return (meval* (cons '(mplus) tem))))) - (setq mat.rtx (ncmul* mat '(($MATRIX SIMP) - ((MLIST SIMP) $X) ((MLIST SIMP) $Y) ((MLIST SIMP) $Z)))) + (setq mat.rtx (ncmul* mat '(($matrix simp) + ((mlist simp) $x) ((mlist simp) $y) ((mlist simp) $z)))) (setq prod (ncmul* ($transpose mat) - ($sub_list `((MLIST SIMP) ((MEQUAL SIMP) (($MATRIX SIMP) - ((MLIST SIMP) $X) - ((MLIST SIMP) $Y) - ((MLIST SIMP) $Z)) + ($sub_list `((mlist simp) ((mequal simp) (($matrix simp) + ((mlist simp) $x) + ((mlist simp) $y) + ((mlist simp) $z)) ,mat.rtx)) vmmm) mat)) (setq answer (mfuncall '$cof prod)) (sloop for i in ind-used |
From: Raymond T. <rt...@us...> - 2006-11-07 15:54:22
|
Update of /cvsroot/maxima/maxima/tests In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv28952/tests Modified Files: rtest15.mac Log Message: Bug [ 1073338 ] integrate yields incorrect result on rational function This is a workaround for this bug. We basically simplify some of the intermediate results so that maxima doesn't get confused. I think this is a gcd problem. src/residu.lisp: o Fix a few comments and add a few more. o For the case of simple poles, use RES1 instead of the more general $RESIDUE. (Workaround 1) o In RES1, call $RECTFORM on each pole to simplify somewhat so that maxima doesn't get confused. (Workaround 2) tests/rtest15.mac: o Add a test for 1073338, but disable it for now. The integral takes a bit of time to compute, and the result is quite messy. If sqrtdenest were available, the result can be simplified quite a bit. Index: rtest15.mac =================================================================== RCS file: /cvsroot/maxima/maxima/tests/rtest15.mac,v retrieving revision 1.48 retrieving revision 1.49 diff -u -d -r1.48 -r1.49 --- rtest15.mac 5 Nov 2006 02:52:42 -0000 1.48 +++ rtest15.mac 7 Nov 2006 15:54:11 -0000 1.49 @@ -547,11 +547,11 @@ * * The call to factor is to get rid of some numerical factors. */ -factor(integrate(1/(x^8-1),x,0,1/2)); --(2*sqrt(2)*atan((5*sqrt(2)+4)/(3*sqrt(2)+16)) - -2*sqrt(2)*atan((5*sqrt(2)-4)/(3*sqrt(2)-16))+sqrt(2)*log(4*(2*sqrt(2)+5)/17) - -sqrt(2)*log(-4*(2*sqrt(2)-5)/17)+2*log(2)-2*log(2/3)+4*atan(1/2)) - /16; +logcontract(ratsimp(factor(integrate(1/(x^8-1),x,0,1/2)))),algebraic; +-(sqrt(2)*log((20*sqrt(2)+33)/17)+2*sqrt(2)*atan((2*sqrt(2)+1)/7) + +2*sqrt(2)*atan((2*sqrt(2)-1)/7)+log(9) + +4*atan(1/2)) + /16$ /* * Bug [ 1582625 ] integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1) wrong? @@ -561,3 +561,161 @@ */ integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1); -(sqrt(2)-2)*%pi^2/32; + +/* + * Bug [ 1073338 ] integrate yields incorrect result on rational function + * + * Work around in residu.lisp, rev 1.9 + * + * This test is currently commented out because the resulting + * expression is quite messy. + * + * If sqrtdenest is available (via load(sqdnst)), the result can be + * drastically simplified. + * + * factor(expand(sqrtdenest(integrate (1/((x-3)^4+1/2), x,0,1)); + * + * (2*atan((sqrt(2)-4*2^(1/4)+8)/(49*2^(3/4)+sqrt(2)-8)) + * -log((2^(3/4)+12*sqrt(2)+73*2^(1/4)-2)/(33*2^(1/4))) + * +log((2^(3/4)-12*sqrt(2)+73*2^(1/4)+2)/(33*2^(1/4))) + * -2*atan((sqrt(2)+4*2^(1/4)+8)/(-49*2^(3/4)+sqrt(2)-8))) + * /(2*2^(3/4))$ + * + * The numerical value of this closely matches the value produced by + * quad_qags. + */ +/* +integrate (1/((x-3)^4+1/2), x,0,1); +*/ +/* +(sqrt(8*sqrt(2)+33)*(sqrt(33-8*sqrt(2))*(-303932694637027779179040838424917830791340920647723203843786675721409493938686603653462388683184332672038715607926359080345564544623876 + *sqrt(2) + *log( + (4*sqrt(8*sqrt(2)+33)*2^(3/4) + +2409*sqrt(2) + +98*2^(1/4)*sqrt(33-8*sqrt(2))+66) + /(1089*sqrt(2))) + -303932694637027779179040838424917830791340920647723203843786675721409493938686603653462388683184332672038715607926359080345564544623876 + *sqrt(2) + *log( + -(4*sqrt(8*sqrt(2)+33)*2^(3/4) + -2409*sqrt(2) + +98*2^(1/4)*sqrt(33-8*sqrt(2))-66) + /(1089*sqrt(2))) + +552099361329633771643053075931421891496561660699260039342762073023154587964100193077972544919901295427996546955909628198165227368108992 + *atan( + (sqrt(2)*sqrt(8*sqrt(2)+33) + +4*2^(1/4)) + /(49*2^(3/4) + +sqrt(33-8*sqrt(2))*sqrt(2))) + +552099361329633771643053075931421891496561660699260039342762073023154587964100193077972544919901295427996546955909628198165227368108992 + *atan( + (sqrt(2)*sqrt(8*sqrt(2)+33) + -4*2^(1/4)) + /(sqrt(33-8*sqrt(2))*sqrt(2) + -49*2^(3/4)))) + +(sqrt(2)*(7273676032497039168131774950561578055317646841803223542920409530084197500555733221676492888120312852560658555593166871914436264693038592 + *2^(3/4) + +15024101598192224426775522878094489830129770416645215758288613332660245818757125540791535854762847062463584642841951894834286659006302528 + *2^(1/4)) + -15806609915556534018417670371152557760367601484432274180715848023511630099506323419685377502712621069047746480006486169518017813900189696 + *2^(3/4) + -14921207789341832974121094904087265416854931705883703311755954514544158640240022671047098240743627035215830188037320414982641848009637856 + *2^(1/4)) + *log((4*sqrt(8*sqrt(2)+33)*2^(3/4) + +2409*sqrt(2)+98*2^(1/4)*sqrt(33-8*sqrt(2))+66) + /(1089*sqrt(2))) + +(15806609915556534018417670371152557760367601484432274180715848023511630099506323419685377502712621069047746480006486169518017813900189696 + *2^(3/4) + +sqrt(2)*(-7273676032497039168131774950561578055317646841803223542920409530084197500555733221676492888120312852560658555593166871914436264693038592 + *2^(3/4) + -15024101598192224426775522878094489830129770416645215758288613332660245818757125540791535854762847062463584642841951894834286659006302528 + *2^(1/4)) + +14921207789341832974121094904087265416854931705883703311755954514544158640240022671047098240743627035215830188037320414982641848009637856 + *2^(1/4)) + *log(-(4*sqrt(8*sqrt(2)+33)*2^(3/4) + -2409*sqrt(2)+98*2^(1/4)*sqrt(33-8*sqrt(2))-66) + /(1089*sqrt(2))) + +(sqrt(2)*(7327640322290316593732876713408613637149297427809224020091486781789084795423322383277576661700189415076709454073792835294520648062031352 + *2^(3/4) + -24285528483576216215802900536737837785365816203517925068254869165754405225950202499888252704108702487429010542581656513111567857075275200 + *2^(1/4)) + +26144471724343824555753855008401941376475191231582446367008979186926628807444978786510641009740282294708025041449211039101682593427318658 + *2^(3/4) + -16258982044197037165083939305272750506929021950987171219549827770582282472560576541844568472250630522849919350753500141262722071391094336 + *2^(1/4)) + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)+4*2^(1/4)) + /(49*2^(3/4)+sqrt(33-8*sqrt(2))*sqrt(2))) + +(-26144471724343824555753855008401941376475191231582446367008979186926628807444978786510641009740282294708025041449211039101682593427318658 + *2^(3/4) + +sqrt(2)*(24285528483576216215802900536737837785365816203517925068254869165754405225950202499888252704108702487429010542581656513111567857075275200 + *2^(1/4) + -7327640322290316593732876713408613637149297427809224020091486781789084795423322383277576661700189415076709454073792835294520648062031352 + *2^(3/4)) + +16258982044197037165083939305272750506929021950987171219549827770582282472560576541844568472250630522849919350753500141262722071391094336 + *2^(1/4)) + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)-4*2^(1/4)) + /(sqrt(33-8*sqrt(2))*sqrt(2)-49*2^(3/4)))) + +sqrt(33-8*sqrt(2))*((13072235862171912277876927504200970688237595615791223183504489593463314403722489393255320504870141147354012520724605519550841296713659329 + *2^(3/4) + +sqrt(2)*(-3663820161145158296866438356704306818574648713904612010045743390894542397711661191638788330850094707538354727036896417647260324031015676 + *2^(3/4) + -12142764241788108107901450268368918892682908101758962534127434582877202612975101249944126352054351243714505271290828256555783928537637600 + *2^(1/4)) + +8129491022098518582541969652636375253464510975493585609774913885291141236280288270922284236125315261424959675376750070631361035695547168 + *2^(1/4)) + *log((4*sqrt(8*sqrt(2)+33)*2^(3/4) + +2409*sqrt(2)+98*2^(1/4)*sqrt(33-8*sqrt(2))+66) + /(1089*sqrt(2))) + +(sqrt(2)*(3663820161145158296866438356704306818574648713904612010045743390894542397711661191638788330850094707538354727036896417647260324031015676 + *2^(3/4) + +12142764241788108107901450268368918892682908101758962534127434582877202612975101249944126352054351243714505271290828256555783928537637600 + *2^(1/4)) + -13072235862171912277876927504200970688237595615791223183504489593463314403722489393255320504870141147354012520724605519550841296713659329 + *2^(3/4) + -8129491022098518582541969652636375253464510975493585609774913885291141236280288270922284236125315261424959675376750070631361035695547168 + *2^(1/4)) + *log(-(4*sqrt(8*sqrt(2)+33)*2^(3/4) + -2409*sqrt(2)+98*2^(1/4)*sqrt(33-8*sqrt(2))-66) + /(1089*sqrt(2))) + +(-31613219831113068036835340742305115520735202968864548361431696047023260199012646839370755005425242138095492960012972339036035627800379392 + *2^(3/4) + +sqrt(2)*(30048203196384448853551045756188979660259540833290431516577226665320491637514251081583071709525694124927169285683903789668573318012605056 + *2^(1/4) + -14547352064994078336263549901123156110635293683606447085840819060168395001111466443352985776240625705121317111186333743828872529386077184 + *2^(3/4)) + +29842415578683665948242189808174530833709863411767406623511909029088317280480045342094196481487254070431660376074640829965283696019275712 + *2^(1/4)) + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)+4*2^(1/4)) + /(49*2^(3/4)+sqrt(33-8*sqrt(2))*sqrt(2))) + +(sqrt(2)*(14547352064994078336263549901123156110635293683606447085840819060168395001111466443352985776240625705121317111186333743828872529386077184 + *2^(3/4) + -30048203196384448853551045756188979660259540833290431516577226665320491637514251081583071709525694124927169285683903789668573318012605056 + *2^(1/4)) + +31613219831113068036835340742305115520735202968864548361431696047023260199012646839370755005425242138095492960012972339036035627800379392 + *2^(3/4) + -29842415578683665948242189808174530833709863411767406623511909029088317280480045342094196481487254070431660376074640829965283696019275712 + *2^(1/4)) + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)-4*2^(1/4)) + /(sqrt(33-8*sqrt(2))*sqrt(2)-49*2^(3/4)))) + +9421913533747861154550265991172452754531568540079419319157386947363694312099284713257334049178714312833200183845717131490712500883340156 + *sqrt(2) + *log((4*sqrt(8*sqrt(2)+33)*2^(3/4)+2409*sqrt(2) + +98*2^(1/4)*sqrt(33-8*sqrt(2))+66) + /(1089*sqrt(2))) + +9421913533747861154550265991172452754531568540079419319157386947363694312099284713257334049178714312833200183845717131490712500883340156 + *sqrt(2) + *log(-(4*sqrt(8*sqrt(2)+33)*2^(3/4)-2409*sqrt(2) + +98*2^(1/4)*sqrt(33-8*sqrt(2))-66) + /(1089*sqrt(2))) + -17115080201218646920934645353874078636393411481677061219625624263717792226887105985417148892516940158267892955633198474143122048411378752 + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)+4*2^(1/4)) + /(49*2^(3/4)+sqrt(33-8*sqrt(2))*sqrt(2))) + -17115080201218646920934645353874078636393411481677061219625624263717792226887105985417148892516940158267892955633198474143122048411378752 + *atan((sqrt(2)*sqrt(8*sqrt(2)+33)-4*2^(1/4)) + /(sqrt(33-8*sqrt(2))*sqrt(2)-49*2^(3/4)))) + /(25030572260104949286868860216839737359701304983041761096339002213086221108316254837554160418857332637675304669611573315500143443068832260 + *sqrt(2) + -807437810209021027600746073596699852195498034267037762239177735269578117741434364772372224985453846994852343046769554571423434030596096 + *sqrt(33-8*sqrt(2))*sqrt(2)*sqrt(8*sqrt(2)+33))$ +*/ |
From: Raymond T. <rt...@us...> - 2006-11-07 15:54:19
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv28952/src Modified Files: residu.lisp Log Message: Bug [ 1073338 ] integrate yields incorrect result on rational function This is a workaround for this bug. We basically simplify some of the intermediate results so that maxima doesn't get confused. I think this is a gcd problem. src/residu.lisp: o Fix a few comments and add a few more. o For the case of simple poles, use RES1 instead of the more general $RESIDUE. (Workaround 1) o In RES1, call $RECTFORM on each pole to simplify somewhat so that maxima doesn't get confused. (Workaround 2) tests/rtest15.mac: o Add a test for 1073338, but disable it for now. The integral takes a bit of time to compute, and the result is quite messy. If sqrtdenest were available, the result can be simplified quite a bit. Index: residu.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/residu.lisp,v retrieving revision 1.8 retrieving revision 1.9 diff -u -d -r1.8 -r1.9 --- residu.lisp 6 Nov 2006 15:28:47 -0000 1.8 +++ residu.lisp 7 Nov 2006 15:54:11 -0000 1.9 @@ -133,16 +133,23 @@ (caddr pl)) (setq dp (sdiff d var)))) (cond ((car pl) - ;; Compute the sum of the residues of n/d for the roots in REGION. + ;; Compute the sum of the residues of n/d for the + ;; multiple roots in REGION. (setq a (m+l (residue n (cond (leadcoef factors) (t d)) (car pl))))) (t (setq a 0.))) (cond ((cadr pl) - ;; Compute the sum of the residues of n/d for the roots in REGION1. + ;; Compute the sum of the residues of n/d for the simple + ;; roots in REGION1. Since the roots are simple, we can + ;; use RES1 to compute the residues instead of the more + ;; complicated $RESIDUE. (This works around a bug + ;; described in bug 1073338.) + #+nil (setq b (m+l (mapcar #'(lambda (pole) ($residue (m// n d) var pole)) - (cadr pl))))) + (cadr pl)))) + (setq b (m+l (res1 n dp (cadr pl))))) (t (setq b 0.))) (cond ((caddr pl) ;; Compute the sum of the residues of n/d for the roots @@ -165,9 +172,20 @@ (resm1 (div* zn factors) (car j))) pl)))) +;; Compute the residues of zn/d for the simple poles in the list PL1. +;; The poles must be simple because ZD must be the derivative of +;; denominator. For simple poles the residue can be computed as +;; limit(n(z)/d(z)*(z-a),z,a). Since the pole is simple we have the +;; indeterminate form (z-a)/d(z). Use L'Hospital's rule to get +;; 1/d'(z). Hence, the residue is easily computed as n(a)/d'(a). (defun res1 (zn zd pl1) (setq zd (div* zn zd)) - (mapcar #'(lambda (j) ($rectform ($expand (subin j zd)))) pl1)) + (mapcar #'(lambda (j) + ;; In case the pole is messy, call $RECTFORM. This + ;; works around some issues with gcd bugs in certain + ;; cases. (See bug 1073338.) + ($rectform ($expand (subin ($rectform j) zd)))) + pl1)) (defun resprog0 (f g n n2) (prog (a b c r) |
From: Jay B. <bel...@us...> - 2006-11-06 21:12:16
|
Update of /cvsroot/maxima/maxima/interfaces/emacs/emaxima In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv32297 Modified Files: maxima.el Log Message: (inferior-maxima-wait-for-output): Avoid infinite loop by replacing "while" by "when". (maxima-mode): Comment out old lines. Index: maxima.el =================================================================== RCS file: /cvsroot/maxima/maxima/interfaces/emacs/emaxima/maxima.el,v retrieving revision 1.49 retrieving revision 1.50 diff -u -d -r1.49 -r1.50 --- maxima.el 22 Jun 2005 03:48:42 -0000 1.49 +++ maxima.el 6 Nov 2006 21:11:58 -0000 1.50 @@ -2705,7 +2705,7 @@ (defun inferior-maxima-wait-for-output () "Wait for output from the Maxima process." - (while (and + (when (and inferior-maxima-waiting-for-output (inferior-maxima-running)) (accept-process-output inferior-maxima-process)) @@ -2760,8 +2760,8 @@ 'inferior-maxima-output-filter) ; (add-to-list 'comint-output-filter-functions ; 'inferior-maxima-replace-tabs-by-spaces) - (add-to-list 'comint-output-filter-functions - 'inferior-maxima-remove-double-input-prompt) +; (add-to-list 'comint-output-filter-functions +; 'inferior-maxima-remove-double-input-prompt) (if maxima-fix-double-prompt (add-to-list 'comint-output-filter-functions 'inferior-maxima-remove-double-prompt)) |
From: Raymond T. <rt...@us...> - 2006-11-06 15:28:52
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv27656/src Modified Files: defint.lisp residu.lisp Log Message: src/defint.lisp src/residu.lisp o Update and correct some of the comments. Index: defint.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/defint.lisp,v retrieving revision 1.34 retrieving revision 1.35 diff -u -d -r1.34 -r1.35 --- defint.lisp 6 Nov 2006 02:51:37 -0000 1.34 +++ defint.lisp 6 Nov 2006 15:28:47 -0000 1.35 @@ -2563,9 +2563,7 @@ ;; It seems as if polelist returns a list of several items. ;; The first element is a list consisting of the pole and (z - ;; pole). We don't care about this, so we take the rest of the - ;; result. I think the second element of the list is an alist - ;; consisting of the pole and it's multiplicity. I don't know - ;; what the rest of the list is. + ;; result. (setq pl (cdr (polelist denom-exponential #'(lambda (j) ;; The imaginary part is nonzero, @@ -2577,23 +2575,25 @@ (not (eq ($asksign ($realpart j)) '$zero))))))) ;; Not sure what this does. (cond ((null pl) + ;; No roots at all, so return (return nil)) ((or (cadr pl) (caddr pl)) + ;; We have simple roots or roots in REGION1 (setq dp (sdiff d var)))) - ;; The cadr of pl is the list of the (simple?) poles of the - ;; denom-exponential. Take the log of them to find the poles of - ;; the original expression. Then compute the residues at each of - ;; these poles and sum them up and put the result in B. (If no - ;; simple poles set B to 0.) (cond ((cadr pl) + ;; The cadr of pl is the list of the simple poles of + ;; denom-exponential. Take the log of them to find the + ;; poles of the original expression. Then compute the + ;; residues at each of these poles and sum them up and put + ;; the result in B. (If no simple poles set B to 0.) (setq b (mapcar #'log-imag-0-2%pi (cadr pl))) (setq b (res1 n dp b)) (setq b (m+l b))) (t (setq b 0.))) - ;; I think this handles the case of the multiple poles of the - ;; denominator. The sum of these residues are placed in C. (cond ((caddr pl) + ;; I think this handles the case of poles outside the + ;; regions. The sum of these residues are placed in C. (let ((temp (mapcar #'log-imag-0-2%pi (caddr pl)))) (setq c (append temp (mapcar #'(lambda (j) (m+ (m*t '$%i %pi2) j)) @@ -2602,9 +2602,9 @@ (setq c (m+l c)))) (t (setq c 0.))) (cond ((car pl) - ;; We have the poles of deonom-exponential, so we need to - ;; convert them to the actual pole values for R(exp(x)), - ;; by taking the log of the value of poles. + ;; We have the repeated poles of deonom-exponential, so we + ;; need to convert them to the actual pole values for + ;; R(exp(x)), by taking the log of the value of poles. (let ((poles (mapcar #'(lambda (p) (log-imag-0-2%pi (car p))) (car pl))) Index: residu.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/residu.lisp,v retrieving revision 1.7 retrieving revision 1.8 diff -u -d -r1.7 -r1.8 --- residu.lisp 6 Nov 2006 02:51:38 -0000 1.7 +++ residu.lisp 6 Nov 2006 15:28:47 -0000 1.8 @@ -28,20 +28,21 @@ ;; The regions are determined by functions REGION and REGION1, which ;; should return non-NIL if the root is in the given region. ;; +;; The description below applies if *SEMIRAT* is NIL. If *SEMIRAT* is +;; non-NIL, somewhat different results are returned. I (rtoy) am not +;; exactly sure what *SEMIRAT* is intended to mean. +;; ;; The first part of the list of the form ((r1 (x - r1)^d1) (r2 (x - ;; r2)^d2) ...) where r1, r2 are the roots, d1, d2 are the ;; multiplicity of each root, and x is the variable. ;; -;; The second part is a list of the roots in region 1. If the root is -;; simple, then the item is the root. If the root is a multiple root -;; of order d, the item is (r d). +;; The second part is a list of the repeated roots in REGION. Each +;; element of the list is of the form (r d) where r is the root and d +;; is the multiplicity. ;; -;; The third part is similar, except it is the list of the roots in -;; region 2. +;; The third part is a list of the simple roots in REGION. ;; -;; Finally, the fourth part is either NIL if *SEMIRAT* is NIL. If -;; *SEMIRAT* is non-NIL, it is the list of roots outside of region and -;; region1, in the same format as the second and third parts. +;; Finally, the fourth part is NIL, unless *semirat* is T. (defun polelist (d region region1) (prog (roots $breakup r rr ss r1 s pole wflag cf) (setq wflag t) |
From: Raymond T. <rt...@us...> - 2006-11-06 02:51:41
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv5440/src Modified Files: defint.lisp residu.lisp Log Message: src/defint.lisp: src/residu.lisp: o Rename semirat* to *semirat*. Add defvar for *semirat*. Index: defint.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/defint.lisp,v retrieving revision 1.33 retrieving revision 1.34 diff -u -d -r1.33 -r1.34 --- defint.lisp 6 Nov 2006 02:28:02 -0000 1.33 +++ defint.lisp 6 Nov 2006 02:51:37 -0000 1.34 @@ -150,7 +150,7 @@ no-err-sub oscip %einvolve sin-sq-cos-sq-sub) ;;;rsn* is in comdenom. does a ratsimp of numerator. - (special *def2* pcprntd *mtoinf* rsn* semirat* + (special *def2* pcprntd *mtoinf* rsn* sn* sd* leadcoef checkfactors *nodiverg rd* exp1 *ul1* *ll1* *dflag bptu bptd plm* zn @@ -202,6 +202,10 @@ (defmvar nonintegerl nil "A non-integer-list for non-atoms found out to be `noninteger's") +;; Not really sure what this is meant to do, but it's used by MTORAT, +;; KEYHOLE, and POLELIST. +(defvar *semirat* nil) + (defun $defint (exp var ll ul) (let ((*global-defint-assumptions* ()) (integer-info ()) (integerl integerl) (nonintegerl nonintegerl)) @@ -1390,7 +1394,7 @@ (t nil))))))) (defun mtorat (n d s) - (let ((semirat* t)) + (let ((*semirat* t)) (cond ((and (null *dflag) (setq s (difapply n d s #'mtorat))) s) @@ -1507,7 +1511,7 @@ ;; keyhole contour. This contour is basically an disk with a slit ;; along the positive real axis. n/d must be a rational function. (defun keyhole (n d var) - (let* ((semirat* ()) + (let* ((*semirat* ()) (res (res n d #'(lambda (j) ;; Ok if not on the positive real axis. Index: residu.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/residu.lisp,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- residu.lisp 6 Nov 2006 02:28:02 -0000 1.6 +++ residu.lisp 6 Nov 2006 02:51:38 -0000 1.7 @@ -16,10 +16,9 @@ (declare-top (*lexpr $diff $substitute $taylor $expand) (special $breakup $noprincipal varlist leadcoef var *roots *failures wflag nn* - sn* sd* $tellratlist genvar semirat* dn* zn) + sn* sd* $tellratlist genvar dn* zn) (genprefix res)) -(setq semirat* nil) ;; Compute the poles (roots) of the polynomial D and return them. ;; Divide these roots into several parts: Those in REGION, REGION1, @@ -40,8 +39,8 @@ ;; The third part is similar, except it is the list of the roots in ;; region 2. ;; -;; Finally, the fourth part is either NIL if SEMIRAT* is NIL. If -;; SEMIRAT* is non-NIL, it is the list of roots outside of region and +;; Finally, the fourth part is either NIL if *SEMIRAT* is NIL. If +;; *SEMIRAT* is non-NIL, it is the list of roots outside of region and ;; region1, in the same format as the second and third parts. (defun polelist (d region region1) (prog (roots $breakup r rr ss r1 s pole wflag cf) @@ -56,14 +55,14 @@ loop1 (cond ((null roots) - (cond ((and semirat* + (cond ((and *semirat* (> (f+ (length s) (length r)) ;(LENGTH (APPEND S R)) (f+ (length ss) (length rr)) ;(LENGTH (APPEND SS RR)) )) - ;; Return CF, repeated roots (semirat*), simple - ;; roots (semirat*), roots in region 1. + ;; Return CF, repeated roots (*semirat*), simple + ;; roots (*semirat*), roots in region 1. (return (list cf rr ss r1))) (t ;; Return CF, repeated roots, simple roots, roots in region 1. @@ -99,8 +98,8 @@ (t ;; Return NIL if we get here. (return nil)))) - (semirat* - ;; (What does SEMIRAT* mean?) Anyway if we're here, the + (*semirat* + ;; (What does *SEMIRAT* mean?) Anyway if we're here, the ;; pole is not in REGION or REGIOn1, so push the pole onto ;; SS or RR depending if the pole is repeated or not. (cond ((equal d 1) |
From: Raymond T. <rt...@us...> - 2006-11-06 02:28:09
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv26875/src Modified Files: defint.lisp residu.lisp Log Message: src/defint.lisp: o Add a few minor comments src/residu.lisp: o Document better what POLELIST and RES do. Index: defint.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/defint.lisp,v retrieving revision 1.32 retrieving revision 1.33 diff -u -d -r1.32 -r1.33 --- defint.lisp 5 Nov 2006 02:52:40 -0000 1.32 +++ defint.lisp 6 Nov 2006 02:28:02 -0000 1.33 @@ -55,7 +55,7 @@ ;; ;; dintrad- i(x^m/(a*x^2+b*x+c)^(n+3/2),x,0,inf) [wang, p 74] ;; -;; dintlog- i(log(g(x))*f(x),x,0,inf) = 0 (by symetry) or +;; dintlog- i(log(g(x))*f(x),x,0,inf) = 0 (by symmetry) or ;; tries an integration by parts. (only routine to ;; try integration by parts) [wang, pp 93-95] ;; @@ -1755,6 +1755,7 @@ ;;; Do integrals of sin and cos. this routine makes sure lower limit ;;; is zero. (defun intsc1 (a b e) + ;; integrate(e,var,a,b) (let ((limit-diff (m+ b (m* -1 a))) ($%emode t) ($trigsign t) Index: residu.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/residu.lisp,v retrieving revision 1.5 retrieving revision 1.6 diff -u -d -r1.5 -r1.6 --- residu.lisp 5 Nov 2006 02:27:01 -0000 1.5 +++ residu.lisp 6 Nov 2006 02:28:02 -0000 1.6 @@ -21,41 +21,92 @@ (setq semirat* nil) +;; Compute the poles (roots) of the polynomial D and return them. +;; Divide these roots into several parts: Those in REGION, REGION1, +;; and everywhere else. These are returned in a list. (In a more +;; modern style, we'd probably return them in 4 different values.) +;; +;; The regions are determined by functions REGION and REGION1, which +;; should return non-NIL if the root is in the given region. +;; +;; The first part of the list of the form ((r1 (x - r1)^d1) (r2 (x - +;; r2)^d2) ...) where r1, r2 are the roots, d1, d2 are the +;; multiplicity of each root, and x is the variable. +;; +;; The second part is a list of the roots in region 1. If the root is +;; simple, then the item is the root. If the root is a multiple root +;; of order d, the item is (r d). +;; +;; The third part is similar, except it is the list of the roots in +;; region 2. +;; +;; Finally, the fourth part is either NIL if SEMIRAT* is NIL. If +;; SEMIRAT* is non-NIL, it is the list of roots outside of region and +;; region1, in the same format as the second and third parts. (defun polelist (d region region1) (prog (roots $breakup r rr ss r1 s pole wflag cf) (setq wflag t) (setq leadcoef (polyinx d var 'leadcoef)) (setq roots (solvecase d)) (if (eq roots 'failure) (return ())) - loop1 (cond ((null roots) - (cond ((and semirat* - (> (f+ (length s) (length r)) + ;; Loop over all the roots. SOLVECASE returns the roots in the form + ;; ((x = r1) mult1 + ;; (x = r2) mult2 + ;; ...) + + loop1 + (cond ((null roots) + (cond ((and semirat* + (> (f+ (length s) (length r)) ;(LENGTH (APPEND S R)) - (f+ (length ss) (length rr)) + (f+ (length ss) (length rr)) ;(LENGTH (APPEND SS RR)) - )) - (return (list cf rr ss r1))) - (t (return (list cf r s r1))))) - (t (setq pole (caddar roots)) - (setq d (cadr roots)) - (cond (leadcoef - (setq cf (cons pole - (cons - (m^ (m+ var (m* -1 pole)) - d) - cf))))))) + )) + ;; Return CF, repeated roots (semirat*), simple + ;; roots (semirat*), roots in region 1. + (return (list cf rr ss r1))) + (t + ;; Return CF, repeated roots, simple roots, roots in region 1. + (return (list cf r s r1))))) + (t + ;; Set POLE to the actual root and set D to the + ;; multiplicity of the root. + (setq pole (caddar roots)) + (setq d (cadr roots)) + (cond (leadcoef + ;; Is it possible for LEADCOEF to be NIL ever? + ;; + ;; Push (pole (x - pole)^d) onto the list CF. + (setq cf (cons pole + (cons + (m^ (m+ var (m* -1 pole)) + d) + cf))))))) (cond ((funcall region pole) + ;; The pole is in REGION (cond ((equal d 1) + ;; A simple pole, so just push the pole onto the list S. (setq s (cons pole s))) - (t (setq r (cons (list pole d) r))))) + (t + ;; A multiple pole, so push (pole d) onto the list R. + (setq r (cons (list pole d) r))))) ((funcall region1 pole) + ;; The pole is in REGION1 (cond ((not $noprincipal) + ;; Put the pole onto the R1 list. (Don't know what + ;; $NOPRINCIPAL is.) (setq r1 (cons pole r1))) - (t (return nil)))) + (t + ;; Return NIL if we get here. + (return nil)))) (semirat* + ;; (What does SEMIRAT* mean?) Anyway if we're here, the + ;; pole is not in REGION or REGIOn1, so push the pole onto + ;; SS or RR depending if the pole is repeated or not. (cond ((equal d 1) (setq ss (cons pole ss))) (t (setq rr (cons (list pole d) rr)))))) + ;; Pop this root and multiplicity and move on. (setq roots (cddr roots)) (go loop1))) @@ -67,32 +118,42 @@ ((null *roots) ()) (t *roots)))))) +;; Compute the sum of the residues of n/d. (defun res (n d region region1) (let ((pl (polelist d region region1)) dp a b c factors leadcoef) (cond ((null pl) nil) - (t (setq factors (car pl)) - (setq pl (cdr pl)) - (cond ((or (cadr pl) - (caddr pl)) - (setq dp (sdiff d var)))) - (cond ((car pl) - (setq a (m+l (residue n (cond (leadcoef factors) - (t d)) - (car pl))))) - (t (setq a 0.))) - (cond ((cadr pl) - (setq b (m+l (mapcar #'(lambda (pole) - ($residue (m// n d) var pole)) - (cadr pl))))) - (t (setq b 0.))) - (cond ((caddr pl) - (setq c (m+l (mapcar #'(lambda (pole) - ($residue (m// n d) var pole)) - (caddr pl))))) - (t (setq c ()))) - (list (m+ a b) c))))) + (t + (setq factors (car pl)) + (setq pl (cdr pl)) + ;; PL now contains the list of the roots in region, roots in + ;; region1, and everything else. + (cond ((or (cadr pl) + (caddr pl)) + (setq dp (sdiff d var)))) + (cond ((car pl) + ;; Compute the sum of the residues of n/d for the roots in REGION. + (setq a (m+l (residue n (cond (leadcoef factors) + (t d)) + (car pl))))) + (t (setq a 0.))) + (cond ((cadr pl) + ;; Compute the sum of the residues of n/d for the roots in REGION1. + (setq b (m+l (mapcar #'(lambda (pole) + ($residue (m// n d) var pole)) + (cadr pl))))) + (t (setq b 0.))) + (cond ((caddr pl) + ;; Compute the sum of the residues of n/d for the roots + ;; not in REGION nor REGION1. + (setq c (m+l (mapcar #'(lambda (pole) + ($residue (m// n d) var pole)) + (caddr pl))))) + (t (setq c ()))) + ;; Return the sum of the residues in the two regions and the + ;; sum of the residues outside the two regions. + (list (m+ a b) c))))) (defun residue (zn factors pl) (cond (leadcoef |
From: Mario R. R. <rio...@us...> - 2006-11-05 21:00:54
|
Update of /cvsroot/maxima/maxima/doc/info/es In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv22697 Modified Files: Bugs.es.texi maxima.texi Constants.es.texi Numerical.es.texi Operators.es.texi Log Message: Updating translations Index: Bugs.es.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/es/Bugs.es.texi,v retrieving revision 1.4 retrieving revision 1.5 diff -u -d -r1.4 -r1.5 --- Bugs.es.texi 31 Jul 2006 18:21:18 -0000 1.4 +++ Bugs.es.texi 5 Nov 2006 21:00:48 -0000 1.5 @@ -1,15 +1,8 @@ -@c version 1.9 +@c version 1.10 @menu -* Introducci@'on a la detecci@'on e informe de fallos:: * Definiciones para la detecci@'on e informe de fallos:: @end menu -@node Introducci@'on a la detecci@'on e informe de fallos -@section Introducci@'on a la detecci@'on e informe de fallos -Como todos los grandes programas, Maxima contiene tanto bugs conocidos -como desconocidos. Este cap@'{@dotless{i}}tulo describe las facilidades internas para -ejecutar la suite de evaluaci@'on de Maxima (Maxima test suite) adem@'as -de reportar nuevos bugs. @node Definiciones para la detecci@'on e informe de fallos @section Definiciones para la detecci@'on e informe de fallos @@ -18,14 +11,14 @@ @deffnx {Funci@'on} run_testsuite (@var{boolean}, @var{boolean}) @deffnx {Funci@'on} run_testsuite (@var{boolean}, @var{boolean}, @var{list}) -Ejecuta la suite de evaluaci@'on de Maxima. Los tests que producen las +Ejecuta el conjunto de pruebas de Maxima. Los tests que producen las respuestas deseadas son considerados como ``pruebas superadas'', como los tests que no producen las respuestas deseadas, son marcados como -bugs conocidos. +fallos conocidos. @code{run_testsuite ()} muestra s@'olo los test que no pasaron la prueba. -@code{run_testsuite (true)} muestra los tests que son marcados como bugs +@code{run_testsuite (true)} muestra los tests que son marcados como fallos conocidos, adem@'as de fallos. @code{run_testsuite (true, true)} muestra todos los tests. @@ -57,13 +50,13 @@ @deffn {Funci@'on} bug_report () Imprime las versiones de Maxima y de Lisp y proporciona un enlace a la -p@'agina web de reporte de bugs del proyecto Maxima. +p@'agina web sobre informe de fallos del proyecto Maxima. La informaci@'on respecto a las versiones es la misma que reporta la funci@'on @code{build_info}. -Cuando un bug es reportado, es de gran ayuda que se copie la +Cuando se informa sobre un fallo, es de gran ayuda que se copie la informaci@'on relacionada con la versi@'on de Maxima y de Lisp usada, -dentro del reporte de bug. +dentro del propio informe. @code{bug_report} retorna una cadena vac@'{@dotless{i}}a @code{""}. @end deffn Index: maxima.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/es/maxima.texi,v retrieving revision 1.11 retrieving revision 1.12 diff -u -d -r1.11 -r1.12 --- maxima.texi 28 Sep 2006 10:47:00 -0000 1.11 +++ maxima.texi 5 Nov 2006 21:00:48 -0000 1.12 @@ -1,6 +1,6 @@ \input texinfo @c -*-texinfo-*- -@c english version 1.35 +@c english version 1.34 @c 2000-04-17 Jim Van Zandt <jr...@va...> Added header, @c info directory entry, reference to introduction chapter, and menu @@ -149,7 +149,6 @@ * descriptive:: Estad@'{@dotless{i}}stica descriptiva. * diag:: Matrices de Jordan. * distrib:: Distribuciones de probabilidad. -* dynamics:: Gr@'aficas de sistemas din@'amicos y fractales. * eval_string:: Expresiones de Maxima en formato de cadena. * f90:: Traductor de Maxima fortran. * ggf:: Expresi@'on general de sucesiones. @@ -186,7 +185,6 @@ Fallos -* Introducci@'on a la detecci@'on e informe de fallos:: * Definiciones para la detecci@'on e informe de fallos:: Ayuda @@ -430,11 +428,6 @@ * Definiciones para distribuciones continuas:: * Definiciones para distribuciones discretas:: -dynamics - -* Introducci@'on a dynamics:: -* Definiciones para dynamics:: - eval_string * Definiciones para eval_string:: @@ -727,15 +720,11 @@ @chapter diag @include diag.texi -@node distrib, dynamics, diag, Top +@node distrib, eval_string, diag, Top @chapter distrib @include distrib.texi -@node dynamics, eval_string, distrib, Top -@chapter dynamics -@include dynamics.texi - -@node eval_string, f90, dynamics, Top +@node eval_string, f90, distrib, Top @chapter eval_string @include eval_string.texi Index: Constants.es.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/es/Constants.es.texi,v retrieving revision 1.4 retrieving revision 1.5 diff -u -d -r1.4 -r1.5 --- Constants.es.texi 17 Dec 2005 14:41:52 -0000 1.4 +++ Constants.es.texi 5 Nov 2006 21:00:48 -0000 1.5 @@ -1,4 +1,4 @@ -@c version 1.11 +@c version 1.13 @menu * Definiciones para Constantes:: @end menu @@ -7,31 +7,47 @@ @section Definiciones para Constantes @defvr {Constante} %e +@ifinfo +@vrindex e +@vrindex Base de los logaritmos naturales +@end ifinfo La base de los logaritmos naturales, @math{e}, se representa en Maxima como @code{%e}. @end defvr @defvr {Constante} false Constante l@'ogica para "falso". (NIL en Lisp) - @end defvr @defvr {Constante} inf +@ifinfo +@vrindex M@'as infinito +@end ifinfo M@'as infinito. @end defvr @defvr {Constante} infinity +@ifinfo +@vrindex Infinito complejo +@end ifinfo Infinito complejo. @end defvr @defvr {Constante} minf +@ifinfo +@vrindex Menos infinito +@vrindex Infinito negativo +@end ifinfo Menos infinito. @end defvr @defvr {Constante} %pi +@ifinfo +@vrindex pi +@end ifinfo El valor "pi" se representa en Maxima como @code{%pi}. @end defvr Index: Numerical.es.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/es/Numerical.es.texi,v retrieving revision 1.7 retrieving revision 1.8 diff -u -d -r1.7 -r1.8 --- Numerical.es.texi 22 Jan 2006 19:20:42 -0000 1.7 +++ Numerical.es.texi 5 Nov 2006 21:00:48 -0000 1.8 @@ -1,4 +1,4 @@ -@c version 1.21 +@c version 1.22 @menu * Introducci@'on a los m@'etodos num@'ericos:: * Series de Fourier:: @@ -301,6 +301,57 @@ @end defvr +@deffn {Funci@'on} newton (@var{expr}, @var{x}, @var{x_0}, @var{eps}) +Devuelve una soluci@'on aproximada de @code{@var{expr} = 0} obtenida +por el m@'etodo de Newton, considerando @var{expr} como una funci@'on +de una variable, @var{x}. +La b@'usqueda comienza con @code{@var{x} = @var{x_0}} y contin@'ua +hasta que se verifique @code{abs(@var{expr}) < @var{eps}}, donde +@var{expr} se eval@'ua con el valor actual de @var{x}. + +La funci@'on @code{newton} permite que en @var{expr} haya variables +no definidas, siempre y cuando la condici@'on de terminaci@'on +@code{abs(@var{expr}) < @var{eps}} pueda reducirse a un valor +l@'ogico @code{true} o @code{false}; de este modo, no es necesario +que @var{expr} tome un valor num@'erico. + +Ejec@'utese @code{load(newton1)} para cargar esta funci@'on. + +V@'eanse tambi@'en @code{realroots}, @code{allroots}, @code{find_root} y @code{mnewton}. + +Ejemplos: + +@c ===beg=== +@c load (newton1); +@c newton (cos (u), u, 1, 1/100); +@c ev (cos (u), u = %); +@c assume (a > 0); +@c newton (x^2 - a^2, x, a/2, a^2/100); +@c ev (x^2 - a^2, x = %); +@c ===end=== +@example +(%i1) load (newton1); +(%o1) /usr/share/maxima/5.10.0cvs/share/numeric/newton1.mac +(%i2) newton (cos (u), u, 1, 1/100); +(%o2) 1.570675277161251 +(%i3) ev (cos (u), u = %); +(%o3) 1.2104963335033528E-4 +(%i4) assume (a > 0); +(%o4) [a > 0] +(%i5) newton (x^2 - a^2, x, a/2, a^2/100); +(%o5) 1.00030487804878 a +(%i6) ev (x^2 - a^2, x = %); + 2 +(%o6) 6.098490481853958E-4 a +@end example + +@end deffn + + + + + + @node Definiciones para las series de Fourier, , Definiciones para los m@'etodos num@'ericos, M@'etodos num@'ericos @section Definiciones para las series de Fourier Index: Operators.es.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/es/Operators.es.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Operators.es.texi 28 Jul 2006 06:52:16 -0000 1.9 +++ Operators.es.texi 5 Nov 2006 21:00:48 -0000 1.10 @@ -1,4 +1,4 @@ -@c english version 1.31 +@c english version 1.34 @menu * n-arios:: * no-fijos:: @@ -135,6 +135,9 @@ @end deffn @deffn {Operador} !! +@ifinfo +@fnindex Doble factorial +@end ifinfo El operador doble factorial. Para un n@'umero entero, de punto flotante o racional @code{n}, @@ -155,6 +158,9 @@ @end deffn @deffn {Operador} # +@ifinfo +@fnindex Negaci@'on de la igualdad sint@'actica +@end ifinfo Representa la negaci@'on de la igualdad sint@'actica @code{=}. N@'otese que debido a las reglas de evaluaci@'on de expresiones @@ -191,6 +197,9 @@ @end deffn @deffn {Operador} . +@ifinfo +@fnindex Multiplicaci@'on no conmutativa +@end ifinfo El operador punto, para multiplicaci@'on de matrices (no-conmutativo). Cuando "." se usa de esta forma, se dejar@'an espacios a ambos lados de @'este, como en @code{A . B}. As@'{@dotless{i}} se evita que se confunda con el punto decimal de los n@'umeros. @@ -211,10 +220,16 @@ @end deffn @deffn {Operador} : +@ifinfo +@fnindex Operador de asignaci@'on +@end ifinfo El operador de asignaci@'on. Por ejemplo, @code{A:3} se asigna a la variable @var{A} el valor de 3. @end deffn @deffn {Operador} :: +@ifinfo +@fnindex Operador de asignaci@'on (eval@'ua el miembro izquierdo) +@end ifinfo Operador de asignaci@'on. :: asigna el valor de una expresi@'on en su derecha a el valor de la cantidad en su izquierda, la cual debe evaluarse a una variable de tipo at@'omica o una variable subindicada. @@ -222,6 +237,9 @@ @end deffn @deffn {Operador} ::= +@ifinfo +@fnindex Operador de definici@'on de funciones macro +@end ifinfo El operador de definici@'on de macros @code{::=} define una funci@'on (llamada macro por razones hist@'oricas) que no eval@'ua sus argumentos, siendo la expresi@'on que retorna (llamada "macroexpansi@'on") evaluada dentro del contexto desde el cual se ha invocado la macro. En cualquier otro sentido, una funci@'on macro es igual que una funci@'on ordinaria. @code{macroexpand} devuelve la expresi@'on que a su vez fue devuelta por una macro (sin evaluar la expresi@'on); @@ -325,12 +343,19 @@ @end deffn @deffn {Operador} := +@ifinfo +@fnindex Operador de definici@'on de funciones +@end ifinfo El operador de definici@'on de funciones. Por ejemplo, @code{f(x):=sin(x)} define una funci@'on @code{f}. @end deffn @deffn {Operador} = +@ifinfo +@fnindex Operador de ecuaci@'on +@fnindex Igualdad sint@'actica +@end ifinfo Operador de ecuaci@'on. La expresi@'on @code{@var{a} = @var{b}} representa una ecuaci@'on @@ -467,7 +492,40 @@ @end deffn + + +@deffn {Operador} and +@ifinfo +@fnindex Conjunci@'on l@'ogica +@end ifinfo +Operador de conjunci@'on l@'ogica. +El operador @code{and} es un operador infijo @code{n}-ario; +sus operandos son expresiones booleanas y su resultado es un valor l@'ogico. + +El operador @code{and} impone la evaluaci@'on (igual que @code{is}) de uno o m@'as operandos, +y puede forzar la evaluaci@'on de todos los operandos. + +Los operandos se eval@'uan en el orden en el que aparecen; +s@'olo eval@'ua tantos operandos como sean necesarios para determinar el resultado. +Si alg@'un operando vale @code{false}, +el resultado es @code{false} y ya no se eval@'uan m@'as operandos. + +La variable global @code{prederror} controla el comportamiento de @code{and} +cuando la evaluaci@'on de un operando no da como resultado @code{true} o @code{false}; +@code{and} imprime un mensaje de error cuando @code{prederror} vale @code{true}. +En caso contrario, @code{and} devuelve @code{unknown}. + +El operador @code{and} no es conmutativo: +@code{a and b} puede no ser igual a @code{b and a} debido al tratamiento de operandos indeterminados. + +@end deffn + + + @deffn {Operador} or +@ifinfo +@fnindex Disyunci@'on l@'ogica +@end ifinfo Operador de disyunci@'on l@'ogica. El operador @code{or} es un operador infijo @code{n}-ario; sus operandos son expresiones booleanas y su resultado es un valor l@'ogico. @@ -477,13 +535,16 @@ Los operandos se eval@'uan en el orden en el que aparecen; @code{or} s@'olo eval@'ua tantos operandos como sean necesarios para determinar el resultado. Si un operando vale @code{true}, el resultado es @code{true} y ya no se eval@'uan m@'as operandos. La variable global @code{prederror} controla el comportamiento de @code{or} cuando la evaluaci@'on de un operando no da como resultado @code{true} o @code{false}; @code{or} imprime un mensaje de error cuando @code{prederror} vale @code{true}. -En caso contrario, @code{and} devuelve @code{unknown}. +En caso contrario, @code{or} devuelve @code{unknown}. El operador @code{or} no es conmutativo: @code{a or b} puede no ser igual a @code{b or a} debido al tratamiento de operandos indeterminados. @end deffn @deffn {Operador} not +@ifinfo +@fnindex Negaci@'on l@'ogica +@end ifinfo Operador de negaci@'on l@'ogica. El operador @code{not} es un operador prefijo; su operando es una expresi@'on booleana y su resultado es un valor l@'ogico. |
Update of /cvsroot/maxima/maxima/doc/info/it In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv22749 Added Files: Affine.texi Arrays.texi Atensor.texi Bugs.texi Command.texi Constants.texi Contexts.texi Ctensor.texi Debugging.texi Differential.texi Differentiation.texi Elliptic.texi Equations.texi Expressions.texi Floating.texi Function.texi Groups.texi Help.texi Indices.texi Input.texi Integration.texi Introduction.texi Itensor.texi Limits.texi Lists.texi Logarithms.texi Matrices.texi Miscellaneous.texi Number.texi Numerical.texi Operators.texi Plotting.texi Polynomials.texi Program.texi Rules.texi Runtime.texi Series.texi Simplification.texi Special.texi Statistics.texi Symmetries.texi Trigonometric.texi augmented_lagrangian.texi bode.texi cholesky.texi descriptive.texi diag.texi distrib.texi dynamics.texi eval_string.texi f90.texi ggf.texi impdiff.texi interpol.texi lindstedt.texi linearalgebra.texi lsquares.texi makeOrders.texi maxima.texi mnewton.texi nset.texi numericalio.texi opsubst.texi orthopoly.texi plotdf.texi simplex.texi simplifications.texi solve_rec.texi stirling.texi stringproc.texi unit.texi zeilberger.texi Log Message: Create stubs for Italian translation. These .texi files have the @menu, @node, @section, @deffn, and @defvr tags but all of the text is cut out by processing each English .texi file with the following awk script: /^@menu/ {in_menu=1;} /^@end menu/ {in_menu=0; print; print "";} /^@node/ || /^@deffn/ || /^@defvr/ {print;} /^@section/{print; print "";} /^@end deffn/ || /^@end defvr/ {print "THIS ITEM NEEDS TO BE TRANSLATED."; print; print "";} !/^@node/ && !/^@section/ && !/^@deffn/ && !/^@defvr/ && !/^@end deffn/ && !/^@end defvr/ {if (in_menu) print;} The idea here is that all of the structure and none of the text is preserved, so that will hopefully make it easier to create the translation. ``makeinfo maxima'' successfully creates maxima.info with these files. --- NEW FILE: Affine.texi --- @menu * Definitions for Affine:: @end menu @node Definitions for Affine, , Affine, Affine @section Definitions for Affine @deffn {Function} fast_linsolve ([@var{expr_1}, ..., @var{expr_m}], [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} grobner_basis ([@var{expr_1}, ..., @var{expr_m}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} set_up_dot_simplifications (@var{eqns}, @var{check_through_degree}) @deffnx {Function} set_up_dot_simplifications (@var{eqns}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} declare_weight (@var{x_1}, @var{w_1}, ..., @var{x_n}, @var{w_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nc_degree (@var{p}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dotsimp (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} fast_central_elements ([@var{x_1}, ..., @var{x_n}], @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} check_overlaps (@var{n}, @var{add_to_simps}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} mono ([@var{x_1}, ..., @var{x_n}], @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} monomial_dimensions (@var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} extract_linear_equations ([@var{p_1}, ..., @var{p_n}], [@var{m_1}, ..., @var{m_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} list_nc_monomials ([@var{p_1}, ..., @var{p_n}]) @deffnx {Function} list_nc_monomials (@var{p}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} all_dotsimp_denoms THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Arrays.texi --- @menu * Definitions for Arrays:: @end menu @node Definitions for Arrays, , Arrays, Arrays @section Definitions for Arrays @deffn {Function} array (@var{name}, @var{dim_1}, ..., @var{dim_n}) @deffnx {Function} array (@var{name}, @var{type}, @var{dim_1}, ..., @var{dim_n}) @deffnx {Function} array ([@var{name_1}, ..., @var{name_m}], @var{dim_1}, ..., @var{dim_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} arrayapply (@var{A}, [@var{i_1}, ..., @var{i_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} arrayinfo (@var{A}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} arraymake (@var{name}, [@var{i_1}, ..., @var{i_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} arrays THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} bashindices (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} fillarray (@var{A}, @var{B}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} listarray (@var{A}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} make_array (@var{type}, @var{dim_1}, ..., @var{dim_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rearray (@var{A}, @var{dim_1}, ..., @var{dim_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} remarray (@var{A_1}, ..., @var{A_n}) @deffnx {Function} remarray (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} subvar (@var{x}, @var{i}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} use_fast_arrays THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Atensor.texi --- @menu * Introduction to atensor:: * Definitions for atensor:: @end menu @node Introduction to atensor, Definitions for atensor, atensor, atensor @section Introduction to atensor @node Definitions for atensor, , Introduction to atensor, atensor @section Definitions for atensor @deffn {Function} init_atensor (@var{alg_type}, @var{opt_dims}) @deffnx {Function} init_atensor (@var{alg_type}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} atensimp (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} alg_type THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Variable} adim THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} aform THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} asymbol THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} sf (@var{u}, @var{v}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} af (@var{u}, @var{v}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} av (@var{u}, @var{v}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} abasep (@var{v}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Bugs.texi --- @menu * Definitions for Bug Detection and Reporting:: @end menu @node Definitions for Bug Detection and Reporting @section Definitions for Bug Detection and Reporting @deffn {Function} run_testsuite () @deffnx {Function} run_testsuite (@var{boolean}) @deffnx {Function} run_testsuite (@var{boolean}, @var{boolean}) @deffnx {Function} run_testsuite (@var{boolean}, @var{boolean}, @var{list}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} testsuite_files THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} bug_report () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} build_info () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Command.texi --- @menu * Introduction to Command Line:: * Definitions for Command Line:: @end menu @node Introduction to Command Line, Definitions for Command Line, Command Line, Command Line @section Introduction to Command Line @deffn {Operator} ' THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Operator} '' THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @node Definitions for Command Line, , Introduction to Command Line, Command Line @section Definitions for Command Line @deffn {Function} alias (@var{new_name_1}, @var{old_name_1}, ..., @var{new_name_n}, @var{old_name_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} debugmode THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ev (@var{expr}, @var{arg_1}, ..., @var{arg_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Property} evflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Property} evfun THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} infeval THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} kill (@var{a_1}, ..., @var{a_n}) @deffnx {Function} kill (labels) @deffnx {Function} kill (inlabels, outlabels, linelabels) @deffnx {Function} kill (@var{n}) @deffnx {Function} kill ([@var{m}, @var{n}]) @deffnx {Function} kill (values, functions, arrays, ...) @deffnx {Function} kill (all) @deffnx {Function} kill (allbut (@var{a_1}, ..., @var{a_n})) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} labels (@var{symbol}) @deffnx {System variable} labels THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} linenum THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} myoptions THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} nolabels THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} optionset THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} playback () @deffnx {Function} playback (@var{n}) @deffnx {Function} playback ([@var{m}, @var{n}]) @deffnx {Function} playback ([@var{m}]) @deffnx {Function} playback (input) @deffnx {Function} playback (slow) @deffnx {Function} playback (time) @deffnx {Function} playback (grind) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} printprops (@var{a}, @var{i}) @deffnx {Function} printprops ([@var{a_1}, ..., @var{a_n}], @var{i}) @deffnx {Function} printprops (all, @var{i}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} prompt THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} quit () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} remfunction (@var{f_1}, ..., @var{f_n}) @deffnx {Function} remfunction (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} reset () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} showtime THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} sstatus (@var{feature}, @var{package}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} to_lisp () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} values THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Constants.texi --- @menu * Definitions for Constants:: @end menu @node Definitions for Constants, , Constants, Constants @section Definitions for Constants @defvr {Constant} %e THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} false THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} inf THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} infinity THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} minf THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} %pi THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Constant} true THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Contexts.texi --- @menu * Definitions for Contexts:: @end menu @node Definitions for Contexts, , Contexts, Contexts @section Definitions for Contexts @deffn {Function} activate (@var{context_1}, ..., @var{context_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} activecontexts THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} assume (@var{pred_1}, ..., @var{pred_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} assumescalar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} assume_pos THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} assume_pos_pred THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} context THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} contexts THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} deactivate (@var{context_1}, ..., @var{context_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} facts (@var{item}) @deffnx {Function} facts () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Declaration} features THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} forget (@var{pred_1}, ..., @var{pred_n}) @deffnx {Function} forget (@var{L}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} killcontext (@var{context_1}, ..., @var{context_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} newcontext (@var{name}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} supcontext (@var{name}, @var{context}) @deffnx {Function} supcontext (@var{name}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Ctensor.texi --- @menu * Introduction to ctensor:: * Definitions for ctensor:: @end menu @node Introduction to ctensor, Definitions for ctensor, ctensor, ctensor @section Introduction to ctensor @node Definitions for ctensor, , Introduction to ctensor, ctensor @section Definitions for ctensor @deffn {Function} csetup () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} cmetric (@var{dis}) @deffnx {Function} cmetric () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ct_coordsys (@var{coordinate_system}, @var{extra_arg}) @deffnx {Function} ct_coordsys (@var{coordinate_system}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} init_ctensor () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} christof (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ricci (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} uricci (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} scurvature () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} einstein (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} leinstein (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} riemann (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lriemann (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} uriemann (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rinvariant () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} weyl (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ctaylor () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} frame_bracket (@var{fr}, @var{fri}, @var{diagframe}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nptetrad () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} psi (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} petrov () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} contortion (@var{tr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nonmetricity (@var{nm}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ctransform (@var{M}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} findde (@var{A}, @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} cograd () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} contragrad () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dscalar () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} checkdiv () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} cgeodesic (@var{dis}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} bdvac (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} invariant1 () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} invariant2 () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} bimetric () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} diagmatrixp (@var{M}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} symmetricp (@var{M}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ntermst (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} cdisplay (@var{ten}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} deleten (@var{L}, @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} dim THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} diagmetric THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctrgsimp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} cframe_flag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctorsion_flag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} cnonmet_flag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctayswitch THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctayvar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctaypov THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ctaypt THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} gdet THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ratchristof THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} rateinstein THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ratriemann THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ratweyl THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} lfg THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} ufg THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} riem THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} lriem THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} uriem THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} ric THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} uric THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} lg THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} ug THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} weyl THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} fb THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} kinvariant THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} np THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} npi THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} tr THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} kt THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} nm THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Variable} nmc THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} tensorkill THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} ct_coords THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Debugging.texi --- @menu * Source Level Debugging:: * Keyword Commands:: * Definitions for Debugging:: @end menu @node Source Level Debugging, Keyword Commands, , Debugging @section Source Level Debugging @node Keyword Commands, Definitions for Debugging, Source Level Debugging, Debugging @section Keyword Commands @node Definitions for Debugging, , Keyword Commands, Debugging @section Definitions for Debugging @defvr {Option variable} refcheck THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} setcheck THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} setcheckbreak THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} setval THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} timer (@var{f_1}, ..., @var{f_n}) @deffnx {Function} timer () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} untimer (@var{f_1}, ..., @var{f_n}) @deffnx {Function} untimer () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} timer_devalue THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} timer_info (@var{f_1}, ..., @var{f_n}) @deffnx {Function} timer_info () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} trace (@var{f_1}, ..., @var{f_n}) @deffnx {Function} trace () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} trace_options (@var{f}, @var{option_1}, ..., @var{option_n}) @deffnx {Function} trace_options (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} untrace (@var{f_1}, ..., @var{f_n}) @deffnx {Function} untrace () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Differential.texi --- @menu * Definitions for Differential Equations:: @end menu @node Definitions for Differential Equations, , Differential Equations, Differential Equations @section Definitions for Differential Equations @deffn {Function} bc2 (@var{solution}, @var{xval1}, @var{yval1}, @var{xval2}, @var{yval2}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} desolve (@var{eqn}, @var{x}) @deffnx {Function} desolve ([@var{eqn_1}, ..., @var{eqn_n}], [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ic1 (@var{solution}, @var{xval}, @var{yval}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ic2 (@var{solution}, @var{xval}, @var{yval}, @var{dval}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ode2 (@var{eqn}, @var{dvar}, @var{ivar}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Differentiation.texi --- @menu * Definitions for Differentiation:: @end menu @node Definitions for Differentiation, , Differentiation, Differentiation @section Definitions for Differentiation @deffn {Function} antid (@var{expr}, @var{x}, @var{u(x)}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} antidiff (@var{expr}, @var{x}, @var{u}(@var{x})) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Property} atomgrad THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} atvalue (@var{expr}, [@var{x_1} = @var{a_1}, ..., @var{x_m} = @var{a_m}], @var{c}) @deffnx {Function} atvalue (@var{expr}, @var{x_1} = @var{a_1}, @var{c}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} cartan - THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} del (@var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} delta (@var{t}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} dependencies THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} depends (@var{f_1}, @var{x_1}, ..., @var{f_n}, @var{x_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} derivabbrev THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} derivdegree (@var{expr}, @var{y}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} derivlist (@var{var_1}, ..., @var{var_k}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} derivsubst THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} diff (@var{expr}, @var{x_1}, @var{n_1}, ..., @var{x_m}, @var{n_m}) @deffnx {Function} diff (@var{expr}, @var{x}, @var{n}) @deffnx {Function} diff (@var{expr}, @var{x}) @deffnx {Function} diff (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Special symbol} diff THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} dscalar (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} express (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} gradef (@var{f}(@var{x_1}, ..., @var{x_n}), @var{g_1}, ..., @var{g_m}) @deffnx {Function} gradef (@var{a}, @var{x}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} gradefs THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} laplace (@var{expr}, @var{t}, @var{s}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Elliptic.texi --- @menu * Introduction to Elliptic Functions and Integrals:: * Definitions for Elliptic Functions:: * Definitions for Elliptic Integrals:: @end menu @node Introduction to Elliptic Functions and Integrals, Definitions for Elliptic Functions, , top @section Introduction to Elliptic Functions and Integrals @node Definitions for Elliptic Functions, Definitions for Elliptic Integrals, Introduction to Elliptic Functions and Integrals, top @section Definitions for Elliptic Functions @deffn {Function} jacobi_sn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_cn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_dn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_ns (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_sc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_sd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_nc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_cs (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_cd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_nd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_ds (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} jacobi_dc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_sn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_cn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_dn (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_ns (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_sc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_sd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_nc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_cs (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_cd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_nd (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_ds (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} inverse_jacobi_dc (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @node Definitions for Elliptic Integrals, , Definitions for Elliptic Functions, top @section Definitions for Elliptic Integrals @deffn {Function} elliptic_f (@var{phi}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} elliptic_e (@var{phi}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} elliptic_eu (@var{u}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} elliptic_pi (@var{n}, @var{phi}, @var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} elliptic_kc (@var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} elliptic_ec (@var{m}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Equations.texi --- @menu * Definitions for Equations:: @end menu @node Definitions for Equations, , Equations, Equations @section Definitions for Equations @defvr {System variable} %rnum_list THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} algexact THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} algsys ([@var{expr_1}, ..., @var{expr_m}], [@var{x_1}, ..., @var{x_n}]) @deffnx {Function} algsys ([@var{eqn_1}, ..., @var{eqn_m}], [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} allroots (@var{expr}) @deffnx {Function} allroots (@var{eqn}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} backsubst THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} breakup THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} dimension (@var{eqn}) @deffnx {Function} dimension (@var{eqn_1}, ..., @var{eqn_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} dispflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} funcsolve (@var{eqn}, @var{g}(@var{t})) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} globalsolve THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ieqn (@var{ie}, @var{unk}, @var{tech}, @var{n}, @var{guess}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} ieqnprint THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} lhs (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} linsolve ([@var{expr_1}, ..., @var{expr_m}], [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} linsolvewarn THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} linsolve_params THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} multiplicities THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} nroots (@var{p}, @var{low}, @var{high}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nthroot (@var{p}, @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} programmode THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} realonly THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} realroots (@var{expr}, @var{bound}) @deffnx {Function} realroots (@var{eqn}, @var{bound}) @deffnx {Function} realroots (@var{expr}) @deffnx {Function} realroots (@var{eqn}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rhs (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} rootsconmode THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} rootscontract (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} rootsepsilon THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} solve (@var{expr}, @var{x}) @deffnx {Function} solve (@var{expr}) @deffnx {Function} solve ([@var{eqn_1}, ..., @var{eqn_n}], [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} solvedecomposes THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solveexplicit THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solvefactors THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solvenullwarn THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solveradcan THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solvetrigwarn THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} solve_inconsistent_error THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Expressions.texi --- @menu * Introduction to Expressions:: * Assignment:: * Complex:: * Nouns and Verbs:: * Identifiers:: * Strings:: * Inequality:: * Syntax:: * Definitions for Expressions:: @end menu @node Introduction to Expressions, Assignment, Expressions, Expressions @section Introduction to Expressions @node Assignment, Complex, Introduction to Expressions, Expressions @section Assignment @node Complex, Nouns and Verbs, Assignment, Expressions @section Complex @node Nouns and Verbs, Identifiers, Complex, Expressions @section Nouns and Verbs @node Identifiers, Strings, Nouns and Verbs, Expressions @section Identifiers @node Strings, Inequality, Identifiers, Expressions @section Strings @node Inequality, Syntax, Strings, Expressions @section Inequality @node Syntax, Definitions for Expressions, Inequality, Expressions @section Syntax @node Definitions for Expressions, , Syntax, Expressions @section Definitions for Expressions @deffn {Function} at (@var{expr}, [@var{eqn_1}, ..., @var{eqn_n}]) @deffnx {Function} at (@var{expr}, @var{eqn}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} box (@var{expr}) @deffnx {Function} box (@var{expr}, @var{a}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} boxchar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} carg (@var{z}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Special operator} constant THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} constantp (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} declare (@var{a_1}, @var{p_1}, @var{a_2}, @var{p_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} disolate (@var{expr}, @var{x_1}, ..., @var{x_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dispform (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} distrib (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dpart (@var{expr}, @var{n_1}, ..., @var{n_k}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} exp (@var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} %emode THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} %enumer THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} exptisolate THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} exptsubst THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} freeof (@var{x_1}, ..., @var{x_n}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} genfact (@var{x}, @var{y}, @var{z}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} imagpart (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} infix (@var{op}) @deffnx {Function} infix (@var{op}, @var{lbp}, @var{rbp}) @deffnx {Function} infix (@var{op}, @var{lbp}, @var{rbp}, @var{lpos}, @var{rpos}, @var{pos}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} inflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} inpart (@var{expr}, @var{n_1}, ..., @var{n_k}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} isolate (@var{expr}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} isolate_wrt_times THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} listconstvars THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} listdummyvars THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} listofvars (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lfreeof (@var{list}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lopow (@var{expr}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lpart (@var{label}, @var{expr}, @var{n_1}, ..., @var{n_k}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} multthru (@var{expr}) @deffnx {Function} multthru (@var{expr_1}, @var{expr_2}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nounify (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} nterms (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} op (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} operatorp (@var{expr}, @var{op}) @deffnx {Function} operatorp (@var{expr}, [@var{op_1}, ..., @var{op_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} optimize (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} optimprefix THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ordergreat (@var{v_1}, ..., @var{v_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ordergreatp (@var{expr_1}, @var{expr_2}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} orderless (@var{v_1}, ..., @var{v_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} orderlessp (@var{expr_1}, @var{expr_2}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} part (@var{expr}, @var{n_1}, ..., @var{n_k}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} partition (@var{expr}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} partswitch THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} pickapart (@var{expr}, @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} piece THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} polarform (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} powers (@var{expr}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} product (@var{expr}, @var{i}, @var{i_0}, @var{i_1}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} realpart (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rectform (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rembox (@var{expr}, unlabelled) @deffnx {Function} rembox (@var{expr}, @var{label}) @deffnx {Function} rembox (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} sum (@var{expr}, @var{i}, @var{i_0}, @var{i_1}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lsum (@var{expr}, @var{x}, @var{L}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} verbify (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Floating.texi --- @menu * Definitions for Floating Point:: @end menu @node Definitions for Floating Point, , Floating Point, Floating Point @section Definitions for Floating Point @deffn {Function} bffac (@var{expr}, @var{n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} algepsilon THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} bfloat (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} bfloatp (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} bfpsi (@var{n}, @var{z}, @var{fpprec}) @deffnx {Function} bfpsi0 (@var{z}, @var{fpprec}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} bftorat THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} bftrunc THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} cbffac (@var{z}, @var{fpprec}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} float (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} float2bf THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} floatnump (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} fpprec THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} fpprintprec THIS ITEM NEEDS TO BE TRANSLATED. @end defvr --- NEW FILE: Function.texi --- @menu * Introduction to Function Definition:: * Function:: * Macros:: * Definitions for Function Definition:: @end menu @node Introduction to Function Definition, Function, Function Definition, Function Definition @section Introduction to Function Definition @node Function, Macros, Introduction to Function Definition, Function Definition @section Function @node Macros, Definitions for Function Definition, Function, Function Definition @section Macros @deffn {Function} buildq (@var{L}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} macroexpand (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} macroexpand1 (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Global variable} macros THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} splice (@var{a}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @node Definitions for Function Definition, , Macros, Function Definition @section Definitions for Function Definition @deffn {Function} apply (@var{F}, [@var{x_1}, ..., @var{x_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} block ([@var{v_1}, ..., @var{v_m}], @var{expr_1}, ..., @var{expr_n}) @deffnx {Function} block (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} break (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} catch (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} compfile (@var{filename}, @var{f_1}, ..., @var{f_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} compile (@var{f_1}, ..., @var{f_n}) @deffnx {Function} compile (functions) @deffnx {Function} compile (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} define (@var{f}(@var{x_1}, ..., @var{x_n}), @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} define_variable (@var{name}, @var{default_value}, @var{mode}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dispfun (@var{f_1}, ..., @var{f_n}) @deffnx {Function} dispfun (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} functions THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} fundef (@var{f}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} funmake (@var{F}, [@var{arg_1}, ..., @var{arg_n}]) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} lambda ([@var{x_1}, ..., @var{x_m}], @var{expr_1}, ..., @var{expr_n}) @deffnx {Function} lambda ([[@var{L}]], @var{expr_1}, ..., @var{expr_n}) @deffnx {Function} lambda ([@var{x_1}, ..., @var{x_m}, [@var{L}]], @var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} local (@var{v_1}, ..., @var{v_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} macroexpansion THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} mode_checkp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} mode_check_errorp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} mode_check_warnp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} mode_declare (@var{y_1}, @var{mode_1}, ..., @var{y_n}, @var{mode_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} mode_identity (@var{arg_1}, @var{arg_2}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} transcompile THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} translate (@var{f_1}, ..., @var{f_n}) @deffnx {Function} translate (functions) @deffnx {Function} translate (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} translate_file (@var{maxima_filename}) @deffnx {Function} translate_file (@var{maxima_filename}, @var{lisp_filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} transrun THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_array_as_ref THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_bound_function_applyp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_file_tty_messagesp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_float_can_branch_complex THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_function_call_default THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_numer THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_optimize_max_loop THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_semicompile THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} tr_state_vars THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} tr_warnings_get () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} tr_warn_bad_function_calls THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_warn_fexpr THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_warn_meval THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_warn_mode THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_warn_undeclared THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_warn_undefined_variable THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} tr_windy THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} compile_file (@var{filename}) @deffnx {Function} compile_file (@var{filename}, @var{compiled_filename}) @deffnx {Function} compile_file (@var{filename}, @var{compiled_filename}, @var{lisp_filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} declare_translated (@var{f_1}, @var{f_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Groups.texi --- @menu * Definitions for Groups:: @end menu @node Definitions for Groups, , Groups, Groups @section Definitions for Groups @deffn {Function} todd_coxeter (@var{relations}, @var{subgroup}) @deffnx {Function} todd_coxeter (@var{relations}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Help.texi --- @menu * Introduction to Help:: * Lisp and Maxima:: * Garbage Collection:: * Documentation:: * Definitions for Help:: @end menu @node Introduction to Help, Lisp and Maxima, Help, Help @section Introduction to Help @node Lisp and Maxima, Garbage Collection, Introduction to Help, Help @section Lisp and Maxima @node Garbage Collection, Documentation, Lisp and Maxima, Help @section Garbage Collection @node Documentation, Definitions for Help, Garbage Collection, Help @section Documentation @node Definitions for Help, , Documentation, Help @section Definitions for Help @deffn {Function} demo (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} describe (@var{string}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} example (@var{topic}) @deffnx {Function} example () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Indices.texi --- --- NEW FILE: Input.texi --- @menu * Introduction to Input and Output:: * Comments:: * Files:: * Definitions for Input and Output:: @end menu @node Introduction to Input and Output, Comments, Input and Output, Input and Output @section Introduction to Input and Output @node Comments, Files, Introduction to Input and Output, Input and Output @section Comments @node Files, Definitions for Input and Output, Comments, Input and Output @section Files @node Definitions for Input and Output, , Files, Input and Output @section Definitions for Input and Output @defvr {System variable} __ THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} _ THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} % THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {System variable} %% THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} %edispflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} %th (@var{i}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Special symbol} ? THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} absboxchar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} file_output_append THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} appendfile (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} batch (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} batchload (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} closefile () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} collapse (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} concat (@var{arg_1}, @var{arg_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} sconcat (@var{arg_1}, @var{arg_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} disp (@var{expr_1}, @var{expr_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dispcon (@var{tensor_1}, @var{tensor_2}, ...) @deffnx {Function} dispcon (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} display (@var{expr_1}, @var{expr_2}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} display2d THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} display_format_internal THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} dispterms (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} error_size THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} error_syms THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} expt (@var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} exptdispflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} filename_merge (@var{path}, @var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} file_search (@var{filename}) @deffnx {Function} file_search (@var{filename}, @var{pathlist}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} file_search_maxima @defvrx {Option variable} file_search_lisp @defvrx {Option variable} file_search_demo THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} file_type (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} grind (@var{expr}) @deffnx {Option variable} grind THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} ibase THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} inchar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ldisp (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ldisplay (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} linechar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} linel THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} lispdisp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} load (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} loadfile (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} loadprint THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} obase THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} outchar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} packagefile THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} pfeformat THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} print (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} tcl_output (@var{list}, @var{i0}, @var{skip}) @deffnx {Function} tcl_output (@var{list}, @var{i0}) @deffnx {Function} tcl_output ([@var{list_1}, ..., @var{list_n}], @var{i}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} read (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} readonly (@var{expr_1}, ..., @var{expr_n}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} reveal (@var{expr}, @var{depth}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} rmxchar THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} save (@var{filename}, @var{name_1}, @var{name_2}, @var{name_3}, ...) @deffnx {Function} save (@var{filename}, values, functions, labels, ...) @deffnx {Function} save (@var{filename}, [@var{m}, @var{n}]) @deffnx {Function} save (@var{filename}, @var{name_1}=@var{expr_1}, ...) @deffnx {Function} save (@var{filename}, all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} savedef THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} show (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} showratvars (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} stardisp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} string (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Lisp variable} stringdisp THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} stringout (@var{filename}, @var{expr_1}, @var{expr_2}, @var{expr_3}, ...) @deffnx {Function} stringout (@var{filename}, [@var{m}, @var{n}]) @deffnx {Function} stringout (@var{filename}, input) @deffnx {Function} stringout (@var{filename}, functions) @deffnx {Function} stringout (@var{filename}, values) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} tex (@var{expr}) @deffnx {Function} tex (@var{label}) @deffnx {Function} tex (@var{expr}, @var{filename}) @deffnx {Function} tex (@var{label}, @var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} texput (@var{a}, @var{s}) @deffnx {Function} texput (@var{a}, @var{s}, @var{operator_type}) @deffnx {Function} texput (@var{a}, [@var{s_1}, @var{s_2}], matchfix) @deffnx {Function} texput (@var{a}, [@var{s_1}, @var{s_2}, @var{s_3}], matchfix) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} system (@var{command}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} ttyoff THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} with_stdout (@var{filename}, @var{expr_1}, @var{expr_2}, @var{expr_3}, ...) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} writefile (@var{filename}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Integration.texi --- @menu * Introduction to Integration:: * Definitions for Integration:: * Introduction to QUADPACK:: * Definitions for QUADPACK:: @end menu @node Introduction to Integration, Definitions for Integration, Integration, Integration @section Introduction to Integration @node Definitions for Integration, Introduction to QUADPACK, Introduction to Integration, Integration @section Definitions for Integration @deffn {Function} changevar (@var{expr}, @var{f(x,y)}, @var{y}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} dblint (@var{f}, @var{r}, @var{s}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} defint (@var{expr}, @var{x}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} erf (@var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} erfflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ilt (@var{expr}, @var{t}, @var{s}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} integrate (@var{expr}, @var{x}) @deffnx {Function} integrate (@var{expr}, @var{x}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {System variable} integration_constant_counter THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} integrate_use_rootsof THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} ldefint (@var{expr}, @var{x}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} potential (@var{givengradient}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} qq THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quanc8 (@var{expr}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} residue (@var{expr}, @var{z}, @var{z_0}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} risch (@var{expr}, @var{x}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} romberg (@var{expr}, @var{x}, @var{a}, @var{b}) @deffnx {Function} romberg (@var{expr}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} rombergabs THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} rombergit THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} rombergmin THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} rombergtol THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} tldefint (@var{expr}, @var{x}, @var{a}, @var{b}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @node Introduction to QUADPACK, Definitions for QUADPACK, Definitions for Integration, Integration @section Introduction to QUADPACK @node Definitions for QUADPACK, , Introduction to QUADPACK, Integration @section Definitions for QUADPACK @deffn {Function} quad_qag (@var{f(x)}, @var{x}, @var{a}, @var{b}, @var{key}, @var{epsrel}, @var{limit}) @deffnx {Function} quad_qag (@var{f}, @var{x}, @var{a}, @var{b}, @var{key}, @var{epsrel}, @var{limit}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qags (@var{f(x)}, @var{x}, @var{a}, @var{b}, @var{epsrel}, @var{limit}) @deffnx {Function} quad_qags (@var{f}, @var{x}, @var{a}, @var{b}, @var{epsrel}, @var{limit}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qagi (@var{f(x)}, @var{x}, @var{a}, @var{inftype}, @var{epsrel}, @var{limit}) @deffnx {Function} quad_qagi (@var{f}, @var{x}, @var{a}, @var{inftype}, @var{epsrel}, @var{limit}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qawc (@var{f(x)}, @var{x}, @var{c}, @var{a}, @var{b}, @var{epsrel}, @var{limit}) @deffnx {Function} quad_qawc (@var{f}, @var{x}, @var{c}, @var{a}, @var{b}, @var{epsrel}, @var{limit}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qawf (@var{f(x)}, @var{x}, @var{a}, @var{omega}, @var{trig}, @var{epsabs}, @var{limit}, @var{maxp1}, @var{limlst}) @deffnx {Function} quad_qawf (@var{f}, @var{x}, @var{a}, @var{omega}, @var{trig}, @var{epsabs}, @var{limit}, @var{maxp1}, @var{limlst}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qawo (@var{f(x)}, @var{x}, @var{a}, @var{b}, @var{omega}, @var{trig}, @var{epsabs}, @var{limit}, @var{maxp1}, @var{limlst}) @deffnx {Function} quad_qawo (@var{f}, @var{x}, @var{a}, @var{b}, @var{omega}, @var{trig}, @var{epsabs}, @var{limit}, @var{maxp1}, @var{limlst}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} quad_qaws (@var{f(x)}, @var{x}, @var{a}, @var{b}, @var{alpha}, @var{beta}, @var{wfun}, @var{epsabs}, @var{limit}) @deffnx {Function} quad_qaws (@var{f}, @var{x}, @var{a}, @var{b}, @var{alpha}, @var{beta}, @var{wfun}, @var{epsabs}, @var{limit}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn --- NEW FILE: Introduction.texi --- --- NEW FILE: Itensor.texi --- @menu * Introduction to itensor:: * Definitions for itensor:: @end menu @node Introduction to itensor, Definitions for itensor, itensor, itensor @section Introduction to itensor @node Definitions for itensor, , Introduction to itensor, itensor @section Definitions for itensor @deffn {Function} entertensor (@var{name}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} changename (@var{old}, @var{new}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} listoftens THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} ishow (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} indices (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} rename (@var{expr}) @deffnx {Function} rename (@var{expr}, @var{count}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} flipflag THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @deffn {Function} defcon (@var{tensor_1}) @deffnx {Function} defcon (@var{tensor_1}, @var{tensor_2}, @var{tensor_3}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} remcon (@var{tensor_1}, ..., @var{tensor_n}) @deffnx {Function} remcon (all) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} contract (@var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} indexed_tensor (@var{tensor}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} components (@var{tensor}, @var{expr}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} remcomps (@var{tensor}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} showcomps (@var{tensor}) THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @deffn {Function} idummy () THIS ITEM NEEDS TO BE TRANSLATED. @end deffn @defvr {Option variable} idummyx THIS ITEM NEEDS TO BE TRANSLATED. @end defvr @defvr {Option variable} icounter THIS ITEM NEEDS T... [truncated message content] |
From: Robert D. <rob...@us...> - 2006-11-05 17:45:57
|
Update of /cvsroot/maxima/maxima/doc/info In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv7080 Modified Files: Bugs.texi Log Message: Cut out uninformative section "Introduction to Bug Detection and Reporting". Index: Bugs.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Bugs.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Bugs.texi 20 Nov 2005 14:56:02 -0000 1.9 +++ Bugs.texi 5 Nov 2006 17:45:53 -0000 1.10 @@ -1,15 +1,8 @@ @menu -* Introduction to Bug Detection and Reporting:: * Definitions for Bug Detection and Reporting:: @end menu -@node Introduction to Bug Detection and Reporting -@section Introduction to Bug Detection and Reporting -Like all large programs, Maxima contains both known and unknown -bugs. This chapter describes the built-in facilities for running the -Maxima test suite as well as reporting new bugs. - @node Definitions for Bug Detection and Reporting @section Definitions for Bug Detection and Reporting @deffn {Function} run_testsuite () |
From: Jorge B. <fic...@us...> - 2006-11-05 07:55:18
|
Update of /cvsroot/maxima/maxima/doc/info/pt In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv7984 Modified Files: augmented_lagrangian.texi Log Message: augmented_lagragian.texi -> correcting *constraints* translation Index: augmented_lagrangian.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/augmented_lagrangian.texi,v retrieving revision 1.3 retrieving revision 1.4 diff -u -d -r1.3 -r1.4 --- augmented_lagrangian.texi 4 Nov 2006 10:41:44 -0000 1.3 +++ augmented_lagrangian.texi 5 Nov 2006 07:55:15 -0000 1.4 @@ -12,7 +12,7 @@ Retorna um m@'inimo aproximado da express@~ao @var{FOM} com rela@,{c}@~ao @`as vari@'aveis @var{xx}, -mantendo as constantes @var{C} iguais a zero. +mantendo restrito o valor de @var{C} a zero. @var{yy} @'e uma lista de suposi@,{c}@~oes iniciais para @var{xx}. O m@'etodo utilizado @'e o m@'etodo do Lagrangiano aumentado (veja refer@^encias [1] e [2]). |
From: Robert D. <rob...@us...> - 2006-11-05 03:07:31
|
Update of /cvsroot/maxima/maxima/doc/info In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv17591 Modified Files: Operators.texi Constants.texi Log Message: Enclose @fnindex and @vrindex in @ifinfo / @end ifinfo, because texi2html complains about @fnindex and @vrindex. Too bad about that, really; the extra index items would be very helpful. Index: Operators.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Operators.texi,v retrieving revision 1.33 retrieving revision 1.34 diff -u -d -r1.33 -r1.34 --- Operators.texi 22 Oct 2006 16:09:36 -0000 1.33 +++ Operators.texi 5 Nov 2006 03:07:27 -0000 1.34 @@ -143,7 +143,9 @@ @end deffn @deffn {Operator} !! +@ifinfo @fnindex Double factorial +@end ifinfo The double factorial operator. For an integer, float, or rational number @code{n}, @@ -164,7 +166,9 @@ @end deffn @deffn {Operator} # +@ifinfo @fnindex Not equal (syntactic inequality) +@end ifinfo Represents the negation of syntactic equality @code{=}. Note that because of the rules for evaluation of predicate expressions @@ -200,7 +204,9 @@ @end deffn @deffn {Operator} . +@ifinfo @fnindex Noncommutative multiplication +@end ifinfo The dot operator, for matrix (non-commutative) multiplication. When "." is used in this way, spaces should be left on both sides of it, e.g. A . B. This distinguishes it plainly from a decimal point in @@ -222,13 +228,17 @@ @end deffn @deffn {Operator} : +@ifinfo @fnindex Assignment operator +@end ifinfo The assignment operator. E.g. A:3 sets the variable A to 3. @end deffn @deffn {Operator} :: +@ifinfo @fnindex Assignment operator (evaluates left-hand side) +@end ifinfo Assignment operator. :: assigns the value of the expression on its right to the value of the quantity on its left, which must evaluate to an atomic variable or subscripted variable. @@ -236,7 +246,9 @@ @end deffn @deffn {Operator} ::= +@ifinfo @fnindex Macro function definition operator +@end ifinfo Macro function definition operator. @code{::=} defines a function (called a "macro" for historical reasons) which quotes its arguments, @@ -355,15 +367,19 @@ @end deffn @deffn {Operator} := +@ifinfo @fnindex Function definition operator +@end ifinfo The function definition operator. E.g. @code{f(x):=sin(x)} defines a function @code{f}. @end deffn @deffn {Operator} = +@ifinfo @fnindex Equation operator @fnindex Equal (syntactic equality) +@end ifinfo The equation operator. An expression @code{@var{a} = @var{b}}, by itself, represents @@ -492,7 +508,9 @@ @c NEEDS EXAMPLES @deffn {Operator} and +@ifinfo @fnindex Logical conjunction +@end ifinfo The logical conjunction operator. @code{and} is an n-ary infix operator; its operands are Boolean expressions, and its result is a Boolean value. @@ -517,7 +535,9 @@ @c NEEDS EXAMPLES @deffn {Operator} or +@ifinfo @fnindex Logical disjunction +@end ifinfo The logical disjunction operator. @code{or} is an n-ary infix operator; its operands are Boolean expressions, and its result is a Boolean value. @@ -542,7 +562,9 @@ @c NEEDS EXAMPLES @deffn {Operator} not +@ifinfo @fnindex Logical negation +@end ifinfo The logical negation operator. @code{not} is a prefix operator; its operand is a Boolean expression, and its result is a Boolean value. Index: Constants.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Constants.texi,v retrieving revision 1.12 retrieving revision 1.13 diff -u -d -r1.12 -r1.13 --- Constants.texi 22 Oct 2006 16:09:36 -0000 1.12 +++ Constants.texi 5 Nov 2006 03:07:27 -0000 1.13 @@ -7,8 +7,10 @@ @section Definitions for Constants @defvr {Constant} %e +@ifinfo @vrindex e @vrindex Base of natural logarithm +@end ifinfo - the base of natural logarithms, @math{e}, is represented in Maxima as @code{%e}. @@ -20,26 +22,34 @@ @end defvr @defvr {Constant} inf +@ifinfo @vrindex Real infinity +@end ifinfo - real positive infinity. @end defvr @defvr {Constant} infinity +@ifinfo @vrindex Complex infinity +@end ifinfo - complex infinity. @end defvr @defvr {Constant} minf +@ifinfo @vrindex Minus infinity @vrindex Negative infinity +@end ifinfo - real minus infinity. @end defvr @defvr {Constant} %pi +@ifinfo @vrindex pi +@end ifinfo - "pi" is represented in Maxima as @code{%pi}. @end defvr |
From: Raymond T. <rt...@us...> - 2006-11-05 02:52:46
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv10440/src Modified Files: defint.lisp Log Message: Fix for bug [ 1582625 ] integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1) wrong? src/defint.lisp: o Call $RECTFORM before simplifying plog(x) in LOG-IMAG-0-2%PI. This is what fixes the bug. The issue is probably really in the simplifier for plog, but that's much harder to fix, so workaround the issue by calling $RECTFORM to make it easier for LOG-IMAG-0-2%PI. o Minor modification of KEYHOLE not to modify its argument N, and some reindentation. o Add some comments to RECTZTO%PI2. tests/rtest15.mac: o Add test for bug 1582625. Index: defint.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/defint.lisp,v retrieving revision 1.31 retrieving revision 1.32 diff -u -d -r1.31 -r1.32 --- defint.lisp 5 Sep 2006 18:44:01 -0000 1.31 +++ defint.lisp 5 Nov 2006 02:52:40 -0000 1.32 @@ -1502,19 +1502,27 @@ (let ((rd* ())) (radicalp e v))) +;; Compute the integral(n/d,x,0,inf) by computing the negative of the +;; sum of residues of log(-x)*n/d over the poles of n/d inside the +;; keyhole contour. This contour is basically an disk with a slit +;; along the positive real axis. n/d must be a rational function. (defun keyhole (n d var) - (let ((semirat* ())) - (setq n (res n d #'(lambda (j) - (or (not (equal ($imagpart j) 0)) - (eq ($asksign j) '$neg))) - #'(lambda (j) - (cond ((eq ($asksign j) '$pos) - t) - (t (diverg)))))) + (let* ((semirat* ()) + (res (res n d + #'(lambda (j) + ;; Ok if not on the positive real axis. + (or (not (equal ($imagpart j) 0)) + (eq ($asksign j) '$neg))) + #'(lambda (j) + (cond ((eq ($asksign j) '$pos) + t) + (t (diverg))))))) (let ((rsn* t)) - ($rectform ($multthru (m+ (cond ((car n) (car n)) + ($rectform ($multthru (m+ (cond ((car res) + (car res)) (t 0.)) - (cond ((cadr n) (cadr n)) + (cond ((cadr res) + (cadr res)) (t 0.)))))))) ;; Look at an expression e of the form sin(r*x)^k, where k is an @@ -2531,11 +2539,14 @@ ;; the log function to have an imaginary part between 0 and 2*%pi ;; instead of -%pi to %pi. (defun rectzto%pi2 (p pe d) + ;; We have R(exp(x))*p(x) represented as p(x)*pe(exp(x))/d(exp(x)). (prog (dp n pl a b c denom-exponential) (if (not (and (setq denom-exponential (catch 'pin%ex (pin%ex d))) (%e-integer-coeff pe) (%e-integer-coeff d))) (return ())) + ;; At this point denom-exponential has converted d(exp(x)) to the + ;; polynomial d(z), where z = exp(x). (setq n (m* (cond ((null p) -1.) (t ($expand (m*t '$%i %pi2 (makpoly p))))) pe)) @@ -2565,13 +2576,18 @@ ((or (cadr pl) (caddr pl)) (setq dp (sdiff d var)))) - ;; Not sure what this does. + ;; The cadr of pl is the list of the (simple?) poles of the + ;; denom-exponential. Take the log of them to find the poles of + ;; the original expression. Then compute the residues at each of + ;; these poles and sum them up and put the result in B. (If no + ;; simple poles set B to 0.) (cond ((cadr pl) (setq b (mapcar #'log-imag-0-2%pi (cadr pl))) (setq b (res1 n dp b)) (setq b (m+l b))) (t (setq b 0.))) - ;; Not sure what this does either. + ;; I think this handles the case of the multiple poles of the + ;; denominator. The sum of these residues are placed in C. (cond ((caddr pl) (let ((temp (mapcar #'log-imag-0-2%pi (caddr pl)))) (setq c (append temp (mapcar #'(lambda (j) @@ -3167,16 +3183,21 @@ ;;;Looks at the IMAGINARY part of a log and puts it in the interval 0 2*%pi. (defun log-imag-0-2%pi (x) - (let ((plog (simplify `((%plog) ,x)))) + (let ((plog (simplify ($rectform `((%plog) ,x))))) + ;; We take the $rectform above to make sure that the log is + ;; expanded out for the situations where simplifying plog itself + ;; doesn't do it. This should probably be considered a bug in the + ;; plog simplifier and should be fixed there. (cond ((not (free plog '%plog)) (subst '%log '%plog plog)) - (t (destructuring-let (((real . imag) (trisplit plog))) - (cond ((eq ($asksign imag) '$neg) - (setq imag (m+ imag %pi2))) - ((eq ($asksign (m- imag %pi2)) '$pos) - (setq imag (m- imag %pi2))) - (t t)) - (m+ real (m* '$%i imag))))))) + (t + (destructuring-let (((real . imag) (trisplit plog))) + (cond ((eq ($asksign imag) '$neg) + (setq imag (m+ imag %pi2))) + ((eq ($asksign (m- imag %pi2)) '$pos) + (setq imag (m- imag %pi2))) + (t t)) + (m+ real (m* '$%i imag))))))) ;;; Temporary fix for a lacking in taylor, which loses with %i in denom. |
From: Raymond T. <rt...@us...> - 2006-11-05 02:52:46
|
Update of /cvsroot/maxima/maxima/tests In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv10440/tests Modified Files: rtest15.mac Log Message: Fix for bug [ 1582625 ] integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1) wrong? src/defint.lisp: o Call $RECTFORM before simplifying plog(x) in LOG-IMAG-0-2%PI. This is what fixes the bug. The issue is probably really in the simplifier for plog, but that's much harder to fix, so workaround the issue by calling $RECTFORM to make it easier for LOG-IMAG-0-2%PI. o Minor modification of KEYHOLE not to modify its argument N, and some reindentation. o Add some comments to RECTZTO%PI2. tests/rtest15.mac: o Add test for bug 1582625. Index: rtest15.mac =================================================================== RCS file: /cvsroot/maxima/maxima/tests/rtest15.mac,v retrieving revision 1.47 retrieving revision 1.48 diff -u -d -r1.47 -r1.48 --- rtest15.mac 5 Nov 2006 02:27:01 -0000 1.47 +++ rtest15.mac 5 Nov 2006 02:52:42 -0000 1.48 @@ -552,3 +552,12 @@ -2*sqrt(2)*atan((5*sqrt(2)-4)/(3*sqrt(2)-16))+sqrt(2)*log(4*(2*sqrt(2)+5)/17) -sqrt(2)*log(-4*(2*sqrt(2)-5)/17)+2*log(2)-2*log(2/3)+4*atan(1/2)) /16; + +/* + * Bug [ 1582625 ] integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1) wrong? + * + * Fixed in defint.lisp + * + */ +integrate(t^2*log(t)/((t^2-1)*(t^4+1)), t, 0, 1); +-(sqrt(2)-2)*%pi^2/32; |
From: Raymond T. <rt...@us...> - 2006-11-05 02:27:09
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv31186/src Modified Files: residu.lisp Log Message: Fix for bug [1504505] integrate( 1/(x^8-1),x,0,1/2) => internal error. src/residu.lisp: o Reindent $residue o In RESM1 call $RATSIMP to simplify the pole. The underlying error is in $TAYLOR, but calling $RATSIMP works around the issue. tests/rtest15.mac: o Add test for bug 1504505. Index: residu.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/residu.lisp,v retrieving revision 1.4 retrieving revision 1.5 diff -u -d -r1.4 -r1.5 --- residu.lisp 7 Nov 2005 17:37:12 -0000 1.4 +++ residu.lisp 5 Nov 2006 02:27:01 -0000 1.5 @@ -190,18 +190,24 @@ (setq sn* nil sd* nil) (defmfun $residue (e var p) - (cond (($unknown e) ($nounify '$residue) (list '(%residue) e var p)) - (t (let (sn* sd*) - (if (and (mtimesp e) (andmapcar #'snumden (cdr e))) - (setq nn* (m*l sn*) dn* (m*l sd*)) - (numden e))) - (resm1 (div* nn* dn*) p)))) + (cond (($unknown e) + ($nounify '$residue) + (list '(%residue) e var p)) + (t + (let (sn* sd*) + (if (and (mtimesp e) (andmapcar #'snumden (cdr e))) + (setq nn* (m*l sn*) dn* (m*l sd*)) + (numden e))) + (resm1 (div* nn* dn*) p)))) (defun resm1 (e pole) - (setq pole ($rectform pole)) - (setq e (ratdisrep ($taylor e var pole - 0 ;; things like residue(s/(s^2-a^2),s,a) fails if use -1 - ;;-1 - ))) - (coeff e (m^ (m+ (m* -1 pole) var) -1) 1)) + ;; Call $ratsimp to simplify pole. Not sure if this is really + ;; necessary or desired, but it fixes bug 1504505. It would be + ;; better to fix $taylor, but that seems much harder. + (let ((pole ($ratsimp ($rectform pole)))) + (setq e (ratdisrep ($taylor e var pole + 0 ;; things like residue(s/(s^2-a^2),s,a) fails if use -1 + ;;-1 + ))) + (coeff e (m^ (m+ (m* -1 pole) var) -1) 1))) |
From: Raymond T. <rt...@us...> - 2006-11-05 02:27:07
|
Update of /cvsroot/maxima/maxima/tests In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv31186/tests Modified Files: rtest15.mac Log Message: Fix for bug [1504505] integrate( 1/(x^8-1),x,0,1/2) => internal error. src/residu.lisp: o Reindent $residue o In RESM1 call $RATSIMP to simplify the pole. The underlying error is in $TAYLOR, but calling $RATSIMP works around the issue. tests/rtest15.mac: o Add test for bug 1504505. Index: rtest15.mac =================================================================== RCS file: /cvsroot/maxima/maxima/tests/rtest15.mac,v retrieving revision 1.46 retrieving revision 1.47 diff -u -d -r1.46 -r1.47 --- rtest15.mac 6 Sep 2006 16:33:06 -0000 1.46 +++ rtest15.mac 5 Nov 2006 02:27:01 -0000 1.47 @@ -540,3 +540,15 @@ integrate(1/(sin(x)^2+1),x,0,3*%pi); 3*sqrt(2)*%pi/2; +/* + * Bug [1504505] integrate( 1/(x^8-1),x,0,1/2) => internal error + * + * Fixed in residu.lisp, 1.5. + * + * The call to factor is to get rid of some numerical factors. + */ +factor(integrate(1/(x^8-1),x,0,1/2)); +-(2*sqrt(2)*atan((5*sqrt(2)+4)/(3*sqrt(2)+16)) + -2*sqrt(2)*atan((5*sqrt(2)-4)/(3*sqrt(2)-16))+sqrt(2)*log(4*(2*sqrt(2)+5)/17) + -sqrt(2)*log(-4*(2*sqrt(2)-5)/17)+2*log(2)-2*log(2/3)+4*atan(1/2)) + /16; |
From: Jorge B. <fic...@us...> - 2006-11-04 21:07:29
|
Update of /cvsroot/maxima/maxima/doc/info In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv25098 Modified Files: Input.texi Matrices.texi Itensor.texi Command.texi Number.texi orthopoly.texi Log Message: Enclosing vrindex and fnindex with ifinfo-endifinfo to keep alert messages during doc compilation clean. orthoply.texi -> minor bugs Index: Input.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Input.texi,v retrieving revision 1.47 retrieving revision 1.48 diff -u -d -r1.47 -r1.48 --- Input.texi 22 Oct 2006 16:09:36 -0000 1.47 +++ Input.texi 4 Nov 2006 21:07:26 -0000 1.48 @@ -69,8 +69,9 @@ @section Definitions for Input and Output @defvr {System variable} __ +@ifinfo @vrindex Current input expression - +@end ifinfo @code{__} is the input expression currently being evaluated. That is, while an input expression @var{expr} is being evaluated, @code{__} is @var{expr}. @@ -121,7 +122,9 @@ @end defvr @defvr {System variable} _ +@ifinfo @vrindex Previous input +@end ifinfo @code{_} is the most recent input expression (e.g., @code{%i1}, @code{%i2}, @code{%i3}, ...). @@ -185,7 +188,9 @@ @end defvr @defvr {System variable} % +@ifinfo @vrindex Previous output +@end ifinfo @code{%} is the output expression (e.g., @code{%o1}, @code{%o2}, @code{%o3}, ...) most recently computed by Maxima, whether or not it was displayed. @@ -203,7 +208,9 @@ @end defvr @defvr {System variable} %% +@ifinfo @vrindex Previous result in compound expression +@end ifinfo In compound statements, namely @code{block}, @code{lambda}, or @code{(@var{s_1}, ..., @var{s_n})}, @code{%%} is the value of the previous statement. @@ -258,7 +265,9 @@ @end defvr @deffn {Function} %th (@var{i}) +@ifinfo @fnindex N'th previous output +@end ifinfo The value of the @var{i}'th previous output expression. That is, if the next expression to be computed is the @var{n}'th output, @code{%th (@var{m})} is the (@var{n} - @var{m})'th output. @@ -285,7 +294,9 @@ @end deffn @deffn {Special symbol} ? +@ifinfo @fnindex Fetch documentation +@end ifinfo As prefix to a function or variable name, @code{?} signifies that the name is a Lisp name, not a Maxima name. For example, @code{?round} signifies the Lisp function @code{ROUND}. Index: Matrices.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Matrices.texi,v retrieving revision 1.25 retrieving revision 1.26 diff -u -d -r1.25 -r1.26 --- Matrices.texi 22 Oct 2006 16:09:36 -0000 1.25 +++ Matrices.texi 4 Nov 2006 21:07:26 -0000 1.26 @@ -1555,8 +1555,10 @@ @defvr {Special symbol} [ @defvrx {Special symbol} ] +@ifinfo @fnindex List delimiters @fnindex Subscript operator +@end ifinfo @code{[} and @code{]} mark the beginning and end, respectively, of a list. @code{[} and @code{]} also enclose the subscripts of Index: Itensor.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Itensor.texi,v retrieving revision 1.39 retrieving revision 1.40 diff -u -d -r1.39 -r1.40 --- Itensor.texi 22 Oct 2006 16:09:36 -0000 1.39 +++ Itensor.texi 4 Nov 2006 21:07:26 -0000 1.40 @@ -1810,7 +1810,9 @@ be applied. @defvr {Operator} ~ +@ifinfo @fnindex Wedge product +@end ifinfo The wedge product operator is denoted by the tilde @code{~}. This is a binary operator. Its arguments should be expressions involving scalars, @@ -1848,7 +1850,9 @@ @end defvr @defvr {Operator} | +@ifinfo @fnindex Contraction with a vector +@end ifinfo The vertical bar @code{|} denotes the "contraction with a vector" binary operation. When a totally antisymmetric covariant tensor is contracted Index: Command.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Command.texi,v retrieving revision 1.42 retrieving revision 1.43 diff -u -d -r1.42 -r1.43 --- Command.texi 22 Oct 2006 16:09:36 -0000 1.42 +++ Command.texi 4 Nov 2006 21:07:26 -0000 1.43 @@ -9,7 +9,9 @@ @c NEEDS EXAMPLES @c THIS ITEM IS VERY IMPORTANT !! @deffn {Operator} ' +@ifinfo @fnindex Quote operator +@end ifinfo The single quote operator @code{'} prevents evaluation. Applied to a symbol, @@ -131,7 +133,9 @@ @end deffn @deffn {Operator} '' +@ifinfo @fnindex Quote-quote operator +@end ifinfo The quote-quote operator @code{'@w{}'} (two single quote marks) modifies evaluation in input expressions. Applied to a general expression @var{expr}, quote-quote causes the value of @var{expr} Index: Number.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/Number.texi,v retrieving revision 1.19 retrieving revision 1.20 diff -u -d -r1.19 -r1.20 --- Number.texi 22 Oct 2006 16:09:36 -0000 1.19 +++ Number.texi 4 Nov 2006 21:07:26 -0000 1.20 @@ -294,7 +294,9 @@ @end deffn @defvr {Constant} %gamma +@ifinfo @vrindex Euler-Mascheroni constant +@end ifinfo The Euler-Mascheroni constant, 0.5772156649015329 .... @c DOUBTLESS THERE IS MORE TO SAY HERE. Index: orthopoly.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/orthopoly.texi,v retrieving revision 1.3 retrieving revision 1.4 diff -u -d -r1.3 -r1.4 --- orthopoly.texi 6 Jul 2006 11:20:21 -0000 1.3 +++ orthopoly.texi 4 Nov 2006 21:07:26 -0000 1.4 @@ -308,7 +308,7 @@ specialized floating point algorithms are used for evaluation. Maxima's @code{float} function is somewhat indiscriminant; if you apply -@code{float} to an an expression involving an orthogonal polynomial with a +@code{float} to an expression involving an orthogonal polynomial with a symbolic degree or order parameter, these parameters may be converted into floats; after that, the expression will not evaluate fully. Consider @@ -423,14 +423,14 @@ center of the interval and @var{r} is its radius. The center of an interval can be a complex number, and the radius is always a positive real number. -Here is an an example. +Here is an example. @c ===beg=== @c fpprec : 50$ @c y0 : jacobi_p (100, 2, 3, 0.2); @c y1 : bfloat (jacobi_p (100, 2, 3, 1/5)); @c ===end== -= + @example (%i1) fpprec : 50$ |
From: Jorge B. <fic...@us...> - 2006-11-04 21:05:34
|
Update of /cvsroot/maxima/maxima/doc/info/pt In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv24881 Modified Files: orthopoly.texi Log Message: orthopoly.texi minor bugs Index: orthopoly.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/orthopoly.texi,v retrieving revision 1.2 retrieving revision 1.3 diff -u -d -r1.2 -r1.3 --- orthopoly.texi 6 Jul 2006 11:20:21 -0000 1.2 +++ orthopoly.texi 4 Nov 2006 21:05:30 -0000 1.3 @@ -308,7 +308,7 @@ specialized floating point algorithms are used for evaluation. Maxima's @code{float} function is somewhat indiscriminant; if you apply -@code{float} to an an expression involving an orthogonal polynomial with a +@code{float} to an expression involving an orthogonal polynomial with a symbolic degree or order parameter, these parameters may be converted into floats; after that, the expression will not evaluate fully. Consider @@ -423,14 +423,14 @@ center of the interval and @var{r} is its radius. The center of an interval can be a complex number, and the radius is always a positive real number. -Here is an an example. +Here is an example. @c ===beg=== @c fpprec : 50$ @c y0 : jacobi_p (100, 2, 3, 0.2); @c y1 : bfloat (jacobi_p (100, 2, 3, 1/5)); @c ===end== -= + @example (%i1) fpprec : 50$ |
From: Jorge B. <fic...@us...> - 2006-11-04 19:31:28
|
Update of /cvsroot/maxima/maxima/doc/info/pt In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv17986 Modified Files: Input.texi Matrices.texi Itensor.texi Command.texi Constants.texi Number.texi Log Message: Manual Portuguese Translation. Enclosing vrindex and fnindex with ifinfo-endifinfo to keep alert messages during doc compilation clean Index: Input.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Input.texi,v retrieving revision 1.7 retrieving revision 1.8 diff -u -d -r1.7 -r1.8 --- Input.texi 4 Nov 2006 10:41:44 -0000 1.7 +++ Input.texi 4 Nov 2006 19:31:21 -0000 1.8 @@ -121,7 +121,9 @@ @end defvr @defvr {Vari@'avel de sistema} _ +@ifinfo @vrindex Entrada anterior +@end ifinfo @code{_} @'e a mais recente express@~ao de entrada (e.g., @code{%i1}, @code{%i2}, @code{%i3}, ...). @@ -185,7 +187,9 @@ @end defvr @defvr {Vari@'avel de sistema} % +@ifinfo @vrindex Sa@'ida anterior +@end ifinfo @code{%} @'e a express@~ao de sa@'ida (e.g., @code{%o1}, @code{%o2}, @code{%o3}, ...) mais recentemente calculada pelo Maxima, pode ou n@~ao ser mostrada. @@ -203,7 +207,9 @@ @end defvr @defvr {Vari@'avel de sistema} %% +@ifinfo @vrindex Resultado anterior em express@~ao composta +@end ifinfo Em declara@,{c}@~ao composta, a saber @code{block}, @code{lambda}, ou @code{(@var{s_1}, ..., @var{s_n})}, @code{%%} @'e os valor da declara@,{c}@~ao anterior. @@ -258,7 +264,9 @@ @end defvr @deffn {Fun@,{c}@~ao} %th (@var{i}) +@ifinfo @fnindex N'@'esima sa@'ida anterior +@end ifinfo O valor da @var{i}'@'esima express@~ao pr@'evia de sa@'ida. Isto @'e, se a pr@'oxima express@~ao a ser calculada for a @var{n}'@'esima sa@'ida, @code{%th (@var{m})} ser@'a a (@var{n} - @var{m})'@'esima sa@'ida. @@ -285,7 +293,9 @@ @end deffn @deffn {S@'imbolo especial} ? +@ifinfo @fnindex Consulta documenta@,{c}@~ao +@end ifinfo Como prefixo para uma fun@,{c}@~ao ou nome de vari@'avel, @code{?} significa que o nome @'e um nome Lisp, n@~ao um nome Maxima. Por exemplo, @code{?round} significa a fun@,{c}@~ao Lisp @code{ROUND}. Index: Matrices.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Matrices.texi,v retrieving revision 1.10 retrieving revision 1.11 diff -u -d -r1.10 -r1.11 --- Matrices.texi 4 Nov 2006 10:41:44 -0000 1.10 +++ Matrices.texi 4 Nov 2006 19:31:21 -0000 1.11 @@ -1556,8 +1556,10 @@ @defvr {S@'imbolo especial} [ @defvrx {S@'imbolo especial} ] +@ifinfo @fnindex Delimitador de Lista @fnindex Operador de Subscrito +@end ifinfo @code{[} e @code{]} marcam o ome@,{c}o e o fim, respectivamente, de uma lista. @code{[} e @code{]} tamb@'em envolvem os subscritos de Index: Itensor.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Itensor.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Itensor.texi 4 Nov 2006 10:41:44 -0000 1.9 +++ Itensor.texi 4 Nov 2006 19:31:21 -0000 1.10 @@ -1811,8 +1811,9 @@ ser aplicada. @defvr {Operador} ~ +@ifinfo @fnindex Produto Externo - +@end ifinfo O operador do produto cunha @'e definido como sendo o acento til @code{~}. O til @'e um operador bin@'ario. Seus argumentos podem ser express@~oes envolvendo escalares, tensores covariantes de categoria 1, ou tensores covariantes de categoria @code{l} que @@ -1849,8 +1850,9 @@ @end defvr @defvr {Operator} | +@ifinfo @fnindex Contra@,{c}@~ao com um vetor - +@end ifinfo A barra vertical @code{|} denota a opera@,{c}@~ao bin@'aria "contra@,{c}@~ao com um vetor". Quando um tensor covariante totalmente antisim@'etrico @'e contra@'ido com um vetor contravariante, o resultado @'e o mesmo independente de qual @'indice Index: Command.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Command.texi,v retrieving revision 1.10 retrieving revision 1.11 diff -u -d -r1.10 -r1.11 --- Command.texi 4 Nov 2006 10:41:44 -0000 1.10 +++ Command.texi 4 Nov 2006 19:31:21 -0000 1.11 @@ -16,7 +16,9 @@ @c NEEDS EXAMPLES @c THIS ITEM IS VERY IMPORTANT !! @deffn {Operador} ' +@ifinfo @fnindex Operador Ap@'ostrofo +@end ifinfo O operador ap@'ostrofo @code{'} evita avalia@,{c}@~ao. Aplicado a um s@'imbolo, @@ -138,7 +140,9 @@ @end deffn @deffn {Operator} '' +@ifinfo @fnindex Operador ap@'ostrofo-ap@'ostrofo +@end ifinfo O operador ap@'ostrofo-ap@'ostrofo @code{'@w{}'} (dois ap@'ostrofost) modifica avalia@,{c}@~ao em express@~oes de entrada. Aplicado a uma express@~ao geral @var{expr}, ap@'ostrofo-ap@'ostrofo faz com que o valor de @var{expr} Index: Constants.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Constants.texi,v retrieving revision 1.2 retrieving revision 1.3 diff -u -d -r1.2 -r1.3 --- Constants.texi 4 Nov 2006 10:41:44 -0000 1.2 +++ Constants.texi 4 Nov 2006 19:31:21 -0000 1.3 @@ -8,8 +8,10 @@ @section Defini@value{cedilha}@~oes para Constantes @defvr {Constante} %e +@ifinfo @vrindex e @vrindex Base do logar@'itmo natural +@end ifinfo - A base dos logar@'itmos naturais, @math{e}, @'e representada no Maxima como @code{%e}. @@ -21,27 +23,34 @@ @end defvr @defvr {Constante} inf +@ifinfo @vrindex Infinito Real +@end ifinfo - infinito positivo real. @end defvr @defvr {Constante} infinity +@ifinfo @vrindex Infinito Complexo +@end ifinfo - infinito complexo. @end defvr @defvr {Constante} minf +@ifinfo @vrindex Menos infinito @vrindex Infinito negativo - +@end ifinfo - menos infinito real. @end defvr @defvr {Constante} %pi +@ifinfo @vrindex pi +@end ifinfo - "pi" @'e representado no Maxima como @code{%pi}. @end defvr Index: Number.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Number.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Number.texi 4 Nov 2006 10:41:44 -0000 1.9 +++ Number.texi 4 Nov 2006 19:31:21 -0000 1.10 @@ -295,7 +295,9 @@ @end deffn @defvr {Constante} %gamma +@ifinfo @vrindex Constante de Euler-Mascheroni +@end ifinfo A constante de Euler-Mascheroni, 0.5772156649015329 .... @c DOUBTLESS THERE IS MORE TO SAY HERE. |
From: Jorge B. <fic...@us...> - 2006-11-04 10:41:52
|
Update of /cvsroot/maxima/maxima/doc/info/pt In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv21941 Modified Files: Floating.texi Input.texi augmented_lagrangian.texi Numerical.texi Matrices.texi Itensor.texi Command.texi Constants.texi Equations.texi Plotting.texi Number.texi Log Message: Manual Portuguese Translation. -r 1.1 -r 1.2 augmented_lagrangian.texi,-r 1.41 -r 1.42 Command.texi,-r 1.11 -r 1.12 Constants.texi,-r 1.23 -r 1.24 Equations.texi,-r 1.18 -r 1.19 Floating.texi,-r 1.46 -r 1.47 Input.texi,-r 1.38 -r 1.39 Itensor.texi,-r 1.24 -r 1.25 Matrices.texi,-r 1.18 -r 1.19 Number.texi,-r 1.21 -r 1.22 Numerical.texi,-r 1.32 -r 1.33 Operators.texi,-r 1.28 -r 1.29 Plotting.texi Index: Floating.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Floating.texi,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- Floating.texi 4 Oct 2006 09:03:58 -0000 1.6 +++ Floating.texi 4 Nov 2006 10:41:44 -0000 1.7 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Floating.texi/1.18/Sat Jul 8 08:14:21 2006/-ko/ +@c /Floating.texi/1.19/Thu Nov 2 05:46:57 2006/-ko/ @c ITEMS IN THIS FILE ARE IN NEED OF EXPANSION, CLARIFICATION, AND EXAMPLES @menu Index: Input.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Input.texi,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- Input.texi 27 Jul 2006 13:30:22 -0000 1.6 +++ Input.texi 4 Nov 2006 10:41:44 -0000 1.7 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Input.texi/1.46/Wed Jul 26 08:57:57 2006/-ko/ +@c /Input.texi/1.47/Thu Nov 2 05:47:20 2006/-ko/ @menu * Introdu@value{cedilha}@~ao a Entrada e Sa@'ida:: * Coment@'arios:: @@ -121,6 +121,7 @@ @end defvr @defvr {Vari@'avel de sistema} _ +@vrindex Entrada anterior @code{_} @'e a mais recente express@~ao de entrada (e.g., @code{%i1}, @code{%i2}, @code{%i3}, ...). @@ -184,7 +185,7 @@ @end defvr @defvr {Vari@'avel de sistema} % - +@vrindex Sa@'ida anterior @code{%} @'e a express@~ao de sa@'ida (e.g., @code{%o1}, @code{%o2}, @code{%o3}, ...) mais recentemente calculada pelo Maxima, pode ou n@~ao ser mostrada. @@ -202,6 +203,7 @@ @end defvr @defvr {Vari@'avel de sistema} %% +@vrindex Resultado anterior em express@~ao composta Em declara@,{c}@~ao composta, a saber @code{block}, @code{lambda}, ou @code{(@var{s_1}, ..., @var{s_n})}, @code{%%} @'e os valor da declara@,{c}@~ao anterior. @@ -256,6 +258,7 @@ @end defvr @deffn {Fun@,{c}@~ao} %th (@var{i}) +@fnindex N'@'esima sa@'ida anterior O valor da @var{i}'@'esima express@~ao pr@'evia de sa@'ida. Isto @'e, se a pr@'oxima express@~ao a ser calculada for a @var{n}'@'esima sa@'ida, @code{%th (@var{m})} ser@'a a (@var{n} - @var{m})'@'esima sa@'ida. @@ -282,6 +285,7 @@ @end deffn @deffn {S@'imbolo especial} ? +@fnindex Consulta documenta@,{c}@~ao Como prefixo para uma fun@,{c}@~ao ou nome de vari@'avel, @code{?} significa que o nome @'e um nome Lisp, n@~ao um nome Maxima. Por exemplo, @code{?round} significa a fun@,{c}@~ao Lisp @code{ROUND}. Index: augmented_lagrangian.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/augmented_lagrangian.texi,v retrieving revision 1.2 retrieving revision 1.3 diff -u -d -r1.2 -r1.3 --- augmented_lagrangian.texi 10 Sep 2006 13:09:45 -0000 1.2 +++ augmented_lagrangian.texi 4 Nov 2006 10:41:44 -0000 1.3 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /augmented_lagrangian.texi/1.1/Mon Feb 27 22:09:17 2006// +@c /augmented_lagrangian.texi/1.2/Wed Sep 27 07:36:26 2006// @menu * Defini@value{cedilha}@value{o_til}es para augmented_lagrangian:: @end menu @@ -7,55 +7,74 @@ @node Defini@value{cedilha}@value{o_til}es para augmented_lagrangian, , augmented_lagrangian, augmented_lagrangian @section Defini@value{cedilha}@value{o_til}es para augmented_lagrangian -@defvr {Vari@value{a_agu}vel de op@value{cedilha}@value{a_til}o} niter -Valor padr@~ao: 10 +@deffn {Fun@value{cedilha}@value{a_til}o} augmented_lagrangian_method (@var{FOM}, @var{xx}, @var{C}, @var{yy}) +@deffnx {Fun@value{cedilha}@value{a_til}o} augmented_lagrangian_method (@var{FOM}, @var{xx}, @var{C}, @var{yy}, args_opcionais) + +Retorna um m@'inimo aproximado da express@~ao @var{FOM} +com rela@,{c}@~ao @`as vari@'aveis @var{xx}, +mantendo as constantes @var{C} iguais a zero. +@var{yy} @'e uma lista de suposi@,{c}@~oes iniciais para @var{xx}. +O m@'etodo utilizado @'e o m@'etodo do Lagrangiano aumentado (veja refer@^encias [1] e [2]). -N@'umero de itera@,{c}@~oes para @code{augmented_lagrangian_method}. -@end defvr +@code{optional_args} representam argumentos adicionais, +especificados como @code{@var{s@'imbolo} = @var{valor}}. +Os argumentos opcionais que podem ser colocados no lugar de @var{s@'imbolo}: + +@table @code +@item niter +N@'umero de itera@,{c}@~oes do algor@'itmo do Langrangiano aumentado +@item lbfgs_tolerance +Toler@^ancia forneceida a LBFGS (Limited-memory, Broyden, Fletcher, Goldfarb, Shanno) +@item iprint +par@^ametro IPRINT (uma lista de dois inteiros que controlam o n@'ivel de informa@,{c}@~ao) fornecido a LBFGS +@item %lambda +valor inicial de @code{%lambda} a ser usado durante o c@'alculo do Lagrangiano aumentado +@end table -@deffn {Fun@value{cedilha}@value{a_til}o} augmented_lagrangian_method (@var{FOM}, @var{xx}, @var{constraints}, @var{yy}) -M@'etodo do Lagrangiano Aumentado para otimiza@,{c}@~ao restrita. -@var{FOM} @'e o algarismo da express@~ao de m@'etodo, -@var{xx} @'e uma lista de vari@'aveis sobre as quais minimizar, -@var{constraints} @'e uma lista de express@~oes a serem mantidas iguais a zero, e -@var{yy} @'e uma lista de suposi@,{c}@~oes iniciais para @var{xx}. +Essa implementa@,{c}@~ao minimiza o Lagrangiano aumentado pela +pela aplica@,{c}@~ao do algor@'itmo de mem@'oria limitada BFGS (LBFGS), +que @'e um algor@'itmo quasi-Newton. -Atualmente esse c@'odigo minimiza o Lagrangiano aumentado -resolvendo para um ponto estacion@'ario de seu gradiente. -Isso @'e terrivelmente fraco, e o c@'odigo pode ser melhorado anexando -um gradiente conjugado ou um algor@'itmo de minimiza@,{c}@~ao quasi-Newton. +@code{load(augmented_lagrangian)} chama essa fun@,{c}@~ao. + +Veja tamb@'em @code{lbfgs}. -Para refer@^encia veja -@example -http://www-fp.mcs.anl.gov/otc/Guide/OptWeb/continuous/constrained/nonlinearcon/auglag.html -@end example -e -@example -http://www.cs.ubc.ca/spider/ascher/542/chap10.pdf -@end example +References: -O pacote @code{mnewton} (para resolver grad @math{L = 0}) tem que ser chamado antes do @code{augmented_lagrangian_method}. +[1] http://www-fp.mcs.anl.gov/otc/Guide/OptWeb/continuous/constrained/nonlinearcon/auglag.html -Exemplo: -@example -(%i1) load (mnewton)$ +[2] http://www.cs.ubc.ca/spider/ascher/542/chap10.pdf -(%i2) load("augmented_lagrangian")$ +Exemplo: +@c ===beg=== +@c load (lbfgs); +@c load (augmented_lagrangian); +@c FOM: x^2 + 2*y^2; +@c xx: [x, y]; +@c C: [x + y - 1]; +@c yy: [1, 1]; +@c augmented_lagrangian_method (FOM, xx, C, yy, iprint = [-1, 0]); +@c ===end=== +@example +(%i1) load (lbfgs); +(%o1) /home/robert/tmp/maxima-release-branch/maxima/share/lbfgs/\ +lbfgs.mac +(%i2) load (augmented_lagrangian); +(%o2) /home/robert/tmp/maxima-release-branch/maxima/share/contri\ +b/augmented_lagrangian.mac (%i3) FOM: x^2 + 2*y^2; - 2 2 -(%o3) 2 y + x + 2 2 +(%o3) 2 y + x (%i4) xx: [x, y]; -(%o4) [x, y] +(%o4) [x, y] (%i5) C: [x + y - 1]; -(%o5) [y + x - 1] -(%i6) yy: [1, 1]; -(%o6) [1, 1] -(%i7) augmented_lagrangian_method (FOM, xx, C, yy); -(%o7) [0.6478349834, 0.3239174917] +(%o5) [y + x - 1] +(%o6) [1, 1] +(%i7) augmented_lagrangian_method (FOM, xx, C, yy, iprint = [-1, 0]); +(%o7) [[x = 0.6478349888525, y = 0.32391749442625], + %lambda = [- 1.267422460983745]] @end example -Para usar essa fun@,{c}@~ao escreva primeiro @code{load("mnewton")} e em seguida @code{load("augmented_lagrangian")}. -Veja tamb@'em @code{niter}. @end deffn Index: Numerical.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Numerical.texi,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- Numerical.texi 23 Jul 2006 12:20:58 -0000 1.6 +++ Numerical.texi 4 Nov 2006 10:41:44 -0000 1.7 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Numerical.texi/1.21/Fri Jan 20 14:25:36 2006/-ko/ +@c /Numerical.texi/1.22/Thu Nov 2 05:48:05 2006/-ko/ @menu * Introdu@value{cedilha}@value{a_til}o a Num@'erico:: * Pacotes de Fourier:: @@ -383,6 +383,50 @@ @end defvr +@deffn {Fun@value{cedilha}@~ao} newton (@var{expr}, @var{x}, @var{x_0}, @var{eps}) +Retorna uma solu@,{c}@~ao aproximada de @code{@var{expr} = 0} atrav@'es do m@'etodo de Newton, +considerando @var{expr} como sendo uma fun@,{c}@~ao de uma vari@'avel, @var{x}. +A busca pela solu@,{c}@~ao come@,{c}a com @code{@var{x} = @var{x_0}} +e prossegue at@'e @code{abs(@var{expr}) < @var{eps}} +(com @var{expr} avaliada para o valor corrente de @var{x}). + +@code{newton} permite que vari@'aveis indefinidas apare@,{c}am em @var{expr}, +contanto que o teste de termina@,{c}@~ao @code{abs(@var{expr}) < @var{eps}} avalie +para @code{true} ou @code{false}. +Dessa forma n@~ao @'e necess@'ario que @var{expr} avalie para um n@'umero. + +@code{load(newton1)} chama essa fun@,{c}@~ao. + +Veja tamb@'em @code{realroots}, @code{allroots}, @code{find_root}, e @code{mnewton}. + +Exemplos: + +@c ===beg=== +@c load (newton1); +@c newton (cos (u), u, 1, 1/100); +@c ev (cos (u), u = %); +@c assume (a > 0); +@c newton (x^2 - a^2, x, a/2, a^2/100); +@c ev (x^2 - a^2, x = %); +@c ===end=== +@example +(%i1) load (newton1); +(%o1) /usr/share/maxima/5.10.0cvs/share/numeric/newton1.mac +(%i2) newton (cos (u), u, 1, 1/100); +(%o2) 1.570675277161251 +(%i3) ev (cos (u), u = %); +(%o3) 1.2104963335033528E-4 +(%i4) assume (a > 0); +(%o4) [a > 0] +(%i5) newton (x^2 - a^2, x, a/2, a^2/100); +(%o5) 1.00030487804878 a +(%i6) ev (x^2 - a^2, x = %); + 2 +(%o6) 6.098490481853958E-4 a +@end example + +@end deffn + @node Defini@value{cedilha}@value{o_til}es para S@'eries de Fourier, , Defini@value{cedilha}@value{o_til}es para Num@'erico, Num@'erico @section Defini@value{cedilha}@value{o_til}es para S@'eries de Fourier Index: Matrices.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Matrices.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Matrices.texi 25 Jun 2006 22:13:24 -0000 1.9 +++ Matrices.texi 4 Nov 2006 10:41:44 -0000 1.10 @@ -1,6 +1,5 @@ -/Matrices.texi/1.24/Sat Jun 24 06:45:55 2006/-ko/ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Matrices.texi/1.23/Mon May 15 07:53:43 2006/-ko/ +@c /Matrices.texi/1.25/Thu Nov 2 05:47:56 2006/-ko/ @menu * Introdu@value{cedilha}@~ao a Matrizes e @'Algebra Linear:: * Defini@value{cedilha}@~oes para Matrizes e @'Algebra Linear:: @@ -1557,6 +1556,8 @@ @defvr {S@'imbolo especial} [ @defvrx {S@'imbolo especial} ] +@fnindex Delimitador de Lista +@fnindex Operador de Subscrito @code{[} e @code{]} marcam o ome@,{c}o e o fim, respectivamente, de uma lista. @code{[} e @code{]} tamb@'em envolvem os subscritos de Index: Itensor.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Itensor.texi,v retrieving revision 1.8 retrieving revision 1.9 diff -u -d -r1.8 -r1.9 --- Itensor.texi 30 Jul 2006 19:44:08 -0000 1.8 +++ Itensor.texi 4 Nov 2006 10:41:44 -0000 1.9 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Itensor.texi/1.38/Mon May 15 07:53:34 2006// +@c /Itensor.texi/1.39/Thu Nov 2 05:47:38 2006// @c RECOMMEND REVISE TEXT THROUGHOUT TO LOSE NOTION OF TIME RELATIVE TO PRESENT @c LOOK FOR "NOW", "OLD", "NEW", "RECENT", "EARLIER", DATES @@ -1295,23 +1295,23 @@ (%t3) - a ichr2 - a ichr2 + a + ichr2 a i %1 j s %1 j i s i j,s %1 s i j (%i4) imetric:g; -(%o4) g +(%o4) g (%i5) ishow(ev(%th(2),ichr2))$ - %1 %4 k - g a (g - g + g ) - i %1 s %4,j j s,%4 j %4,s + %1 %4 k + g a (g - g + g ) + i %1 s %4,j j s,%4 j %4,s (%t5) - ------------------------------------------ - 2 + 2 %1 %3 k - g a (g - g + g ) - %1 j s %3,i i s,%3 i %3,s + g a (g - g + g ) + %1 j s %3,i i s,%3 i %3,s - ------------------------------------------ - 2 + 2 k %2 %1 - g a (g - g + g ) - i j s %2,%1 %1 s,%2 %1 %2,s k + g a (g - g + g ) + i j s %2,%1 %1 s,%2 %1 %2,s k + ------------------------------------------- + a - 2 i j,s + 2 i j,s (%i6) @end example @@ -1756,12 +1756,12 @@ @end defvr -@subsection @'Algebra exterior +@subsection @'Algebra externa (como em produto externo) O pacote @code{itensor} pode executar opera@,{c}@~oes sobre campos tensores covariantes totalmente antisim@'etricos. Um campo tensor totalmente antisim@'etrico de classe (0,L) corresponde a uma forma diferencial L. Sobre esses objetos, uma -opera@,{c}@~ao de multiplica@,{c}@~ao funciona como um produto exterior, ou produto cunha, +opera@,{c}@~ao de multiplica@,{c}@~ao funciona como um produto externo, ou produto cunha, @'e definido. Desafortunadamente, nem todos os autores concordam sobre a defini@,{c}@~ao de produto @@ -1810,7 +1810,8 @@ "tensorial" @'e usada, de outra forma a segunda, defini@,{c}@~ao "geom@'etrica" ir@'a ser aplicada. -@defvr {Operator} ~ +@defvr {Operador} ~ +@fnindex Produto Externo O operador do produto cunha @'e definido como sendo o acento til @code{~}. O til @'e um operador bin@'ario. Seus argumentos podem ser express@~oes envolvendo escalares, @@ -1848,6 +1849,7 @@ @end defvr @defvr {Operator} | +@fnindex Contra@,{c}@~ao com um vetor A barra vertical @code{|} denota a opera@,{c}@~ao bin@'aria "contra@,{c}@~ao com um vetor". Quando um tensor covariante totalmente antisim@'etrico @'e contra@'ido @@ -1882,8 +1884,8 @@ @deffn {Fun@value{cedilha}@~ao} extdiff (@var{expr}, @var{i}) -Calcula a derivada exterior de @var{expr} com rela@,{c}@~ao ao @'indice -@var{i}. A derivada exterior @'e formalmente definida como o produto +Calcula a derivada externa de @var{expr} com rela@,{c}@~ao ao @'indice +@var{i}. A derivada externa @'e formalmente definida como o produto cunha do operador de derivada parcial e uma forma diferencial. Como tal, essa opera@,{c}@~ao @'e tamb@'em controlada atrav@'es da escolha de @code{igeowedge_flag}. Por exemplo: @@ -1961,7 +1963,7 @@ @defvr {Vari@'avel de Op@value{cedilha}@~ao} igeowedge_flag Valor padr@~ao: @code{false} -Controla o comportamento de produto cunha e derivada exterior. Quando +Controla o comportamento de produto cunha e derivada externa. Quando for esconhida para @code{false} (o padr@~ao), a no@,{c}@~ao de formas diferenciais ir@'a corresponder @`aquela de um campo tensor covariante totalmente antisim@'etrico. Quando escolhida para @code{true}, formas diferenciais ir@~ao concordar com a no@,{c}@~ao do @@ -2085,4 +2087,3 @@ _extlc @end example - Index: Command.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Command.texi,v retrieving revision 1.9 retrieving revision 1.10 diff -u -d -r1.9 -r1.10 --- Command.texi 23 Jul 2006 09:49:43 -0000 1.9 +++ Command.texi 4 Nov 2006 10:41:44 -0000 1.10 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Command.texi/1.41/Sat Jul 8 08:14:19 2006/-ko/ +@c /Command.texi/1.42/Thu Nov 2 05:46:44 2006/-ko/ @iftex @hyphenation{si-na-li-za-do-res} @hyphenation{de-mo-ra-da-men-te} @@ -16,6 +16,7 @@ @c NEEDS EXAMPLES @c THIS ITEM IS VERY IMPORTANT !! @deffn {Operador} ' +@fnindex Operador Ap@'ostrofo O operador ap@'ostrofo @code{'} evita avalia@,{c}@~ao. Aplicado a um s@'imbolo, @@ -137,6 +138,7 @@ @end deffn @deffn {Operator} '' +@fnindex Operador ap@'ostrofo-ap@'ostrofo O operador ap@'ostrofo-ap@'ostrofo @code{'@w{}'} (dois ap@'ostrofost) modifica avalia@,{c}@~ao em express@~oes de entrada. Aplicado a uma express@~ao geral @var{expr}, ap@'ostrofo-ap@'ostrofo faz com que o valor de @var{expr} @@ -404,7 +406,7 @@ @code{eval} faz com que uma avalia@,{c}@~ao posterior de @var{expr} ocorra. (Veja passo (5) adiante.) @code{eval} pode ocorrer multiplas vezes. -Para cada instância de @code{eval}, a express@~ao @'e avaliada novamente. +Para cada inst@^ancia de @code{eval}, a express@~ao @'e avaliada novamente. @item @code{A} onde @code{A} @'e um @'atomo declarado seja um sinalizador de avalia@,{c}@~ao (veja @code{evflag}) faz com que @code{A} seja associado a @@ -474,7 +476,7 @@ nela serem avalidas e que @code{ev(F(x))} dessa forma possa comportar-se como @code{F(ev(x))}. @item -Para cada instância de @code{eval} nos argumentos, os passos (3) e (4) s@~ao repetidos. +Para cada inst@^ancia de @code{eval} nos argumentos, os passos (3) e (4) s@~ao repetidos. @end enumerate Exemplos Index: Constants.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Constants.texi,v retrieving revision 1.1 retrieving revision 1.2 diff -u -d -r1.1 -r1.2 --- Constants.texi 6 Dec 2005 23:31:59 -0000 1.1 +++ Constants.texi 4 Nov 2006 10:41:44 -0000 1.2 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Constants.texi/1.11/Sun Nov 27 22:23:57 2005/-ko/ +@c /Constants.texi/1.12/Thu Nov 2 05:46:44 2006/-ko/ @menu * Defini@value{cedilha}@~oes para Constantes:: @end menu @@ -8,6 +8,8 @@ @section Defini@value{cedilha}@~oes para Constantes @defvr {Constante} %e +@vrindex e +@vrindex Base do logar@'itmo natural - A base dos logar@'itmos naturais, @math{e}, @'e representada no Maxima como @code{%e}. @@ -19,21 +21,27 @@ @end defvr @defvr {Constante} inf +@vrindex Infinito Real - infinito positivo real. @end defvr @defvr {Constante} infinity +@vrindex Infinito Complexo - infinito complexo. @end defvr @defvr {Constante} minf +@vrindex Menos infinito +@vrindex Infinito negativo + - menos infinito real. @end defvr @defvr {Constante} %pi +@vrindex pi - "pi" @'e representado no Maxima como @code{%pi}. @end defvr Index: Equations.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Equations.texi,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- Equations.texi 29 Jul 2006 09:31:34 -0000 1.6 +++ Equations.texi 4 Nov 2006 10:41:44 -0000 1.7 @@ -1,12 +1,11 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Equations.texi/1.23/Wed Jul 26 08:57:39 2006/-ko/ +@c /Equations.texi/1.24/Thu Nov 2 05:46:56 2006/-ko/ @c end concepts Equations @menu * Defini@value{cedilha}@~oes para Equa@value{cedilha}@~oes:: @end menu @node Defini@value{cedilha}@~oes para Equa@value{cedilha}@~oes, , Equa@value{cedilha}@~oes, Equa@value{cedilha}@~oes - @section Defini@value{cedilha}@~oes para Equa@value{cedilha}@~oes @c NEED A DESCRIPTION OF %rnum AS WELL @@ -186,7 +185,7 @@ ir@'a sempre retornar uma express@~ao equivalente (mas fatorada), se @code{polyfactor} for @code{true}. -Para polin@^omios complexos um algor@'itmo por Jenkins and Traub @'e +Para polin@^omios complexos um algor@'itmo por Jenkins e Traub @'e usado (Algorithm 419, @i{Comm. ACM}, vol. 15, (1972), p. 97). Para polin@^omios reais o algor@'itmo usado @'e devido a Jenkins (Algorithm 493, @i{ACM TOMS}, vol. 1, (1975), p.178). @@ -554,19 +553,80 @@ muito grandes onde substitui@,{c}@~ao em equa@,{c}@~oes anteriores poder@'a causar a gera@,{c}@~ao de express@~oes extremamente largas. -Quando @code{linsolve_params} @'e @code{true}, +Quando @code{linsolve_params} for @code{true}, @code{linsolve} tamb@'em gera s@'imbolos @code{%r} usados para representar par@^ametros arbitr@'arios descritos no manual sob @code{algsys}. De outra forma, @code{linsolve} resolve um menor-determinado sistema de equa@,{c}@~oes com algumas vari@'aveis expressas em termos de outras. +Quando @code{programmode} for @code{false}, +@code{linsolve} mostra a solu@,{c}@~ao com express@~oes intermedi@'arias com r@'otulos (@code{%t}), +e retorna a lista de r@'otulos. + +@c ===beg=== +@c e1: x + z = y; +@c e2: 2*a*x - y = 2*a^2; +@c e3: y - 2*z = 2; +@c [globalsolve: false, programmode: true]; +@c linsolve ([e1, e2, e3], [x, y, z]); +@c [globalsolve: false, programmode: false]; +@c linsolve ([e1, e2, e3], [x, y, z]); +@c ''%; +@c [globalsolve: true, programmode: false]; +@c linsolve ([e1, e2, e3], [x, y, z]); +@c ''%; +@c [x, y, z]; +@c [globalsolve: true, programmode: true]; +@c linsolve ([e1, e2, e3], '[x, y, z]); +@c [x, y, z]; +@c ===end=== @example -(%i1) e1: x + z = y$ -(%i2) e2: 2*a*x - y = 2*a^2$ -(%i3) e3: y - 2*z = 2$ -(%i4) linsolve ([e1, e2, e3], [x, y, z]); -(%o4) [x = a + 1, y = 2 a, z = a - 1] +(%i1) e1: x + z = y; +(%o1) z + x = y +(%i2) e2: 2*a*x - y = 2*a^2; + 2 +(%o2) 2 a x - y = 2 a +(%i3) e3: y - 2*z = 2; +(%o3) y - 2 z = 2 +(%i4) [globalsolve: false, programmode: true]; +(%o4) [false, true] +(%i5) linsolve ([e1, e2, e3], [x, y, z]); +(%o5) [x = a + 1, y = 2 a, z = a - 1] +(%i6) [globalsolve: false, programmode: false]; +(%o6) [false, false] +(%i7) linsolve ([e1, e2, e3], [x, y, z]); +Solution + +(%t7) z = a - 1 + +(%t8) y = 2 a + +(%t9) x = a + 1 +(%o9) [%t7, %t8, %t9] +(%i9) ''%; +(%o9) [z = a - 1, y = 2 a, x = a + 1] +(%i10) [globalsolve: true, programmode: false]; +(%o10) [true, false] +(%i11) linsolve ([e1, e2, e3], [x, y, z]); +Solution + +(%t11) z : a - 1 + +(%t12) y : 2 a + +(%t13) x : a + 1 +(%o13) [%t11, %t12, %t13] +(%i13) ''%; +(%o13) [z : a - 1, y : 2 a, x : a + 1] +(%i14) [x, y, z]; +(%o14) [a + 1, 2 a, a - 1] +(%i15) [globalsolve: true, programmode: true]; +(%o15) [true, true] +(%i16) linsolve ([e1, e2, e3], '[x, y, z]); +(%o16) [x : a + 1, y : 2 a, z : a - 1] +(%i17) [x, y, z]; +(%o17) [a + 1, 2 a, a - 1] @end example @end deffn @@ -652,17 +712,64 @@ @end defvr -@c NEEDS WORK -@deffn {Fun@,{c}@~ao} realroots (@var{poly}, @var{bound}) -Acha todas as ra@'izes reais de um polin@^omio tamb@'em real de -uma @'unica vari@'avel poly dentro de uma toler@^ancia de limite que, se menor -que 1, faz com que todas as ra@'izes da integral sejam achadas exatamente. O par@^ametro -limite pode ser arbitrariamente pequeno com o objetivo de encontrar qualquer precis@~ao -desejada. O primeiro argumento pode tamb@'em ser uma equa@,{c}@~ao. @code{realroots} escolhe -@code{multiplicities}, @'util em caso de multiplas ra@'izes. @code{realroots (@var{p})} @'e -equivalente a @code{realroots (@var{p}, rootsepsilon)}. @code{rootsepsilon} @'e um -n@'umero real usado para estabelecer um intervalo de confid@^encia para as ra@@'izes. -Fa@,{c}a @code{example (realroots)} para um exemplo. +@deffn {Fun@,{c}@~ao} realroots (@var{expr}, @var{bound}) +@deffnx {Fun@,{c}@~ao} realroots (@var{eqn}, @var{bound}) +@deffnx {Fun@,{c}@~ao} realroots (@var{expr}) +@deffnx {Fun@,{c}@~ao} realroots (@var{eqn}) +Calcula aproxima@,{c}@~oes racionais das ra@'izes reais da express@~ao polinomial @var{expr} +ou da equa@,{c}@~ao polinomial @var{eqn} de uma vari@'avel, +dentro de uma toler@^ancia de @var{bound}. +coeficientes de @var{expr} ou de @var{eqn} devem ser n@'umeros literais; +constantes s@'imbolo tais como @code{%pi} s@~ao rejeitadas. + +@code{realroots} atribui as multiplicidades das ra@'izes que encontrar +para a vari@'avel global @code{multiplicities}. + +@code{realroots} constr@'oi uma seq@"u@^encia de Sturm para delimitar cada ra@'iz, +e ent@~ao palica a bisec@,{c}@~ao para redefinir as aproxima@,{c}@~oes. +Todos os coeficientes s@~ao convertidos para os equivalentes racionais antes da busca por ra@'izes, +e c@'alculos s@~ao realizados por meio de aritm@'etica racional exata. +Mesmo se alguns coeficientes forem n@'umeros em ponto flutuante, +os resultados s@~ao racionais (a menos que for@,{c}ados a n@'umeros em ponto flutuante por @code{float} ou por @code{numer} flags). + +Quando @var{bound} for menor que 1, todas as ra@'izes inteiras s@~ao encontradas exatamente. +Quando @var{bound} n@~ao for especificado, ser@'a assumido como sendo igual @`a vari@'avel globa @code{rootsepsilon}. + +Quando a var@'avel global @code{programmode} for @code{true}, +@code{realroots} retorna uma lista da forma @code{[x = @var{x_1}, x = @var{x_2}, ...]}. +Quando @code{programmode} for @code{false}, +@code{realroots} cria r@'otulos de express@~oes intermedi@'arias @code{%t1}, @code{%t2}, ..., +atribui os resultados a eles, e retorna a lista de r@'otulos. + +Exemplos: +@c ===beg=== +@c realroots (-1 - x + x^5, 5e-6); +@c ev (%[1], float); +@c ev (-1 - x + x^5, %); +@c ===end=== + +@example +(%i1) realroots (-1 - x + x^5, 5e-6); + 612003 +(%o1) [x = ------] + 524288 +(%i2) ev (%[1], float); +(%o2) x = 1.167303085327148 +(%i3) ev (-1 - x + x^5, %); +(%o3) - 7.396496210176905E-6 +@end example + +@c ===beg=== +@c realroots (expand ((1 - x)^5 * (2 - x)^3 * (3 - x)), 1e-20); +@c multiplicities; +@c ===end=== + +@example +(%i1) realroots (expand ((1 - x)^5 * (2 - x)^3 * (3 - x)), 1e-20); +(%o1) [x = 1, x = 2, x = 3] +(%i2) multiplicities; +(%o2) [5, 3, 1] +@end example @end deffn Index: Plotting.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Plotting.texi,v retrieving revision 1.16 retrieving revision 1.17 diff -u -d -r1.16 -r1.17 --- Plotting.texi 27 Jul 2006 12:39:02 -0000 1.16 +++ Plotting.texi 4 Nov 2006 10:41:44 -0000 1.17 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Plotting.texi/1.28/Wed Jul 26 08:58:24 2006/-ko/ +@c /Plotting.texi/1.29/Thu Nov 2 05:48:32 2006/-ko/ @menu * Defini@value{cedilha}@~oes para Montagem de Gr@'aficos:: @end menu @@ -474,6 +474,20 @@ Especifica a amplitude da vari@'avel param@'etrica para [0, 10]. @item +Op@,{c}@~ao: @code{plot_realpart} +Quando @code{plot_realpart} for @code{true}, +a parte real de um valor complexo @var{x} @'e mostrada; +isso @'e equivalente a mostrar @code{realpart(@var{x})} em lugar de @var{x}. +De outra forma, +somente valores com a parte imagin@'aria igual a 0 s@~ao mostrados na tela, +e valores complexos s@~ao ignorados. +@example +plot2d (log(x), [x, -5, 5], [plot_realpart, false]); +plot2d (log(x), [x, -5, 5], [plot_realpart, true]); +@end example +O valor padr@~ao @'e @code{false}. + +@item Op@,{c}@~ao: @code{nticks} N@'umero de pontos iniciais usado pela rotina adaptativa de montagem do gr@'afico. @@ -774,7 +788,7 @@ @noindent nesse caso o mouse pode ser usado para rotacionar a visualiza@,{c}@~ao para olhar na superf@'icie -de diferentes ângulos. +de diferentes @^angulos. Um exemplo do terceiro modelo de argumento @'e Index: Number.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Number.texi,v retrieving revision 1.8 retrieving revision 1.9 diff -u -d -r1.8 -r1.9 --- Number.texi 23 Jul 2006 12:20:58 -0000 1.8 +++ Number.texi 4 Nov 2006 10:41:44 -0000 1.9 @@ -1,5 +1,5 @@ @c Language: Portuguese, Encoding: iso-8859-1 -@c /Number.texi/1.18/Sat Jul 8 08:14:57 2006/-ko/ +@c /Number.texi/1.19/Thu Nov 2 05:48:00 2006/-ko/ @c end concepts Number Theory @menu * Defini@value{cedilha}@~oes para Teoria dos N@'umeros:: @@ -295,6 +295,7 @@ @end deffn @defvr {Constante} %gamma +@vrindex Constante de Euler-Mascheroni A constante de Euler-Mascheroni, 0.5772156649015329 .... @c DOUBTLESS THERE IS MORE TO SAY HERE. |
From: Barton W. <wil...@us...> - 2006-11-01 23:22:31
|
Update of /cvsroot/maxima/maxima/tests In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv22176/tests Modified Files: testsuite.lisp Added Files: rtest_equal.mac Log Message: appending regression tests for meqp. --- NEW FILE: rtest_equal.mac --- (prederror : false,0); 0$ /* bug 1489164 */ is(equal(%i,0)); false$ /* bug 1547584 */ is(equal([a],[a,b])); false$ /* bug 1435600 */ is(equal(false,false)); true$ is(equal(false,true)); false$ is(equal(true,true)); true$ /* bug 1496329 */ is(equal(rat(matrix([x])),matrix([x]))); true$ is (equal (ident (2), rat (ident (2)))); true$ /* bug 649669*/ is(equal([x],[rat(x)])); true$ /* bug 990924 */ is(equal((%e^(%i*z)-%e^-(%i*z)), 0)); 'unknown$ /* bug 851436 */ is(equal(rat((x+y+a)^3,x),rat((x+y+a)^3,y))); true$ /* bug 884947 */ is(equal([1],[1])); true$ is(equal([0],[1])); false$ is(equal([a,0],[a,1])); false$ is(equal([a,b],[a,c])); 'unknown$ /* bug 812968 */ is(equal(x/(2*x*sqrt(2)) - 1/(2*x*sqrt(2)), (x-1)/(2*x*sqrt(2)))); true$ is(equal(1/sqrt(2),sqrt(2)/2)); true$ /* bug 902694 */ is(equal(ind,ind)); false$ is(equal(und,und)); false$ /* bug 885795 */ (assume(equal(i,j)),0); 0$ is(equal(x[i], x[j])); true$ is(equal(f(i),f(j))); true$ (forget(equal(i,j)),0); 0$ is(equal(inf,infinity)); false$ is(equal(minf,minf)); true$ is(equal(minf,infinity)); false$ is(equal(minf,und)); false$ is(equal(minf,ind)); false$ is(equal(%i,0)); false$ is(equal(%i, x)); false$ is(equal(%i,x + %i)); 'unknown$ is(equal(und, x)); false$ is(equal(inf, x)); false$ is(equal(inf,0)); false$ is(equal(infinity,x)); false$ is(equal(0,1)); false$ is(equal(0.23, 9.78)); false$ is(equal(0.23, 9.78b0)); false$ is(equal(23/10, 9.78b0)); false$ is(equal(7,[1,2,3])); false$ is(equal(%pi,22/7)); false$ is(equal(1/sqrt(2), sqrt(2)/2)); true$ is(equal(x,x)); true$ is(equal(x,x+%pi)); false$ is(equal((x+1)^2, x^2 + 2*x+1)); true$ is(equal(x,0)); 'unknown$ is(equal(x,%i)); false$ is(equal(x + %i,x)); false$ is(equal(x^2+1,x^2/5)); false$ is(equal(%i*x,%i)); 'unknown$ is(equal([a],[b])); 'unknown$ is(equal([a],[a,b])); false$ is(equal([a],[a])); true$ is(equal(a < b, a <= b)); false$ is(equal(a <= b, a <= b)); true$ is(equal(rat(x),x)); true$ is(equal(matrix([x]), rat(matrix([x])))); true$ is(equal(matrix([x,y]), matrix([x,z]))); 'unknown$ is(equal(matrix([x,y],[p,q]), matrix([p,q],[x,y]))); 'unknown$ is(equal(matrix([x,y],[p,q]), matrix([p,q,s],[x,y,8]))); false$ is(equal(set(u,n,k), set(u,n,k,u,n,k))); true$ is(equal(set(a,b,c), set(b,a,a))); 'unknown$ is(equal(abs(1 + %i*z), z - %i)); false$ (assume(equal(x,y),equal(y,z)),0); 0$ is(equal(x,z)); true$ is(equal([x],[z])); true$ is(equal(f(x), f(z))); true$ is(equal(f(x,y) + %pi, f(y,z) + %pi)); true$ is(equal(rat(x,y), rat(z,x))); true$ is(equal(matrix([x,y],[4,5]), matrix([y,z],[4,5]))); true$ is(equal(matrix([x,y],[4,5]), matrix([y,z],[4,15]))); false$ is(equal(set(x,z),set(x))); true$ is(equal(set(x,sqrt(2)), set(z,sqrt(2)))); true$ is(equal(x + %i * y, y + %i * z)); true$ is(equal(exp(%i * x), exp(%i * z))); true$ is(equal([x,x],[y,z])); true$ is(equal([y,y],[x,z])); true$ is(equal(x+y,2*z)); true$ is(equal(x+y+z/3, 7*x/3)); true$ is(equal(max(x,a),max(y,a))); true$ is(equal(max(x,y,z,8), max(x,8))); true$ (forget(equal(x,y), equal(y,z)),0); 0$ is(equal(zeroa, zerob)); false$ is(equal([zeroa],[zerob])); false$ is(equal(matrix(),matrix())); true$ is(equal(matrix([]),matrix([]))); true$ is(equal(matrix([]),matrix([],[]))); false$ is(equal([],[])); true$ is(equal(set(),set())); true$ is(equal(a = b, a = b)); true$ is(equal(a = b, b = a)); 'unknown$ is(equal(a < b, b < a)); unknown$ is(equal(7,[a,b])); false$ is(equal([a,b],7)); false$ is(equal([a,b], a = b)); false$ is(equal(a=b,[a,b])); false$ is(equal(a < b, b <= b))$ false$ is(equal([true], [])); false$ is(equal([true], [true])); true$ is(equal([false], [true])); false$ is(equal(false,[false])); false$ (oak : set(macrocarpa, rubra, alba),0); 0$ is(equal([macrocarpa, rubra, alba],oak)) ; false$ is(equal(oak, [macrocarpa, rubra, alba])); false$ is(equal(set(macrocarpa, rubra, alba),oak)); true$ is(equal(oak, set(macrocarpa, rubra, alba))); true$ (assume(equal(macrocarpa, burr), equal(rubra,red), equal(alba,white)),0); 0$ is(equal(oak,set(burr,red,white))); true$ (remvalue(oak),0); 0$ (forget(equal(macrocarpa, burr), equal(rubra,red), equal(alba,white)),0); 0$ (assume(equal(a,b),equal(b,c),equal(c,d)),0); 0$ is(equal(a*d,b*c)); true$ is(equal(a+b+c, 2*a+d)); true$ is(equal(a+b^2-c^3, b + a^2 - a^3)); true$ is(equal(f(a,b,c),f(d,b,a))); true$ is(equal(set(1,a,d^2), set(1+a-d,d,a,b,c-a+d,a^2))); true$ (forget(equal(a,b),equal(b,c),equal(c,d)),0); 0$ is(equal(lambda([], 9), lambda([], 9))); true$ is(equal(lambda([], x), lambda([], y))); unknown$ is(equal(lambda([x], x), lambda([z],z))); true$ is(equal(lambda([x], x), lambda([z],z^2))); unknown$ is(equal(lambda([x,y], x), lambda([z],z))); false$ is(equal(lambda([x],true), lambda([z],false))); false$ is(equal(lambda([x],false), lambda([z],false))); true$ (assume(equal(p,0)),0); 0$ is(equal(lambda([x],x+p), lambda([y],y-p))); true$ (forget(equal(p,0)),0); 0$ is(equal(sum(1/kk,kk,1,n), sum(1/ii,ii,1,n))); true$ is(equal(sum(1/kk,kk,1,m), sum(1/ii,ii,1,n))); 'unknown$ is(equal(sqrt(5) - sum(%pi/kk,kk,1,n), sqrt(5) - sum(%pi/ii,ii,1,n))); true$ is(equal(sqrt(5) - sum(%pi/kk,kk,1,m), sqrt(5) - sum(%pi/ii,ii,1,n))); 'unknown$ is(equal(sum(sqrt(2)/i^2,i,1,inf), sum(sqrt(2)/j^2,j,1,inf))); true$ is(equal(sum(sum(1/(i+j),i,1,j),j,1,n), sum(sum(1/(ii+jj),ii,1,jj),jj,1,n))); true$ is(equal(sum(product((ii+jj)^2,ii,1,42*jj),jj,-7,n), sum(product((i+j)^2,i,1,42*j),j,-7,n))); true$ is(equal(set(a), set(inf))); false$ is(equal([a], [inf])); false$ is(equal(set(a,b,c), set(a,b,c,minf))); false$ is(equal(set(a,b,c), set(a,b,c,d))); unknown$ is(equal(set(a), set(und))); false$ is(equal(set(inf,und), set(inf,und))); true$ is(equal(set(a), set(a,inf))); false$ is(equal(set(a,inf),set(a))); false$ is(equal(set(a,b), set(a,inf))); false$ Index: testsuite.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/tests/testsuite.lisp,v retrieving revision 1.31 retrieving revision 1.32 diff -u -d -r1.31 -r1.32 --- testsuite.lisp 27 Mar 2006 19:49:16 -0000 1.31 +++ testsuite.lisp 1 Nov 2006 23:22:26 -0000 1.32 @@ -27,4 +27,5 @@ "rtest_everysome" "rtestint" "rtestifactor" + "rtest_equal" )) |
From: Barton W. <wil...@us...> - 2006-11-01 23:20:09
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv20865/src Modified Files: compar.lisp Log Message: new version of meqp Index: compar.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/compar.lisp,v retrieving revision 1.15 retrieving revision 1.16 diff -u -d -r1.15 -r1.16 --- compar.lisp 1 Nov 2006 21:03:31 -0000 1.15 +++ compar.lisp 1 Nov 2006 23:20:02 -0000 1.16 @@ -610,12 +610,106 @@ (defmfun like (x y) (alike1 (specrepcheck x) (specrepcheck y))) -(defmfun meqp (x y) - (cond ((like x y)) - (t (compare x y) - (cond ((eq '$zero sign)) - ((memq sign '($pos $neg $pn)) nil) - (t (c-$zero odds evens)))))) +(setf (get '$und 'sysconst) t) +(setf (get '$ind 'sysconst) t) +(setf (get '$zeroa 'sysconst) t) +(setf (get '$zerob 'sysconst) t) + +;; There have been some conversations about NaN on the list, but +;; the issue hasn't been settled. + +(defvar indefinites `($und $ind)) + +;; Other than sums, products, and lambda forms, meqp knows nothing +;; about dummy variables. Because of the way niceindices chooses names +;; for the sum indicies, it's necessary to locally assign a new value to +;; niceindicespref. + +(defun meqp-by-csign (z a b) + (let ((sgn) ($niceindicespref `((mlist) ,(gensym) ,(gensym) ,(gensym)))) + (setq z ($niceindices z)) + (setq sgn (csign z)) + (cond ((eq '$zero sgn) t) + + ((eq sgn t) + (setq z ($rectform z)) + (if (or (eq nil (meqp ($realpart z) 0)) (eq nil (meqp ($imagpart z) 0))) nil `(($equal) ,a ,b))) + + ((member sgn '($pos $neg $pn)) nil) + + (t `(($equal) ,a ,b))))) + +;; For each fact of the form equal(a,b) in the active context, do e : ratsubst(b,a,e). + +(defun equal-facts-simp (e) + (let ((f (margs ($facts)))) + (dolist (fi f e) + (if (op-equalp fi '$equal) (setq e ($ratsubst (nth 2 fi) (nth 1 fi) e)))))) + +(defun meqp (a b) + (let ((z)) + (setq a (specrepcheck a)) + (setq b (specrepcheck b)) + + (cond ((or (like a b)) (not (member a indefinites))) + + ((or (member a indefinites) (member b indefinites) + (member a infinities) (member b infinities)) nil) + + ((and (symbolp a) (or (eq t a) (eq nil a) (get a 'sysconst)) + (symbolp b) (or (eq t b) (eq nil b) (get b 'sysconst))) nil) + + ((or (mbagp a) (mrelationp a) (mbagp b) (mrelationp b)) + (cond ((and (or (and (mbagp a) (mbagp b)) (and (mrelationp a) (mrelationp b))) + (eq (mop a) (mop b)) (= (length (margs a)) (length (margs b)))) + (setq z (list-meqp (margs a) (margs b))) + (if (or (eq z t) (eq z nil)) z `(($equal) ,a ,b))) + (t nil))) + + ((and (op-equalp a 'lambda) (op-equalp b 'lambda)) (lambda-meqp a b)) + (($setp a) (set-meqp a b)) + (t (meqp-by-csign (equal-facts-simp ($ratsimp (sub a b))) a b))))) + +(defun list-meqp (p q) + (let ((z)) + (cond ((or (null p) (null q)) (and (null p) (null q))) + (t + (setq z (meqp (car p) (car q))) + (cond ((eq z nil) nil) + ((or (eq z '$unknown) (op-equalp z '$equal)) z) + (t (list-meqp (cdr p) (cdr q)))))))) + +(defun lambda-meqp (a b) + (let ((z)) + (cond ((= (length (second a)) (length (second b))) + (let ((x) (n ($length (second a)))) + (dotimes (i n (push '(mlist) x)) (push (gensym) x)) + (setq z (meqp (mfuncall '$apply a x) (mfuncall '$apply b x))) + (if (or (eq t z) (eq nil z)) z `(($equal) ,a ,b)))) + (t nil)))) + +(defun set-meqp (a b) + (let ((aa) (bb)) + (setq aa (equal-facts-simp a)) + (setq bb (equal-facts-simp b)) + + (cond ((or (not ($setp bb)) (and ($emptyp aa) (not ($emptyp bb))) (and ($emptyp bb) (not ($emptyp aa)))) + nil) + + ((and (= (length aa) (length bb)) + (every #'(lambda (p q) (eq t (meqp p q))) (margs aa) (margs bb))) t) + + ((set-not-eqp (margs aa) (margs bb)) nil) + + (t `(($equal ,a ,b)))))) + +(defun set-not-eqp (a b) + (catch 'done + (dolist (ak a) + (if (every #'(lambda (s) (eq nil (meqp ak s))) b) (throw 'done t))) + (dolist (bk b) + (if (every #'(lambda (s) (eq nil (meqp bk s))) a) (throw 'done t))) + (throw 'done nil))) (defmfun mgrp (x y) (compare x y) |
From: Barton W. <wil...@us...> - 2006-11-01 21:17:40
|
Update of /cvsroot/maxima/maxima/tests In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv32480/tests Modified Files: rtest6a.mac Log Message: Either we need to quote the correct output of assume, or not check it. I decided to not check it. Index: rtest6a.mac =================================================================== RCS file: /cvsroot/maxima/maxima/tests/rtest6a.mac,v retrieving revision 1.8 retrieving revision 1.9 diff -u -d -r1.8 -r1.9 --- rtest6a.mac 4 Apr 2005 00:47:46 -0000 1.8 +++ rtest6a.mac 1 Nov 2006 21:17:37 -0000 1.9 @@ -113,8 +113,8 @@ 1; errcatch(ev(diff(sin(x),x),x = 0)); []; -assume(not(equal(i,-1))); -[not equal(i,-1)]$ +(assume(not(equal(i,-1))),0); +0$ ev(integrate(x^i,x),i = -1); log(x); errcatch(subst(-1,i,integrate(x^i,x))); |
From: Barton W. <wil...@us...> - 2006-11-01 21:03:36
|
Update of /cvsroot/maxima/maxima/src In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv26345/src Modified Files: compar.lisp Log Message: Fix for unreported bug featurep(x[1](2),integer) --> Lisp error. New code from Stavros Index: compar.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/src/compar.lisp,v retrieving revision 1.14 retrieving revision 1.15 diff -u -d -r1.14 -r1.15 --- compar.lisp 27 Jul 2006 05:37:45 -0000 1.14 +++ compar.lisp 1 Nov 2006 21:03:31 -0000 1.15 @@ -1100,23 +1100,34 @@ (setf (get '$charfun 'integer-valued) t) (defun maxima-integerp (x) - (let ((x-op (if (and (consp x) (consp (car x))) (mop x) nil)) ($prederror nil)) - (cond ((integerp x)) - ((mnump x) nil) - ((and (symbolp x) (or (kindp x '$integer) (kindp x '$even) (kindp x '$odd)))) - ((and (eq x-op 'mrat) (integerp (cadr x)) (equal (cddr x) 1))) - ((and x-op (or ($featurep ($verbify x-op) '$integervalued) (get x-op 'integer-valued)))) - ((and (get x-op 'maps-integers-to-integers) (every #'maxima-integerp (margs x)))) - ((and (eq x-op 'mfactorial) (not (mevalp (mlsp (first (margs x)) 0))))) - - ((and (eq x-op 'mtimes) - (mnump (first (margs x))) - (integerp (mul 2 (first (margs x)))) - (every 'maxima-integerp (rest (margs x))) - (some #'(lambda (s) ($featurep s '$even)) (rest (margs x))))) - - ((and (eq x-op 'mexpt) (every #'maxima-integerp (margs x)) - (eq nil (mevalp (mlsp (nth 2 x) 0)))))))) + (cond ((integerp x)) + ((mnump x) nil) + ((and (symbolp x) (or (kindp x '$integer) (kindp x '$even) (kindp x '$odd)))) + (t (let ((x-op (and (consp x) (consp (car x)) (caar x))) ($prederror nil)) + (cond ((null x-op) nil) + ((not (symbolp x-op)) nil) ; fix for mqapply at some point? + ((eq x-op 'mrat) (and (integerp (cadr x)) (equal (cddr x) 1))) + ;; mtimes and mplus are generally handled by this clause + ((and (get x-op 'maps-integers-to-integers) (every #'maxima-integerp (margs x)))) + ;; Special case for 1/2*...*even + ((eq x-op 'mtimes) + (and (mnump (cadr x)) + (integerp (mul 2 (cadr x))) + (every 'maxima-integerp (cddr x)) + (some #'(lambda (s) ($featurep s '$even)) (rest (margs x))))) + ((eq x-op 'mexpt) + (and (every #'maxima-integerp (margs x)) + (null (mevalp (mlsp (caddr x) 0))))) + ;; ! in Maxima allows real arguments + ((eq x-op 'mfactorial) + (and (maxima-integerp (cadr x)) + (not (mevalp (mlsp (cadr x) 0))))) + ((eq x-op '%gamma) + (and (maxima-integerp (cadr x)) + (not (mevalp (mlsp (cadr x) 1))))) + ;; other x-ops + ((or ($featurep ($verbify x-op) '$integervalued) + (get x-op 'integer-valued)))))))) (defmfun nonintegerp (e) (let (num) |
From: Robert D. <rob...@us...> - 2006-11-01 14:54:56
|
Update of /cvsroot/maxima/maxima/share/diff_form In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv29294 Removed Files: coeflist.lisp format.lisp Log Message: Removing coeflist.lisp and format.lisp from share/diff_form because these two files are functionally identical to files of the same names in share/contrib/format (only differences are in comments). No other changes in share/diff_form are needed since load("coeflist.lisp") and load("format.lisp") find the files successfully in share/contrib/format . --- coeflist.lisp DELETED --- --- format.lisp DELETED --- |