We present what we believe to be a new algorithm, FRactal Iterative Method (FRiM), aiming at the reconstruction of the optical wavefront from measurements provided by a wavefront sensor. As our application is adaptive optics on extremely large telescopes, our algorithm was designed with speed and best quality in mind. The latter is achieved thanks to a regularization that enforces prior statistics. To solve the regularized problem, we use the conjugate gradient method, which takes advantage of the sparsity of the wavefront sensor model matrix and avoids the storage and inversion of a huge matrix. The prior covariance matrix is, however, non-sparse, and we derive a fractal approximation to the Karhunen–Loève basis thanks to which the regularization by Kolmogorov statistics can be computed in operations, with N being the number of phase samples to estimate. Finally, we propose an effective preconditioning that also scales as and yields the solution in five to ten conjugate gradient iterations for any N. The resulting algorithm is therefore . As an example, for a Shack–Hartmann wavefront sensor, the FRiM appears to be more than 100 times faster than the classical vector-matrix multiplication method.
© 2010 Optical Society of AmericaFull Article | PDF Article
Luc Gilles, Curtis R. Vogel, and Brent L. Ellerbroek
J. Opt. Soc. Am. A 19(9) 1817-1822 (2002)
Brent L. Ellerbroek, Luc Gilles, and Curtis R. Vogel
Appl. Opt. 42(24) 4811-4818 (2003)
Luc Gilles, Brent L. Ellerbroek, and Curtis R. Vogel
Appl. Opt. 42(26) 5233-5250 (2003)