| blob | 6f4fe97c3c6480277c3383e6017bccdeb2279bfb |
1 ;; -*- Mode: Lisp; Package: Maxima; Syntax: Common-Lisp; Base: 10 -*- ;;;;
2 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3 ;;; The data in this file contains enhancements. ;;;;;
4 ;;; ;;;;;
5 ;;; Copyright (c) 1984,1987 by William Schelter,University of Texas ;;;;;
6 ;;; All rights reserved ;;;;;
7 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
8 ;;; (c) copyright 1982 massachusetts institute of technology ;;;
9 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
15 ;;; this is the definite integration package.
16 ;; defint does definite integration by trying to find an
17 ;;appropriate method for the integral in question. the first thing that
18 ;;is looked at is the endpoints of the problem.
19 ;;
20 ;; i(grand,var,a,b) will be used for integrate(grand,var,a,b)
22 ;; References are to "Evaluation of Definite Integrals by Symbolic
23 ;; Manipulation", by Paul S. Wang,
24 ;; (http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-092.pdf;
25 ;; a better copy might be: https://maxima.sourceforge.io/misc/Paul_Wang_dissertation.pdf)
26 ;;
27 ;; nointegrate is a macsyma level flag which inhibits indefinite
28 ;;integration.
29 ;; abconv is a macsyma level flag which inhibits the absolute
30 ;;convergence test.
31 ;;
32 ;; $defint is the top level function that takes the user input
33 ;;and does minor changes to make the integrand ready for the package.
34 ;;
35 ;; next comes defint, which is the function that does the
36 ;;integration. it is often called recursively from the bowels of the
37 ;;package. defint does some of the easy cases and dispatches to:
38 ;;
39 ;; dintegrate. this program first sees if the limits of
40 ;;integration are 0,inf or minf,inf. if so it sends the problem to
41 ;;ztoinf or mtoinf, respectively.
42 ;; else, dintegrate tries:
43 ;;
44 ;; intsc1 - does integrals of sin's or cos's or exp(%i var)'s
45 ;; when the interval is 0,2 %pi or 0,%pi.
46 ;; method is conversion to rational function and find
47 ;; residues in the unit circle. [wang, pp 107-109]
48 ;;
49 ;; ratfnt - does rational functions over finite interval by
50 ;; doing polynomial part directly, and converting
51 ;; the rational part to an integral on 0,inf and finding
52 ;; the answer by residues.
53 ;;
54 ;; zto1 - i(x^(k-1)*(1-x)^(l-1),x,0,1) = beta(k,l) or
55 ;; i(log(x)*x^(x-1)*(1-x)^(l-1),x,0,1) = psi...
56 ;; [wang, pp 116,117]
57 ;;
58 ;; dintrad- i(x^m/(a*x^2+b*x+c)^(n+3/2),x,0,inf) [wang, p 74]
59 ;;
60 ;; dintlog- i(log(g(x))*f(x),x,0,inf) = 0 (by symmetry) or
61 ;; tries an integration by parts. (only routine to
62 ;; try integration by parts) [wang, pp 93-95]
63 ;;
64 ;; dintexp- i(f(exp(k*x)),x,a,inf) = i(f(x+1)/(x+1),x,0,inf)
65 ;; or i(f(x)/x,x,0,inf)/k. First case hold for a=0;
66 ;; the second for a=minf. [wang 96-97]
67 ;;
68 ;;dintegrate also tries indefinite integration based on certain
69 ;;predicates (such as abconv) and tries breaking up the integrand
70 ;;over a sum or tries a change of variable.
71 ;;
72 ;; ztoinf is the routine for doing integrals over the range 0,inf.
73 ;; it goes over a series of routines and sees if any will work:
74 ;;
75 ;; scaxn - sc(b*x^n) (sc stands for sin or cos) [wang, pp 81-83]
76 ;;
77 ;; ssp - a*sc^n(r*x)/x^m [wang, pp 86,87]
78 ;;
79 ;; zmtorat- rational function. done by multiplication by plog(-x)
80 ;; and finding the residues over the keyhole contour
81 ;; [wang, pp 59-61]
82 ;;
83 ;; log*rat- r(x)*log^n(x) [wang, pp 89-92]
84 ;;
85 ;; logquad0 log(x)/(a*x^2+b*x+c) uses formula
86 ;; i(log(x)/(x^2+2*x*a*cos(t)+a^2),x,0,inf) =
87 ;; t*log(a)/sin(t). a better formula might be
88 ;; i(log(x)/(x+b)/(x+c),x,0,inf) =
89 ;; (log^2(b)-log^2(c))/(2*(b-c))
90 ;;
91 ;; batapp - x^(p-1)/(b*x^n+a)^m uses formula related to the beta
92 ;; function [wang, p 71]
93 ;; there is also a special case when m=1 and a*b<0
94 ;; see [wang, p 65]
95 ;;
96 ;; sinnu - x^-a*n(x)/d(x) [wang, pp 69-70]
97 ;;
98 ;; ggr - x^r*exp(a*x^n+b)
99 ;;
100 ;; dintexp- see dintegrate
101 ;;
102 ;; ztoinf also tries 1/2*mtoinf if the integrand is an even function
103 ;;
104 ;; mtoinf is the routine for doing integrals on minf,inf.
105 ;; it too tries a series of routines and sees if any succeed.
106 ;;
107 ;; scaxn - when the integrand is an even function, see ztoinf
108 ;;
109 ;; mtosc - exp(%i*m*x)*r(x) by residues on either the upper half
110 ;; plane or the lower half plane, depending on whether
111 ;; m is positive or negative.
112 ;;
113 ;; zmtorat- does rational function by finding residues in upper
114 ;; half plane
115 ;;
116 ;; dintexp- see dintegrate
117 ;;
118 ;; rectzto%pi2 - poly(x)*rat(exp(x)) by finding residues in
119 ;; rectangle [wang, pp98-100]
120 ;;
121 ;; ggrm - x^r*exp((x+a)^n+b)
122 ;;
123 ;; mtoinf also tries 2*ztoinf if the integrand is an even function.
132 ;;;rsn* is in comdenom. does a ratsimp of numerator.
133 ;expvar
135 ;impvar
137 context
138 ;;LIMITP T Causes $ASKSIGN to do special things
139 ;;For DEFINT like eliminate epsilon look for prin-inf
140 ;;take realpart and imagpart.
141 integer-info
142 ;;If LIMITP is non-null ask-integer conses
143 ;;its assumptions onto this list.
144 ))
149 "When @code{true}, definite integration tries to find poles in the integrand
152 ;; Currently, if true, $solvetrigwarn is set to true. No additional
153 ;; debugging information is displayed.
158 nil
159 "When NIL, print a message that the principal value of the integral has
163 nil
164 "When non-NIL, a divergent integral will throw to `divergent.
172 ;; Set to true when OSCIP-VAR returns true in DINTEGRATE.
190 ;; Distribute $defint over equations, lists, and matrices.
222 (merror (intl:gettext "defint: variable of integration must be a simple or subscripted variable.~%defint: found ~M") ivar))
251 ;; If antideriv can't do it, returns nil
252 ;; use limit to evaluate every answer returned by antideriv.
256 ;;;Hack the expression up for exponentials.
259 ;; Is this expr a candidate for SININT ?
268 t)))
269 ;;ERF type things go here.
274 t))))))
294 ;; We have some subscripted variable that's not our variable
295 ;; (I think), so it's deg-lessp.
296 ;;
297 ;; FIXME: Is this the best way to handle this? Are there
298 ;; other cases we're mising here?
299 t)))
309 ;; This routine tries to take a limit a couple of ways.
315 ans
318 ivar
319 0
328 ;; Test whether fun2 is inverse of fun1 at val.
334 ;; integration change of variable
342 ())
344 ;; This is a hack! If nv is of the form b*x^n+a, we can
345 ;; solve the equation manually instead of using solve.
346 ;; Why? Because solve asks us for the sign of yx and
347 ;; that's bogus.
349 ;; Solve yx = b*x^n+a, for x. Any root will do. So we
350 ;; have x = ((yx-a)/b)^(1/n).
352 d
358 ))))
375 ;; d: original variable (ivar) as a function of 'yx
376 ;; ind: boolean flag
377 ;; nv: new variable ('yx) as a function of original variable (ivar)
386 ;; converts limits of integration to values for new variable 'yx
389 ;; rewrites exp, the integrand in terms of ivar, the
390 ;; integrand in terms of 'yx, and returns the new
391 ;; integrand.
396 ll1 ul1)
405 ;; wrapper around limit, returns nil if
406 ;; limit not found (nounform returned), or undefined ($und or $ind)
413 ans))))
427 #+nil
433 ;; D (not used? -- cwh)
446 ;; Look for integrals which involve log and exp functions.
447 ;; Maxima has a special algorithm to get general results.
458 %tan %sinh %cosh %tanh
459 %log %asin %acos %atan
460 %cot %acot %sec
461 %asec %csc %acsc
463 ;; Call ANTIDERIV with logabs disabled,
464 ;; because the Risch algorithm assumes
465 ;; the integral of 1/x is log(x), not log(abs(x)).
466 ;; Why not just assume logabs = false within RISCHINT itself?
467 ;; Well, there's at least one existing result which requires
468 ;; logabs = true in RISCHINT, so try to make a minimal change here instead.
509 ans)
512 ans)
527 ;;Should be a PROG inside of unwind-protect, but Multics has a compiler
528 ;;bug wrt. and I want to test this code now.
536 ;;;This seems((and (and (eq ul '$inf)
537 ;;;fairly losing (setq exp (subin (m+ ll ivar) exp))
538 ;;; (setq ll 0.))
539 ;;; (ztoinf exp ivar)))
544 ;; ((and (and (equal ul 1.)
545 ;; (equal ll 0.)) (zto1 exp)))
553 ;;;NOT COMPLETE for sin's and cos's.
575 ;; Call ANTIDERIV with logabs disabled,
576 ;; because the Risch algorithm assumes
577 ;; the integral of 1/x is log(x), not log(abs(x)).
578 ;; Why not just assume logabs = false within RISCHINT itself?
579 ;; Well, there's at least one existing result which requires
580 ;; logabs = true in RISCHINT, so try to make a minimal change here instead.
586 ;;;Recursion stopper
611 ;; adds up integrals of ranges between each pair of poles.
612 ;; checks if whole thing is divergent as limits of integration approach poles.
614 ;;; calling $logcontract causes antiderivative of 1/(1-x^5) to blow up
615 ;; (setq anti-deriv (cond ((involve anti-deriv '(%log))
616 ;; ($logcontract anti-deriv))
617 ;; (t anti-deriv)))
627 ivar))))
630 ;;Return section.
640 ;; I think this takes the pole-list and replaces $MINF with -PRIN-INF
641 ;; and $INF with PRIN-INF. The lower and upper integration limits
642 ;; (ll, ul) can also be modified to be -PRIN-INF and PRIN-INF. These
643 ;; special values are used in TAKE-PRINCIPAL.
661 ;; Assumes EXP is a rational expression with no polynomial part and
662 ;; converts the finite integration to integration over a half-infinite
663 ;; interval. The substitution y = (x-a)/(b-x) is used. Equivalently,
664 ;; x = (b*y+a)/(y+1).
665 ;;
666 ;; (I'm guessing CV means Change Variable here.)
669 ;; FIXME! This is a hack. We apply the transformation with
670 ;; symbolic limits and then substitute the actual limits later.
671 ;; That way method-by-limits (usually?) sees a simpler
672 ;; integrand.
673 ;;
674 ;; See Bugs 938235 and 941457. These fail because $FACTOR is
675 ;; unable to factor the transformed result. This needs more
676 ;; work (in other places).
680 ;; If the limit is a number, use $substitute so we simplify
681 ;; the result. Do we really want to do this?
689 ()))
691 ;; Integrate rational functions over a finite interval by doing the
692 ;; polynomial part directly, and converting the rational part to an
693 ;; integral from 0 to inf. This is evaluated via residues.
696 ;; PQR divides the rational expression and returns the quotient
697 ;; and remainder
704 ;; No polynomial part
707 ans
710 ;; Only polynomial part
713 ;; A non-zero quotient and remainder. Combine the results
714 ;; together.
718 ans))
723 ;; I think this takes a rational expression E, and finds the
724 ;; polynomial part. A cons is returned. The car is the quotient and
725 ;; the cdr is the remainder.
749 ;;;If leadop isn't plus don't do anything.
758 t)
764 t)
777 ())
810 ll ul))
824 ;; *Z* is a "zero parameter" for this package.
825 ;; Its also used to transform.
826 ;; limit(exp,var,val,dir) -- limit(exp,tvar,0,dir)
833 ;; EPSILON is used in principal value code to denote the familiar
834 ;; mathematical entity.
839 ;;; PRIN-INF Is a special symbol in the principal value code used to
840 ;;; denote an end-point which is proceeding to infinity.
864 ;; We have minf <= ll = ul <= inf
865 )
867 ;; We have minf <= ll < ul = inf
868 )
870 ;; We have minf = ll < ul < inf
871 ;;
872 ;; Now substitute
873 ;;
874 ;; ivar -> -ivar
875 ;; ll -> -ul
876 ;; ul -> inf
877 ;;
878 ;; so that minf < ll < ul = inf
884 ;; We have minf <= ul < ll
885 ;;
886 ;; Now substitute
887 ;;
888 ;; exp -> -exp
889 ;; ll <-> ul
890 ;;
891 ;; so that minf <= ll < ul
894 t))
895 ll ul))
909 ;; Substitute a and b into integral e
910 ;;
911 ;; Looks for discontinuties in integral, and works around them.
912 ;; For example, in
913 ;;
914 ;; integrate(x^(2*n)*exp(-(x)^2),x) ==>
915 ;; -gamma_incomplete((2*n+1)/2,x^2)*x^(2*n+1)*abs(x)^(-2*n-1)/2
916 ;;
917 ;; the integral has a discontinuity at x=0.
918 ;;
925 ivar a b)))))
939 total))))))
941 ;; look for terms with a negative exponent
942 ;;
943 ;; recursively traverses exp in order to find discontinuities such as
944 ;; erfc(1/x-x) at x=0
956 ;; returns list of places where exp might be discontinuous in ivar.
957 ;; list begins with *ll* and ends with *ul*, and include any values between
958 ;; *ll* and *ul*.
959 ;; return '$no or '$unknown if no discontinuities found.
976 ;; (multiplicity (cdar dummy)) ;; not used
981 ;; Carefully substitute the integration limits A and B into the
982 ;; expression E.
987 #+nil
991 #+nil
999 ;; Try easy substitutions. Return NIL if we can't.
1002 ;; Infinite limits aren't easy
1003 nil)
1007 %gamma_incomplete %expintegral_ei)))
1009 ;; It's easy if we have a polynomial. I (rtoy) think
1010 ;; it's also easy if the denominator is free of the
1011 ;; integration variable and also if the expression
1012 ;; doesn't involve inverse functions.
1013 ;;
1014 ;; gamma_incomplete and expintegral_ie
1015 ;; included because of discontinuity in
1016 ;; gamma_incomplete(0, exp(%i*x)) and
1017 ;; expintegral_ei(exp(%i*x))
1018 ;;
1019 ;; XXX: Are there other cases we've forgotten about?
1020 ;;
1021 ;; So just try to substitute the limits into the
1022 ;; expression. If no errors are produced, we're done.
1027 ;; no-err-sub has returned T. An error was catched.
1028 nil)
1042 ;; check for divergent integral
1054 ;;;This function works only on things with ATAN's in them now.
1056 ;; POLES-IN-INTERVAL doesn't know about the poles of tan(x). Call
1057 ;; trigsimp to convert tan into sin/cos, which POLES-IN-INTERVAL
1058 ;; knows how to handle.
1059 ;;
1060 ;; XXX Should we fix POLES-IN-INTERVAL instead?
1061 ;;
1062 ;; XXX Is calling trigsimp too much? Should we just only try to
1063 ;; substitute sin/cos for tan?
1064 ;;
1065 ;; XXX Should the result try to convert sin/cos back into tan? (A
1066 ;; call to trigreduce would do it, among other things.)
1069 ;;POLES -> ((mlist) ((mequal) ((%atan) foo) replacement) ......)
1070 ;;We can then use $SUBSTITUTE
1075 ul-ans)
1077 nil)))
1091 ivar ll ul)))
1108 llist)))))))))))))))
1123 ;; There are no calls where fn1 is ever equal to
1124 ;; 'mtorat. Hence this case is never true. What is
1125 ;; this testing for?
1132 nil)
1151 ;; e is of form poly(x)*exp(m*%i*x)
1152 ;; s is degree of denominator
1153 ;; adds e to *bptu* or *bptd* according to sign of m
1170 ;; Check term is of form poly(x)*exp(m*%i*x)
1171 ;; n is degree of denominator.
1181 ;; Set updn to T if the coefficient of IVAR in the
1182 ;; polynomial is known to be positive. Otherwise set to NIL.
1183 ;; (What does updn really mean?)
1194 term)
1229 ;; exponentialize sin and cos
1235 '$%i
1257 exp)
1273 ;; computes integral from minf to inf for expressions of the form
1274 ;; exp(%i*m*x)*r(x) by residues on either the upper half
1275 ;; plane or the lower half plane, depending on whether
1276 ;; m is positive or negative. [wang p. 77]
1277 ;;
1278 ;; exponentializes sin and cos before applying residue method.
1279 ;; can handle some expressions with poles on real line, such as
1280 ;; sin(x)*cos(x)/x.
1290 ivar
1291 nil)
1294 ;;;Above tests for applicability of this method.
1303 ;; call to $expand can create rational terms
1304 ;; with no exp(m*%i*x)
1308 ;;;Function RIB sets up the values of BPTU and BPTD
1315 ;;;If there is BPTU then CSEMIUP must succeed.
1316 ;;;Likewise for BPTD.
1320 ;; The original integrand was already
1321 ;; determined to have no poles by initial-analysis.
1322 ;; If individual terms of the expansion have poles, the poles
1323 ;; must cancel each other out, so we can ignore them.
1326 ;; if integral of ratterms is divergent, ratans is nil,
1327 ;; and mtosc returns nil
1344 t)
1346 t)
1354 t)
1356 t)
1361 s nc dc
1363 nn-var dn-var)
1384 sd new-sd))
1385 result))
1388 sn nil)
1390 sd nil))
1393 ;;;
1394 ;;;New section.
1412 s
1415 ivar)))
1425 findout
1429 on
1452 s)
1456 ;; It's very important here to bind VAR
1457 ;; because the PLOG simplifier checks
1458 ;; for VAR. Without this, the
1459 ;; simplifier converts plog(-x) to
1460 ;; log(x)+%i*%pi, which messes up the
1461 ;; keyhole routine.
1463 d
1464 ivar)))
1467 ;; Let's not signal an error here. Return nil so that we
1468 ;; eventually return a noun form if no other algorithm gives
1469 ;; a result.
1472 nil)))
1474 ;;(setq *dflag* nil)
1503 nn-var dn-var)
1530 sd new-sd))
1531 result))
1567 ;; Test to see if exp is of the form p(x)*f(exp(x)). If so, set pp to
1568 ;; be p(x) and set pe to f(exp(x)).
1581 s
1584 ivar)))
1591 ;; We have an integral of the form p(x)*F(exp(x)), where
1592 ;; p(x) is a polynomial.
1594 ;; No polynomial
1598 ;; These limits must exist for the integral to converge.
1601 ;; This only handles the case when the F(z) is a
1602 ;; rational function.
1605 ;; If we get here, F(z) is not a rational function.
1606 ;; We transform it using the substitution x=log(y)
1607 ;; which gives us an integral of the form
1608 ;; p(log(y))*F(y)/y, which maxima should be able to
1609 ;; handle.
1612 ;; Give up. We don't know how to handle this.
1614 en
1628 exp)))
1630 ;;; given (b*x+a)^n+c returns (a b n c)
1638 nil)
1640 ;;;get high degree of poly
1642 ;;;diff down to linear.
1644 ;;;all the way to constant.
1647 ;;;get rid of factorial from differentiation.
1650 ;;;Sees if can be expressed as (a*x+b)^n + part freeof x.
1660 s)
1685 n
1686 d)))))
1689 on
1744 e nil)
1758 e))))))
1764 ;; Compute the integral(n/d,x,0,inf) by computing the negative of the
1765 ;; sum of residues of log(-x)*n/d over the poles of n/d inside the
1766 ;; keyhole contour. This contour is basically an disk with a slit
1767 ;; along the positive real axis. n/d must be a rational function.
1772 ;; Ok if not on the positive real axis.
1777 t)
1788 ;; Look at an expression e of the form sin(r*x)^k, where k is an
1789 ;; integer. Return the list (1 r k). (Not sure if the first element
1790 ;; of the list is always 1 because I'm not sure what partition is
1791 ;; trying to do here.)
1805 ;; Look at an expression e of the form sin(r*x) and return r.
1816 ;; integrate(a*sc(r*x)^k/x^n,x,0,inf).
1819 ;; Get the argument of the involved trig function.
1822 ;; I don't think this needs to be special.
1823 #+nil
1825 ;; Replace (1-cos(arg)^2) with sin(arg)^2.
1827 ;(m+t 1. (m- (m^t `((%cos) ,ivar) 2.)))
1828 ;; The code from above generates expressions with
1829 ;; a missing simp flag. Furthermore, the
1830 ;; substitution has to be done for the complete
1831 ;; argument of the trig function. (DK 02/2010)
1834 exp))
1839 ;; n is the power of the denominator.
1841 ;; The simple case.
1847 ;; Do this for a sum of such terms.
1849 c))))))))))
1851 ;; We have an integral of the form sin(r*x)^k/x^n. C is the list (1 r k).
1852 ;;
1853 ;; The substitution y=r*x converts this integral to
1854 ;;
1855 ;; r^(n-1)*integral(sin(y)^k/y^n,y,0,inf)
1856 ;;
1857 ;; (If r is negative, we need to negate the result.)
1858 ;;
1859 ;; The recursion Wang gives on p. 87 has a typo. The second term
1860 ;; should be subtracted from the first. This formula is given in G&R,
1861 ;; 3.82, formula 12.
1862 ;;
1863 ;; integrate(sin(x)^r/x^s,x) =
1864 ;; r*(r-1)/(s-1)/(s-2)*integrate(sin(x)^(r-2)/x^(s-2),x)
1865 ;; - r^2/(s-1)/(s-2)*integrate(sin(x)^r/x^(s-2),x)
1866 ;;
1867 ;; (Limits are assumed to be 0 to inf.)
1868 ;;
1869 ;; This recursion ends up with integrals with s = 1 or 2 and
1870 ;;
1871 ;; integrate(sin(x)^p/x,x,0,inf) = integrate(sin(x)^(p-1),x,0,%pi/2)
1872 ;;
1873 ;; with p > 0 and odd. This latter integral is known to maxima, and
1874 ;; it's value is beta(p/2,1/2)/2.
1875 ;;
1876 ;; integrate(sin(x)^2/x^2,x,0,inf) = %pi/2*binomial(q-3/2,q-1)
1877 ;;
1878 ;; where q >= 2.
1879 ;;
1881 ;; Compute sign(r)*r^(n-1)*integrate(sin(y)^k/y^n,y,0,inf)
1883 c
1889 recursion)
1890 ;; Recursion failed. Return the integrand
1891 ;; The following code generates expressions with a missing simp flag
1892 ;; for the sin function. Use better simplifying code. (DK 02/2010)
1893 ; (let ((integrand (div (pow `((%sin) ,(m* r ivar))
1894 ; k)
1895 ; (pow ivar n))))
1897 k)
1902 ;; integrate(sin(x)^n/x^2,x,0,inf) = pi/2*binomial(n-3/2,n-1).
1903 ;; Express in terms of Gamma functions, though.
1909 ;; integrate(sin(x)^n/x,x,0,inf) = beta((n+1)/2,1/2)/2, for n odd and
1910 ;; n > 0.
1913 half%pi)
1916 ;; This implements the recursion for computing
1917 ;; integrate(sin(y)^l/y^k,y,0,inf). (Note the change in notation from
1918 ;; the above!)
1924 ;; Integral diverges if l-(k-1) < 0.
1927 ;; If l + k is not even, return NIL. (Is this the right
1928 ;; thing to do?)
1929 nil)
1931 ;; We have integrate(sin(y)^l/y^2). Use sevn to evaluate.
1934 ;; We have integrate(sin(y)^l/y,y)
1940 ;; j = k-2, i = (k-1)*(k-2)
1941 ;;
1942 ;;
1943 ;; The main recursion:
1944 ;;
1945 ;; i(sin(y)^l/y^k)
1946 ;; = l*(l-1)/(k-1)/(k-2)*i(sin(y)^(l-2)/y^k)
1947 ;; - l^2/(k-1)/(k-1)*i(sin(y)^l/y^(k-2))
1955 ;; Returns the fractional part of a?
1959 ;; Why do we return 0 if a is a number? Perhaps we really
1960 ;; mean integer?
1963 ;; If we're here, this basically assumes a is a rational.
1964 ;; Compute the remainder and return the result.
1972 ;; Doesn't appear to be used anywhere in Maxima. Not sure what this
1973 ;; was intended to do.
1974 #+nil
1985 ;;; THE FOLLOWING FUNCTION IS FOR TRIG FUNCTIONS OF THE FOLLOWING TYPE:
1986 ;;; LOWER LIMIT=0 B A MULTIPLE OF %PI SCA FUNCTION OF SIN (X) COS (X)
1987 ;;; B<=%PI2
1992 ;; means there was no error
1995 ; returns cons of (integer_part . fractional_part) of a
1997 ;; I think we really want to compute how many full periods are in a
1998 ;; and the remainder.
2003 ; returns cons of (integer_part . fractional_part) of a
2005 ;; I think we really want to compute how many full periods are in a
2006 ;; and the remainder.
2013 ;; Return the integer part of r.
2015 ;; r - fpart(r)
2019 ;;;Try making exp(%i*ivar) --> yy, if result is rational then do integral
2020 ;;;around unit circle. Make corrections for limits of integration if possible.
2040 rat-form
2041 ivar)))
2046 ;;; Do integrals of sin and cos. this routine makes sure lower limit
2047 ;;; is zero.
2049 ;; integrate(e,var,a,b)
2065 ivar e)
2066 cc))
2076 ;; Exit if b or a is not a constant or if the integrand
2077 ;; doesn't appear to have a period of 2 pi.
2080 ;; Multiples of 2*%pi in limits.
2087 ;; The integral is not over a full period (2*%pi) or multiple
2088 ;; of a full period.
2090 ;; Wang p. 111: The integral integrate(f(x),x,a,b) can be
2091 ;; written as:
2092 ;;
2093 ;; n * integrate(f,x,0,2*%pi) + integrate(f,x,0,c)
2094 ;; - integrate(f,x,0,d)
2095 ;;
2096 ;; for some integer n and d >= 0, c < 2*%pi because there exist
2097 ;; integers p and q such that a = 2 * p *%pi + d and b = 2 * q
2098 ;; * %pi + c. Then n = q - p.
2100 ;; Compute q and c for the upper limit b.
2107 ;; Compute p and d for the lower limit a.
2109 ;; avoid an extra trip around the circle - helps skip principal values
2114 ;; Compute -integrate(f,x,0,d)
2119 ;; Compute n = q - p (stored in nzp2)
2121 out
2122 ;; Compute n*integrate(f,x,0,2*%pi)
2124 ;; n = 0
2127 ;; n is not zero, so compute
2128 ;; integrate(f,x,0,2*%pi)
2130 ;; Unable to compute integrate(f,x,0,2*%pi)
2132 ;; Compute integrate(f,x,0,c)
2136 ;; All three pieces succeeded.
2139 ;; Less than 1 full period, so intsc can integrate it.
2140 ;; Apply the substitution to make the lower limit 0.
2141 ;; This is last resort because substitution often causes intsc to fail.
2143 limit-diff ivar))
2144 ;; nothing worked
2147 ;; integrate(sc, var, 0, b), where sc is f(sin(x), cos(x)).
2148 ;; calls intsc with a wrapper to just return nil if integral is divergent,
2149 ;; rather than generating an error.
2154 nil
2155 ans)))
2157 ;; integrate(sc, ivar, 0, b), where sc is f(sin(x), cos(x)). I (rtoy)
2158 ;; think this expects b to be less than 2*%pi.
2161 0
2168 ;; Partition the integrand SC into the factors that do not
2169 ;; contain VAR (the car part) and the parts that do (the cdr
2170 ;; part).
2175 ;; integrate(sc, ivar, 0, b), where sc is f(sin(x), cos(x)).
2177 ;; Determine if sc is a product of sin's and cos's.
2181 ;; We have a product of sin's and cos's. We handle some
2182 ;; special cases here.
2184 ;; Wang p. 110, formula (1):
2185 ;; integrate(sin(x)^m*cos(x)^n, x, 0, %pi/2) =
2186 ;; gamma((m+1)/2)*gamma((n+1)/2)/2/gamma((n+m+2)/2)
2189 ;; Wang p. 110, near the bottom, says
2190 ;;
2191 ;; int(f(sin(x),cos(x)), x, 0, %pi) =
2192 ;; int(f(sin(x),cos(x)) + f(sin(x),-cos(x)),x,0,%pi/2)
2213 ;; Wang, p. 111 says
2214 ;;
2215 ;; int(f(sin(x),cos(x)),x,0,3*%pi/2) =
2216 ;; int(f(sin(x),cos(x)),x,0,%pi)
2217 ;; + int(f(-sin(x),-cos(x)),x,0,%pi/2)
2221 ;; We don't have a product of sin's and cos's.
2226 dn*)
2231 ;;;Is careful about substitution of limits where the denominator may be zero
2232 ;;;because of various assumptions made.
2253 nil
2254 ans)))
2260 nil
2261 ans)))
2263 ;; Determine whether E is of the form sin(x)^m*cos(x)^n and return the
2264 ;; list (m n).
2268 m n)
2287 ;; Says whether (m^t value exponent) has at least one real branch.
2288 ;; Only works for values of 1 and -1 now. Returns $yes $no
2289 ;; $unknown.
2300 ;; Compute beta((m+1)/2,(n+1)/2)/2.
2306 ;;Seems like Guys who call this don't agree on what it should return.
2319 ;; Check e for an expression of the form x^kk*(b*x^n+a)^l. If it
2320 ;; matches, Return the two values kk and (list l a n b).
2325 ;; We have f(x)^y. Look to see if f(x) has the desired
2326 ;; form. Then f(x)^y has the desired form too, with
2327 ;; suitably modified values.
2328 ;;
2329 ;; XXX: Should we ask for the sign of f(x) if y is not an
2330 ;; integer? This transformation we're going to do requires
2331 ;; that f(x)^y be real.
2333 e
2338 ;; Got a match. Adjust kk and cc appropriately.
2340 cc
2355 ;;(DEFUN BATAP (E)
2356 ;; (PROG (K C L)
2357 ;; (COND ((NOT (BATA0 E)) (RETURN NIL))
2358 ;; ((AND (EQUAL -1. (CADDDR C))
2359 ;; (EQ ($askSIGN (SETQ K (m+ 1. K)))
2360 ;; '$pos)
2361 ;; (EQ ($askSIGN (SETQ L (m+ 1. (CAR C))))
2362 ;; '$pos)
2363 ;; (ALIKE1 (CADR C)
2364 ;; (m^ UL (CADDR C)))
2365 ;; (SETQ E (CADR C))
2366 ;; (EQ ($askSIGN (SETQ C (CADDR C))) '$pos))
2367 ;; (RETURN (M// (m* (m^ UL (m+t K (m* C (m+t -1. L))))
2368 ;; `(($BETA) ,(SETQ NN* (M// K C))
2369 ;; ,(SETQ DN* L)))
2370 ;; C))))))
2373 ;; Integrals of the form i(log(x)^m*x^k*(a+b*x^n)^l,x,0,ul). There
2374 ;; are two cases to consider: One case has ul>0, b<0, a=-b*ul^n, k>-1,
2375 ;; l>-1, n>0, m a nonnegative integer. The second case has ul=inf, l < 0.
2376 ;;
2377 ;; These integrals are essentially partial derivatives of the Beta
2378 ;; function (i.e. the Eulerian integral of the first kind). Note
2379 ;; that, currently, with the default setting intanalysis:true, this
2380 ;; function might not even be called for some of these integrals.
2381 ;; However, this can be palliated by setting intanalysis:false.
2400 ;; We have i(x^kk/(d+cc*x^r)^s,x,0,inf) =
2401 ;; beta(aa,bb)/(cc^aa*d^bb*r). Compute this, and then
2402 ;; differentiate it m times to get the log term
2403 ;; incorporated.
2408 0
2409 m)))
2413 r))))
2422 ;; The result looks like B(k/n,l) ( ... ).
2423 ;; Perhaps, we should just $factor, instead of
2424 ;; pulling out beta like this.
2426 beta
2427 ($fullratsimp
2435 ivar m)
2437 beta))))))))))))
2440 ;;; If e is of the form given below, make the obvious change
2441 ;;; of variables (substituting ul*x^(1/n) for x) in order to reduce
2442 ;;; e to the usual form of the integrand in the Eulerian
2443 ;;; integral of the first kind.
2444 ;;; N. B: The old version of ZTO1 completely ignored this
2445 ;;; substitution; the log(x)s were just thrown in, which,
2446 ;;; of course would give wrong results.
2449 ;; Parse e
2453 ;; e=x^k*(a+b*x^n)^l
2455 c
2467 ;; Wang p. 71 gives the following formula for a beta function:
2468 ;;
2469 ;; integrate(x^(k-1)/(c*x^r+d)^s,x,0,inf)
2470 ;; = beta(a,b)/(c^a*d^b*r)
2471 ;;
2472 ;; where a = k/r > 0, b = s - a > 0, s > k > 0, r > 0, c*d > 0.
2473 ;;
2474 ;; This function matches this and returns k-1, d, r, c, a, b. And
2475 ;; also checks that all the conditions hold. If not, NIL is returned.
2476 ;;
2482 c
2499 ;; Handles beta integrals.
2507 nil)
2510 c
2511 ;; e = x^k*(d+c*x^al)^l.
2516 new-k)
2524 ;; Compute exp(d)*gamma((c+1)/b)/b/a^((c+1)/b). In essence, this is
2525 ;; the value of integrate(x^c*exp(d-a*x^b),x,0,inf).
2536 ;; Evaluates the contour integral of GRAND around the unit circle
2537 ;; using residues.
2544 ;; Is pt stricly inside the unit circle?
2550 ;; Is pt on the unit circle? (Use
2551 ;; the cached value computed
2552 ;; above.)
2573 ;; Wang 81-83. Unfortunately, the pdf version has page 82 as all
2574 ;; black, so here is, as best as I can tell, what Wang is doing.
2575 ;; Fortunately, p. 81 has the necessary hints.
2576 ;;
2577 ;; First consider integrate(exp(%i*k*x^n),x) around the closed contour
2578 ;; consisting of the real axis from 0 to R, the arc from the angle 0
2579 ;; to %pi/(2*n) and the ray from the arc back to the origin.
2580 ;;
2581 ;; There are no poles in this region, so the integral must be zero.
2582 ;; But consider the integral on the three parts. The real axis is the
2583 ;; integral we want. The return ray is
2584 ;;
2585 ;; exp(%i*%pi/2/n) * integrate(exp(%i*k*(t*exp(%i*%pi/2/n))^n),t,R,0)
2586 ;; = exp(%i*%pi/2/n) * integrate(exp(%i*k*t^n*exp(%i*%pi/2)),t,R,0)
2587 ;; = -exp(%i*%pi/2/n) * integrate(exp(-k*t^n),t,0,R)
2588 ;;
2589 ;; As R -> infinity, this last integral is gamma(1/n)/k^(1/n)/n.
2590 ;;
2591 ;; We assume the integral on the circular arc approaches 0 as R ->
2592 ;; infinity. (Need to prove this.)
2593 ;;
2594 ;; Thus, we have
2595 ;;
2596 ;; integrate(exp(%i*k*t^n),t,0,inf)
2597 ;; = exp(%i*%pi/2/n) * gamma(1/n)/k^(1/n)/n.
2598 ;;
2599 ;; Equating real and imaginary parts gives us the desired results:
2600 ;;
2601 ;; integrate(cos(k*t^n),t,0,inf) = G * cos(%pi/2/n)
2602 ;; integrate(sin(k*t^n),t,0,inf) = G * sin(%pi/2/n)
2603 ;;
2604 ;; where G = gamma(1/n)/k^(1/n)/n.
2605 ;;
2613 ;; Ok, we have cos(b*x^n) or sin(b*x^n), and we set e = (n
2614 ;; b)
2616 ;; n = 1. Give up. (Why not divergent?)
2617 nil)
2622 ;; s is the sign of b. Give up if it's zero.
2623 nil)
2625 ;; Give up if n-1 <= 0. (Why give up? Isn't the
2626 ;; integral divergent?)
2627 nil)
2629 ;; We can apply our formula now. g = gamma(1/n)/n/b^(1/n)
2636 e)))))))
2639 ;; this is the second part of the definite integral package
2644 ())
2646 ivar t)
2668 nil)
2670 t)))))
2680 n
2683 plm))))
2695 plm
2696 factors
2697 pl
2698 rl
2699 pl1
2700 rl1))))
2708 ans)
2710 ;; AFAICT, this call to PLOG doesn't need
2711 ;; to bind VAR.
2713 ans))))
2720 ;; AFAICT, this call to PLOG doesn't need
2721 ;; to bind VAR. An example where this is
2722 ;; used is
2723 ;; integrate(log(x)^2/(1+x^2),x,0,1) =
2724 ;; %pi^3/16.
2727 n)
2728 d
2729 plm)))))
2733 0
2736 ;; Handle integral(n(x)/d(x)*log(x)^m,x,0,inf). n and d are
2737 ;; polynomials.
2755 ans))))
2779 n
2783 ;;Makes a new poly such that np(x)-np(x+2*%i*%pi)=p(x).
2784 ;;Constructs general POLY of degree one higher than P with
2785 ;;arbitrary coeff. and then solves for coeffs by equating like powers
2786 ;;of the varibale of integration.
2787 ;;Can probably be made simpler now.
2795 ;;;Now, poly(x)-poly(x+2*%i*%pi)=p(x), P is the original poly.
2804 -1
2813 ;; Integrate(p(x)*f(exp(x))/g(exp(x)),x,minf,inf) by applying the
2814 ;; transformation y = exp(x) to get
2815 ;; integrate(p(log(y))*f(y)/g(y)/y,y,0,inf). This should be handled
2816 ;; by dintlog.
2823 ;; This implements Wang's algorithm in Chapter 5.2, pp. 98-100.
2824 ;;
2825 ;; This is a very brief description of the algorithm. Basically, we
2826 ;; have integrate(R(exp(x))*p(x),x,minf,inf), where R(x) is a rational
2827 ;; function and p(x) is a polynomial.
2828 ;;
2829 ;; We find a polynomial q(x) such that q(x) - q(x+2*%i*%pi) = p(x).
2830 ;; Then consider a contour integral of R(exp(z))*q(z) over a
2831 ;; rectangular contour. Opposite corners of the rectangle are (-R,
2832 ;; 2*%i*%pi) and (R, 0).
2833 ;;
2834 ;; Wang shows that this contour integral, in the limit, is the
2835 ;; integral of R(exp(x))*q(x)-R(exp(x))*q(x+2*%i*%pi), which is
2836 ;; exactly the integral we're looking for.
2837 ;;
2838 ;; Thus, to find the value of the contour integral, we just need the
2839 ;; residues of R(exp(z))*q(z). The only tricky part is that we want
2840 ;; the log function to have an imaginary part between 0 and 2*%pi
2841 ;; instead of -%pi to %pi.
2843 ;; We have R(exp(x))*p(x) represented as p(x)*pe(exp(x))/d(exp(x)).
2849 ;; At this point denom-exponential has converted d(exp(x)) to the
2850 ;; polynomial d(z), where z = exp(x).
2853 pe))
2855 ;; Find the poles of the denominator. denom-exponential is the
2856 ;; denominator of R(x).
2857 ;;
2858 ;; It seems as if polelist returns a list of several items.
2859 ;; The first element is a list consisting of the pole and (z -
2860 ;; pole). We don't care about this, so we take the rest of the
2861 ;; result.
2864 ;; The imaginary part is nonzero,
2865 ;; or the realpart is negative.
2869 ;; The realpart is not zero.
2871 ;; Not sure what this does.
2873 ;; No roots at all, so return
2877 ;; We have simple roots or roots in REGION1
2880 ;; The cadr of pl is the list of the simple poles of
2881 ;; denom-exponential. Take the log of them to find the
2882 ;; poles of the original expression. Then compute the
2883 ;; residues at each of these poles and sum them up and put
2884 ;; the result in B. (If no simple poles set B to 0.)
2890 ;; I think this handles the case of poles outside the
2891 ;; regions. The sum of these residues are placed in C.
2895 temp)))
2900 ;; We have the repeated poles of deonom-exponential, so we
2901 ;; need to convert them to the actual pole values for
2902 ;; R(exp(x)), by taking the log of the value of poles.
2907 ;; Compute the residues at all of these poles and sum
2908 ;; them up.
2911 poles))
2926 ;; Check to see if each term in exp that is of the form exp(k*x) has
2927 ;; an integer value for k.
2943 ;; Test to see if exp is of the form f(exp(x)), and if so, replace
2944 ;; exp(x) with 'z*. That is, basically return f(z*).
2947 exp)
2951 ivar))
2954 ;; Does e really need to be special here? Seems to be ok without
2955 ;; it; testsuite works.
2956 #+nil
2959 e)
2990 ;; I think this is looking at f(exp(x)) and tries to find some
2991 ;; rational function R and some number k such that f(exp(x)) =
2992 ;; R(exp(k*x)).
3009 ;; Integration by parts.
3010 ;;
3011 ;; integrate(u(x)*diff(v(x),x),x,a,b)
3012 ;; |b
3013 ;; = u(x)*v(x)| - integrate(v(x)*diff(u(x),x))
3014 ;; |a
3015 ;;
3017 ;;;SINCE ONLY CALLED FROM DINTLOG TO get RID OF LOGS - IF LOG REMAINS, QUIT
3021 nil)
3028 nil)
3035 ;; integrate(f(exp(k*x)),x,a,b), where f(z) is rational.
3036 ;;
3037 ;; See Wang p. 96-97.
3038 ;;
3039 ;; If the limits are minf to inf, we use the substitution y=exp(k*x)
3040 ;; to get integrate(f(y)/y,y,0,inf)/k. If the limits are 0 to inf,
3041 ;; use the substitution s+1=exp(k*x) to get
3042 ;; integrate(f(s+1)/(s+1),s,0,inf).
3048 ;; If we can integrate it directly, do so and take the
3049 ;; appropriate limits.
3050 )
3052 ;; ans is the list (f(x) exp(k*x)).
3055 ;; Use the substitution s + 1 = exp(k*x). The
3056 ;; integral becomes integrate(f(s+1)/(s+1),s,0,inf)
3059 ;; Use the substitution y=exp(k*x) because the
3060 ;; limits are minf to inf.
3062 ;; Apply the substitution and integrate it.
3065 ;; integrate(log(g(x))*f(x),x,0,inf)
3073 exp
3074 ivar))
3076 ;; Make the substitution y=1/x. If the integrand has
3077 ;; exactly the same form, the answer has to be 0.
3083 ;; It's easy if we have the antiderivative.
3084 ;; but intsubs sometimes gives results containing %limit
3086 ;; Ok, the easy cases didn't work. We now try integration by
3087 ;; parts. Set ANS to f(x).
3090 ;; Bad. f(x) contains a log term, so we give up.
3095 ivar ll ul)))
3096 ;; The arg of the log function is the same as the
3097 ;; integration variable. We can do something a little
3098 ;; simpler than integration by parts. We have something
3099 ;; like f(x)*log(x). Consider f(x)*x^z. If we
3100 ;; differentiate this wrt to z, the integrand becomes
3101 ;; f(x)*log(x)*x^z. When we evaluate this at z = 0, we
3102 ;; get the desired integrand.
3103 ;;
3104 ;; So we need f(0) to be 0 at 0. If we can integrate
3105 ;; f(x)*x^z, then we differentiate the result and
3106 ;; evaluate it at z = 0.
3109 ;; Try integration by parts.
3112 ;; Compute diff(e,ivar,n) at the point pt.
3116 ;;; GGR and friends
3118 ;; MAYBPC returns (COEF EXPO CONST)
3119 ;;
3120 ;; This basically picks off b*x^n+a and returns the list
3121 ;; (b n a).
3128 ;; At this point, e is of the form (a n b)
3133 ;; If we're here, b is complex, and n > 0. zn = imagpart(b).
3134 ;;
3135 ;; Set ivar to the same sign as zn.
3140 ;; zd = exp(ivar*%i*%pi*(1+nd)/(2*n). (ZD is special!)
3143 ;; Return zn, n, a, zd.
3149 ;; We're here if realpart(b) <= 0, and n >= 0. Then return -b, n, a.
3152 ;; Integrate x^m*exp(b*x^n+a), with realpart(m) > -1.
3153 ;;
3154 ;; See Wang, pp. 84-85.
3155 ;;
3156 ;; I believe the formula Wang gives is incorrect. The derivation is
3157 ;; correct except for the last step.
3158 ;;
3159 ;; Let J = integrate(x^m*exp(%i*k*x^n),x,0,inf), with real k.
3160 ;;
3161 ;; Consider the case for k < 0. Take a sector of a circle bounded by
3162 ;; the real line and the angle -%pi/(2*n), and by the radii, r and R.
3163 ;; Since there are no poles inside this contour, the integral
3164 ;;
3165 ;; integrate(z^m*exp(%i*k*z^n),z) = 0
3166 ;;
3167 ;; Then J = exp(-%pi*%i*(m+1)/(2*n))*integrate(R^m*exp(k*R^n),R,0,inf)
3168 ;;
3169 ;; because the integral along the boundary is zero except for the part
3170 ;; on the real axis. (Proof?)
3171 ;;
3172 ;; Wang seems to say this last integral is gamma(s/n/(-k)^s) where s =
3173 ;; (m+1)/n. But that seems wrong. If we use the substitution R =
3174 ;; (y/(-k))^(1/n), we end up with the result:
3175 ;;
3176 ;; integrate(y^((m+1)/n-1)*exp(-y),y,0,inf)/(n*k^((m+1)/n).
3177 ;;
3178 ;; or gamma((m+1)/n)/k^((m+1)/n)/n.
3179 ;;
3180 ;; Note that this also handles the case of
3181 ;;
3182 ;; integrate(x^m*exp(-k*x^n),x,0,inf);
3183 ;;
3184 ;; where k is positive real number. A simple change of variables,
3185 ;; y=k*x^n, gives
3186 ;;
3187 ;; integrate(y^((m+1)/n-1)*exp(-y),y,0,inf)/(n*k^((m+1)/n))
3188 ;;
3189 ;; which is the same form above.
3208 ;; e = (m b n a). That is, the integral is of the form
3209 ;; x^m*exp(b*x^n+a). I think we want to compute
3210 ;; gamma((m+1)/n)/b^((m+1)/n)/n.
3211 ;;
3212 ;; FIXME: If n > m + 1, the integral converges. We need
3213 ;; to check for this.
3215 e
3218 ;; The derivation only holds if b is purely real or
3219 ;; purely imaginary. Give up if it's not.
3221 ;; Check for convergence. If b is complex, we need n -
3222 ;; m > 1. If b is real, we need b < 0.
3231 ;; If we're here, b must be negative.
3234 ;; Complex b. Take the imaginary part
3236 n a))
3238 ;; FIXME: Why do we set %emode here? Shouldn't we just
3239 ;; bind it? And why do we want it bound to T anyway?
3240 ;; Shouldn't the user control that? The same goes for
3241 ;; dosimp.
3242 ;;(setq $%emode t)
3248 ;; Match x^m*exp(b*x^n+a). If it does, return (list m b n a).
3254 ;; We're looking at something like exp(f(ivar)). See if it's
3255 ;; of the form b*x^n+a, and return (list 0 b n a). (The 0 is
3256 ;; so we can graft something onto it if needed.)
3261 ;; E should be the product of exactly 2 terms
3263 ;; Check to see if one of the terms is of the form
3264 ;; ivar^p. If so, make sure the realpart of p > -1. If
3265 ;; so, check the other term has the right form via
3266 ;; another call to ggr1.
3277 ;; Both terms have the right form and nn* contains the ivar of
3278 ;; the exponential term. Put dn* as the car of nn*. The
3279 ;; result is something like (m b n a) when we have the
3280 ;; expression x^m*exp(b*x^n+a).
3284 ;; Match b*x^n+a. If a match is found, return the list (a n b).
3285 ;; Otherwise, return NIL
3298 ;; Match b*x^n. Return the list (n b) if found or NIL if not.
3308 ;; nn* should be the value of var. This is only called by bx**n with
3309 ;; the second arg of var.
3320 ;;; given (b*x^n+a)^m returns (m a n b)
3327 nil)
3334 ;;;Catches Unfactored forms.
3337 ivar)
3350 ;;;Is E = VAR raised to some power? If so return power or 0.
3356 ;;;Is E = VAR1 raised to some power? If so return power.
3377 ans)))))
3405 ;; Note: This doesn't seem be called from anywhere.
3430 ivar)
3458 ;;;Looks at the IMAGINARY part of a log and puts it in the interval 0 2*%pi.
3461 ;; We take the $rectform above to make sure that the log is
3462 ;; expanded out for the situations where simplifying plog itself
3463 ;; doesn't do it. This should probably be considered a bug in the
3464 ;; plog simplifier and should be fixed there.
3477 ;;; Temporary fix for a lacking in taylor, which loses with %i in denom.
3478 ;;; Besides doesn't seem like a bad thing to do in general.
3482 ;; Multiply the denominator by it's conjugate to get rid of
3483 ;; %i.
3488 ;; If the new denominator still contains %i, just give up.
3490 exp
3491 new-exp)))
3494 ;;; LL and UL must be real otherwise this routine return $UNKNOWN.
3495 ;;; Returns $no $unknown or a list of poles in the interval (ll ul)
3496 ;;; for exp w.r.t. ivar.
3497 ;;; Form of list ((pole . multiplicity) (pole1 . multiplicity) ....)
3514 ;; this clause handles cases where we can't find the exact roots,
3515 ;; but we know that they occur outside the interval of integration.
3516 ;; example: integrate ((1+exp(t))/sqrt(t+exp(t)), t, 0, 1);
3532 ;; (multiplicity (cdar dummy)) (not used? -- cwh)
3542 pole-list))))))))))))
3545 ;;;Returns $YES if there is no pole and $NO if there is one.
3558 ;;;Takes care of forms that the ratio test fails on.
3574 (%einvolve-var
3577 ivar))
3611 ;; real values for ll and ul; place can be imaginary.
3618 '$no
3623 ;; returns true or nil
3625 ;; real values for ll and ul; place can be imaginary.
3641 ;; If *failures is set, we may have missed some roots.
3642 ;; We still return the roots that we have found.
3647 rootlist)
3654 rootlist)))))))))
3657 ;;; Is x > y. X or Y can be $MINF or $INF, zeroA or zeroB.
3697 nil)
3700 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3701 ;;;
3702 ;;; Integrate Definite Integrals involving log and exp functions. The algorithm
3703 ;;; are taken from the paper "Evaluation of CLasses of Definite Integrals ..."
3704 ;;; by K.O.Geddes et. al.
3705 ;;;
3706 ;;; 1. CASE: Integrals generated by the Gamma function.
3707 ;;;
3708 ;;; inf
3709 ;;; /
3710 ;;; [ w m s - m - 1
3711 ;;; I t log (t) expt(- t ) dt = s signum(s)
3712 ;;; ]
3713 ;;; /
3714 ;;; 0
3715 ;;; !
3716 ;;; m !
3717 ;;; d !
3718 ;;; (--- (gamma(z))! )
3719 ;;; m !
3720 ;;; dz ! w + 1
3721 ;;; !z = -----
3722 ;;; s
3723 ;;;
3724 ;;; The integral converges for:
3725 ;;; s # 0, m = 0, 1, 2, ... and realpart((w+1)/s) > 0.
3726 ;;;
3727 ;;; 2. CASE: Integrals generated by the Incomplete Gamma function.
3728 ;;;
3729 ;;; inf !
3730 ;;; / m !
3731 ;;; [ w m s d s !
3732 ;;; I t log (t) exp(- t ) dt = (--- (gamma_incomplete(a, x ))! )
3733 ;;; ] m !
3734 ;;; / da ! w + 1
3735 ;;; x !z = -----
3736 ;;; s
3737 ;;; - m - 1
3738 ;;; s signum(s)
3739 ;;;
3740 ;;; The integral converges for:
3741 ;;; s # 0, m = 0, 1, 2, ... and realpart((w+1)/s) > 0.
3742 ;;; The shown solution is valid for s>0. For s<0 gamma_incomplete has to be
3743 ;;; replaced by gamma(a) - gamma_incomplete(a,x^s).
3744 ;;;
3745 ;;; 3. CASE: Integrals generated by the beta function.
3746 ;;;
3747 ;;; 1
3748 ;;; /
3749 ;;; [ m s r n
3750 ;;; I log (1 - t) (1 - t) t log (t) dt =
3751 ;;; ]
3752 ;;; /
3753 ;;; 0
3754 ;;; !
3755 ;;; ! !
3756 ;;; n m ! !
3757 ;;; d d ! !
3758 ;;; --- (--- (beta(z, w))! )!
3759 ;;; n m ! !
3760 ;;; dz dw ! !
3761 ;;; !w = s + 1 !
3762 ;;; !z = r + 1
3763 ;;;
3764 ;;; The integral converges for:
3765 ;;; n, m = 0, 1, 2, ..., s > -1 and r > -1.
3766 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3770 ;;; Recognize c*z^w*log(z)^m*exp(-t^s)
3782 ;;; Recognize c*z^r*log(z)^n*(1-z)^s*log(1-z)^m
3795 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3802 ;; var1 is used as a parameter for differentiation. Add var1>0 to the
3803 ;; database, to get the desired simplification of the differentiation of
3804 ;; the gamma_incomplete function.
3812 ;; The integrand matches the cases 1 and 2.
3831 ;; Case 1: Generated by the Gamma function.
3838 var1
3843 ; derivate the involved hypergeometric
3844 ; functions.
3849 ;; Case 2: Generated by the Incomplete Gamma function.
3865 ;; Case 3: Generated by the Beta function.
3891 var2 m)
3893 var1 n)
3899 ;; Simplify result and set $gamma_expand to global value
3902 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;