Open AccessAcceleration of computation of φ-polynomials
Author(s) -
Ilhan Kaya,
Jannick P. Rolland
Publication year - 2013
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.21.029065
Subject(s) - zernike polynomials , computation , acceleration , computer science , orthogonal polynomials , algorithm , computational science , parallel computing , mathematics , optics , combinatorics , wavefront , physics , classical mechanics
The benefits of making an effective use of impressive computational power offered by multi-core platforms are investigated for the computation of φ-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 φ-polynomials.