Abstract
The metaplectic group is generated by the Fourier transform and multiplications by functions of particular exponential type. Based on the use of the metaplectic representation and a factorization of symplectic matrices, in this paper a bound on the number of terms needed to factor an arbitrary metaplectic operator is derived. The approach is constructive and numerically stable, leading to a reliable factorization algorithm in practice. The problem is partially motivated by the task of constructing lens systems in diffractive optics. Mathematics subject classification (2010): 42B10, 78M25, 65F30.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
