Performance analysis of faber polynomial based local propagators for photonics: Performance analysis of faber polynomial based local propagators...: W. Plotnikov and D. Schulz.
Saved in:
| Title: | Performance analysis of faber polynomial based local propagators for photonics: Performance analysis of faber polynomial based local propagators...: W. Plotnikov and D. Schulz. |
|---|---|
| Authors: | Plotnikov, Wladimir1 (AUTHOR) wladimir.plotnikov@tu-dortmund.de, Schulz, Dirk1 (AUTHOR) dirk2.schulz@tu-dortmund.de |
| Source: | Optical & Quantum Electronics. Mar2025, Vol. 57 Issue 3, p1-20. 20p. |
| Subjects: | Matrix exponential, Electromagnetic wave propagation, Finite differences, Polynomial time algorithms, Spatial resolution |
| Abstract: | The computation of the propagation of an electromagnetic wave in the time domain is examined using local Faber polynomial based time dependent propagators. Conventionally, the whole computational domain is evaluated by one global operator. Contrary, when utilizing a nonuniform discretization in the system local operators can be used individually for each subarea. This allows the complexity to be reduced by decreasing the polynomial order of the evaluation of the Faber algorithm, while at the same time decreasing the overall runtime. Compared to common Local Time Step methods, the time step size of each individual area with this approach is already synchronized with a predefined global time step size. In general, the investigated approach is especially interesting for applications that demand a high spatial resolution, such as in the field of nanophotonics and THz-technology. However, the influence of the necessary process steps on the runtime must be examined in particular when computing with the local operators approach. To this end, the theoretical complexity is derived and compared with practical results to analyze the efficiency. [ABSTRACT FROM AUTHOR] |
| Copyright of Optical & Quantum Electronics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The computation of the propagation of an electromagnetic wave in the time domain is examined using local Faber polynomial based time dependent propagators. Conventionally, the whole computational domain is evaluated by one global operator. Contrary, when utilizing a nonuniform discretization in the system local operators can be used individually for each subarea. This allows the complexity to be reduced by decreasing the polynomial order of the evaluation of the Faber algorithm, while at the same time decreasing the overall runtime. Compared to common Local Time Step methods, the time step size of each individual area with this approach is already synchronized with a predefined global time step size. In general, the investigated approach is especially interesting for applications that demand a high spatial resolution, such as in the field of nanophotonics and THz-technology. However, the influence of the necessary process steps on the runtime must be examined in particular when computing with the local operators approach. To this end, the theoretical complexity is derived and compared with practical results to analyze the efficiency. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 03068919 |
| DOI: | 10.1007/s11082-025-08072-9 |
