<i>Zernike</i> by ONE <i>Pascal</i> triangle

This work discovers two hidden cases of blockwise recurrence in Zernike computations. Based on these findings, a new computation scheme for Zernike polynomials is proposed. It uses one Pascal triangle for all internal factors, thus avoiding calculations of factorials, cos / sin , inverse matrix, etc., and meets the requirements of computational accuracy, high speed, low memory footprint, and flexibility.