Abbreviated Journal Title
SHAPE-DESCRIPTION; OPTICS; Optics
The benefits of making an effective use of impressive computational power offered by multi-core platforms are investigated for the computation of phi-polynomials used in the description of freeform surfaces. Specifically, we devise parallel algorithms based upon the recurrence relations of both Zernike polynomials and gradient orthogonal Q-polynomials and implement these parallel algorithms on Graphical Processing Units (GPUs) respectively. The results show that more than an order of magnitude improvement is achieved in computational time over a sequential implementation if these recurrence-based parallel algorithms are adopted in the computation of the phi-polynomials.
Kaya, Ilhan and Rolland, Jannick, "Acceleration of computation of phi-polynomials" (2013). Faculty Bibliography 2010s. 4192.