Polynomial Approximation of the Boys Function Optimized for High Performance Computing

Files
BRZYCKI-UNDERGRADUATERESEARCHOPTIONTHESIS-2016.pdf (4.53 MB)
Author(s)
Brzycki, Cory A.
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
School of Computer Science
School established in 2007
Organizational Unit
Series
Series
Collections
Undergraduate Scholarship
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/55395
Abstract
This 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.
Sponsor
Date
2016-07-18
Extent
Resource Type
Text
Resource Subtype
Undergraduate Thesis
Rights Statement
Rights URI