A recurrence scheme for least-square optimized polynomials

Simple item page
dc.creatorGebert, C.
dc.creatorMontvay, I.
dc.date2003-02-28
dc.date.accessioned2026-07-07T03:38:55Z
dc.date.available2026-07-07T03:38:55Z
dc.descriptionA 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.
dc.description13 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/hep-lat/0302025
dc.identifierhttp://arxiv.org/abs/hep-lat/0302025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/38731
dc.subjectHigh Energy Physics - Lattice
dc.titleA recurrence scheme for least-square optimized polynomials
dc.typetext

Files

Collections

arXiv