Title page for E-project-050109-113911

Project Type	MQP
Submission date	2009-05-01
Author	Matthew Daniel Dailey, CS
URN	E-project-050109-113911
Title	Manipulations in MAPLE
Advisor	Hofri, Micha, CS
Availability	unrestricted
Abstract The programming language MAPLE uses different algorithms to find closed forms for symbolic indefinite summations. MAPLE does not explicitly contain a procedure to interchange the order, and resultantly will give up on many summations which could be solved by interchanging the order of summation. In this project we look into the task of interchanging the order of summation over a specific domain, and provide a MAPLE procedure which automates this task. We then look into identities involving harmonic numbers which we derive through this new procedure, existing MAPLE summation techniques and user manipulation. We then analyze the well known algorithm Quicksort using these identities. Lastly, we look into the summation procedure by Moenck which is used for rational function summations.
Files	mdaileyCSreport.pdf mdaileyMaple.zip

Browse by Author | Browse by Department | Search all available E-projects