Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.12454 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909175544545280 |
|---|---|
| author | Ashcraft, Jaren N. Douglas, Ewan S. Anche, Ramya Dube, Brandon D. Derby, Kevin Z. Furenlid, Lars Kautz, Maggie Kim, Daewook Milani, Kian Riggs, A. J. Eldorado |
| author_facet | Ashcraft, Jaren N. Douglas, Ewan S. Anche, Ramya Dube, Brandon D. Derby, Kevin Z. Furenlid, Lars Kautz, Maggie Kim, Daewook Milani, Kian Riggs, A. J. Eldorado |
| contents | Paraxial diffraction modeling based on the Fourier transform has seen widespread implementation for simulating the response of a diffraction-limited optical system. For systems where the paraxial assumption is not sufficient, a class of algorithms has been developed that employs hybrid propagation physics to compute the propagation of an elementary beamlet along geometric ray paths. These "beamlet decomposition" algorithms include the well-known Gaussian Beamlet Decomposition (GBD) algorithm, of which several variants have been created. To increase the computational efficiency of the GBD algorithm, we derive an alternative expression of the technique that utilizes the analytical propagation of beamlets to tilted planes. We then use this accelerated algorithm to conduct a parameter-space search to find the optimal combination of free parameters in GBD to construct the analytical Airy function. The experiment is conducted on a consumer-grade CPU, and a high-performance GPU, where the new algorithm is 34 times faster than the previously published algorithm on CPUs, and 67,513 times faster on GPUs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_12454 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Generalized Expression for Accelerating Beamlet Decomposition Simulations Ashcraft, Jaren N. Douglas, Ewan S. Anche, Ramya Dube, Brandon D. Derby, Kevin Z. Furenlid, Lars Kautz, Maggie Kim, Daewook Milani, Kian Riggs, A. J. Eldorado Optics Computational Physics Paraxial diffraction modeling based on the Fourier transform has seen widespread implementation for simulating the response of a diffraction-limited optical system. For systems where the paraxial assumption is not sufficient, a class of algorithms has been developed that employs hybrid propagation physics to compute the propagation of an elementary beamlet along geometric ray paths. These "beamlet decomposition" algorithms include the well-known Gaussian Beamlet Decomposition (GBD) algorithm, of which several variants have been created. To increase the computational efficiency of the GBD algorithm, we derive an alternative expression of the technique that utilizes the analytical propagation of beamlets to tilted planes. We then use this accelerated algorithm to conduct a parameter-space search to find the optimal combination of free parameters in GBD to construct the analytical Airy function. The experiment is conducted on a consumer-grade CPU, and a high-performance GPU, where the new algorithm is 34 times faster than the previously published algorithm on CPUs, and 67,513 times faster on GPUs. |
| title | A Generalized Expression for Accelerating Beamlet Decomposition Simulations |
| topic | Optics Computational Physics |
| url | https://arxiv.org/abs/2404.12454 |