Treffer: Performance modeling of adaptive-optics imaging systems using fast Hankel transforms
Starfire Optical Range, U.S. Air Force Research Laboratory, Kirtland Air Force Base, NM 87117, United States
BOPS, Inc., 6340 Quadrangle Drive Suite 210, Chapel Hill, NC 27514, United States
Department of Mathematics and Computer Science, Box 7388, Wake Forest University, Winston-Salem, NC 27109, United States
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Telecommunications and information theory
Weitere Informationen
Real-time adaptive-optics is a means for enhancing the resolution of ground based, optical telescopes beyond the limits previously imposed by the turbulent atmosphere. One approach for linear performance modeling of closed-loop adaptive-optics systems involves calculating very large covariance matrices whose components can be represented by sums of Hankel transform based integrals. In this paper we investigate approximate matrix factorizations of discretizations of such integrals. Two different approximate factorizations based upon representations of the underlying Bessel function are given, the first using a series representation due to Ellerbroek and the second an integral representation. The factorizations enable fast methods for both computing and applying the covariance matrices. For example, in the case of an equally spaced grid, it is shown that applying the approximated covariance matrix to a vector can be accomplished using the derived integral-based factorization involving a 2-D fast cosine transform and a 2-D separable fast multipole method. The total work is then O(N log N) where N is the dimension of the covariance matrix in contrast to the usual O(N2) matrix-vector multiplication complexity. Error bounds exist for the matrix factorizations. We provide some simple computations to illustrate the ideas developed in the paper.