Issue |
J. Eur. Opt. Soc.-Rapid Publ.
Volume 2, 2007
|
|
---|---|---|
Article Number | 07012 | |
Number of page(s) | 3 | |
DOI | https://doi.org/10.2971/jeos.2007.07012 | |
Published online | 12 April 2007 |
Regular papers
Computing Zernike polynomials of arbitrary degree using the discrete Fourier transform
1
Philips Research Europe, HTC 36
2
Philips Research Europe, HTC 4
* a.j.e.m.janssen@philips.com
** peter.dirksen@philips.com
Received:
16
March
2007
The conventional representation of Zernike polynomials Rmn(ρ) gives unacceptable numerical results for large values of the degree n. We present an algorithm for the computation of Zernike polynomials of arbitrary degree n. The algorithm has the form of a discrete Fourier (cosine) transform which comes with advantages over other methods in terms of computation time, accuracy and ease of implementation. As an application we consider the effect of NA-scaling on the lower-order aberrations of an optical system in the presence of a very high order aberration.
Key words: Zernike polynomial / aberration / high-order / discrete Fourier transform / NA-scaling
© The Author(s) 2007. All rights reserved.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.