Related Experiment Video
Updated: May 3, 2026

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture
Published on: February 23, 2018
Acceleration of computation of φ-polynomials
Abstract:
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.
Related Concept Videos
Long Division of Polynomials
Synthetic Disvision of Polynomials
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Real Zeros of Polynomials
Introduction to Polynomial Functions
Phasor Arithmetics
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...

