A recurrence scheme for least-square optimized polynomials
高能物理 - 格点
2007-05-23 v1
摘要
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.
引用
@article{arxiv.hep-lat/0302025,
title = {A recurrence scheme for least-square optimized polynomials},
author = {C. Gebert and I. Montvay},
journal= {arXiv preprint arXiv:hep-lat/0302025},
year = {2007}
}
备注
13 pages, 1 figure