arXiv · hep-lat/0302025
A recurrence scheme for least-square optimized polynomials
Abstract
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm for fermion simulations are considered. For the polynomials needed in TSMB a code in C is provided which is easily applicable to polynomial degrees of several thousands.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
C. Gebert, I. Montvay. 2003-02-28. A recurrence scheme for least-square optimized polynomials. https://arxiv.org/abs/hep-lat/0302025
Cite the original work for its findings. Save a collection to share your selection of sources.