Show simple item record

dc.contributor.advisorChow, Edmond
dc.contributor.authorBrzycki, Cory A.
dc.date.accessioned2016-07-18T17:05:31Z
dc.date.available2016-07-18T17:05:31Z
dc.date.created2016-05
dc.date.issued2016-07-18
dc.date.submittedMay 2016
dc.identifier.urihttp://hdl.handle.net/1853/55395
dc.description.abstractThis study provides a method for finding a polynomial approximation of the Boys Function on a given arbitrary domain to a given arbitrary degree. Such an approximation would allow computer conducted that involves the Boys Function to be sped up through code parallelization. Current methods for evaluating the Boys Function rely on branching through division of domain that prevents parallelization. Remez algorithm is used to provide an approximation with coefficients for a degree 20 polynomial approximation listed for the first 32 Boys Functions. Matlab code is provided with directions on use and links to installation of libraries to allow other coefficients to be determined.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectBoys Function
dc.subjectApproximation
dc.subjectRemez
dc.titlePolynomial Approximation of the Boys Function Optimized for High Performance Computing
dc.typeUndergraduate Research Option Thesis
dc.description.degreeUndergraduate
dc.contributor.departmentComputer Science
thesis.degree.levelUndergraduate
dc.contributor.committeeMemberSherrill, David
dc.date.updated2016-07-18T17:05:31Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record