Abstract
We discuss numerical solution of Altarelli-Parisi equations in a Laguerre-polynomial method and in a brute-force method. In the Laguerre method, we get good accuracy by taking about twenty Laguerre polynomials in the flavor-nonsinglet case. Excellent evolution results are obtained in the singlet case by taking only ten Laguerre polynomials. The accuracy becomes slightly worse in the small and large regions, especially in the nonsinglet case. These problems could be implemented by using the brute-force method; however, running CPU time could be significantly longer than the one in the Laguerre method.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.