Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2409.07821v2

Help | Advanced Search

Physics > Computational Physics

arXiv:2409.07821v2 (physics)
[Submitted on 12 Sep 2024 (v1) , last revised 4 Feb 2025 (this version, v2)]

Title: Logarithmically complex rigorous Fourier space solution to the 1D grating diffraction problem

Title: 对一维光栅衍射问题的对数复杂度严格傅里叶空间解

Authors:Evgeniy Levdik, Alexey A. Shcherbakov
Abstract: The rigorous solution to the grating diffraction problem is a cornerstone step in many scientific fields and industrial applications ranging from the study of the fundamental properties of metasurfaces to the simulation of photolithography masks. Fourier space methods, such as the Fourier Modal Method, are established tools for the analysis of the electromagnetic properties of periodic structures, but are too computationally demanding to be directly applied to large and multiscale optical structures. This work focuses on pushing the limits of rigorous computations of periodic electromagnetic structures by adapting a powerful tensor compression technique called the Tensor Train decomposition. We have found that the millions and billions of numbers produced by standard discretization schemes are inherently excessive for storing the information about diffraction problems required for computations with a given accuracy, and we show how to adapt the TT algorithms to have a logarithmically growing amount of information to be sufficient for reliable rigorous solution of the Maxwell's equations on an example of large period multiscale 1D grating structures.
Abstract: 严格求解光栅衍射问题是在许多科学领域和工业应用中的关键步骤,从研究超表面的基本特性到模拟光刻掩模的仿真。傅里叶空间方法,如傅里叶模态方法,是分析周期性结构电磁特性的成熟工具,但对于大型和多尺度光学结构来说计算量太大,无法直接应用。这项工作专注于通过适应一种称为张量列车分解的强大张量压缩技术来推动周期性电磁结构严格计算的极限。我们发现,标准离散化方案产生的数百万甚至数十亿个数字在存储给定精度下计算衍射问题所需信息方面本质上是多余的,我们展示了如何适应TT算法,使信息量以对数方式增长,足以在大型多尺度一维光栅结构的例子中可靠地求解麦克斯韦方程。
Subjects: Computational Physics (physics.comp-ph) ; Optics (physics.optics)
Cite as: arXiv:2409.07821 [physics.comp-ph]
  (or arXiv:2409.07821v2 [physics.comp-ph] for this version)
  https://doi.org/10.48550/arXiv.2409.07821
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1016/j.cpc.2025.109530
DOI(s) linking to related resources

Submission history

From: Alexey Shcherbakov A. [view email]
[v1] Thu, 12 Sep 2024 08:02:58 UTC (32 KB)
[v2] Tue, 4 Feb 2025 12:18:18 UTC (35 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
physics.comp-ph
< prev   |   next >
new | recent | 2024-09
Change to browse by:
physics
physics.optics

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号