Related Experiment Video
Updated: Jun 12, 2026

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture
Published on: February 23, 2018
Algorithm for computation of Zernike polynomials expansion coefficients
Abstract:
A numerically efficient algorithm for expanding a function in a series of Zernike polynomials is presented. The algorithm evaluates the expansion coefficients through the standard 2-D integration formula derived from the Zernike polynomials' orthogonal properties. Quadratic approximations are used along with the function to be expanded to eliminate the computational problems associated with integrating the oscillatory behavior of the Zernike polynomials. This yields a procedure that is both fast and numerically accurate. Comparisons are made between the proposed scheme and a procedure using a nested 2-D Simpson's integration rule. The results show that typically at least a fourfold improvement in computational speed can be expected in practical use.
Related Concept Videos
Inverse z-Transform by Partial Fraction Expansion
To begin the process, the poles of the function are identified and the function is...
Binomial Expansion Using Pascal's Triangle
Complex Zeros
Real Zeros of Polynomials
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Difference Equation Solution using z-Transform
The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...