Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #4523 > unrolled thread

decoding inbuilt function

Started bystudent <ragamadhuri.24@gmail.com>
First post2011-08-22 10:04 +0000
Last post2011-08-24 11:53 +0000
Articles 2 — 2 participants

Back to article view | Back to comp.soft-sys.math.mathematica


Contents

  decoding inbuilt function student <ragamadhuri.24@gmail.com> - 2011-08-22 10:04 +0000
    Re: decoding inbuilt function Simon <simonjtyler@gmail.com> - 2011-08-24 11:53 +0000

#4523 — decoding inbuilt function

Fromstudent <ragamadhuri.24@gmail.com>
Date2011-08-22 10:04 +0000
Subjectdecoding inbuilt function
Message-ID<j2t9j7$m06$1@smc.vnet.net>
hi,
can any body please help me to decode the inbuilt function LIMIT in
mathematica  or can any body please tell me how the inbuilt function
limit works and the logic behind it
please reply me soon as i really need that


[toc] | [next] | [standalone]


#4553

FromSimon <simonjtyler@gmail.com>
Date2011-08-24 11:53 +0000
Message-ID<j32ook$duf$1@smc.vnet.net>
In reply to#4523
Built-in Mathematica functions that are NOT compiled into the kernel can of ten be looked at by removing the ReadProtected attribute

Unprotect[fn]
ClearAttributes[fn, ReadProtected]
(* Protect[fn] *)
?? fn

But Limit is part of the kernel and so not accessible unless you have the source code (i.e. have an insider at WRI). That said, many of the algorithms in Mathematica are implementations and improvements of various public algorithms combined with a healthy mix of black magic heuristics.

I'm not at all knowledgeable in this area, but I believe that the main limit algorithm out there is the Gruntz algorithm. So provided Mathematica has various asymptotic information about any special functions in the expression, it can compute the limit.

An unnamed pure python based CAS implements the Gruntz algorithm, and you can see its description and source code at http://docs.sympy.org/dev/modules/series.html. You can also find a link to Gruntz's thesis. Also see http://www.texmacs.org/joris/gaa1/gaa1-abs.html and other publications at http://www.texmacs.org/joris/main/publs.html.

Other core parts of mathematica are similar.

For example, I remember hearing a few years ago (I think around v6) that many of Mathematica's special function integration routines are now based on MeijerG formulas (since most special functions can be written as MeijerG functions). This algorithm would be combined with other things such as some version of http://en.wikipedia.org/wiki/Risch_algorithm and a whole heap of heuristics and special cases.
There's an interesting GSoC2011 project (that is just finishing) to implement a MeijerG based integration algorithm in python, see http://nessgrh.wordpress.com/2011/06/17/status-update%E2%80%94week-4/. This complements a GSoC2010 project to implement the Risch algorithm in python, see http://asmeurersympy.wordpress.com/2010/06/30/the-risch-algorithm-part-1/.

[toc] | [prev] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web