Metraipolis › archive › dc_df8e04997b8b
Approximate Inversion of Discrete Fourier Integral Operators via Hierarchically Semiseparable Matrices — arXiv:2609.11520
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11520
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:10:08.492Z
- SHA-256 of the archived text
2acd7805c04c9bf4e9ecd108ab04ad1d8e2972c277b53ce4b49e442af5a9e758- Stable URL of this page
https://metraipolis.com/documento/dc_df8e04997b8b
How to cite
Approximate Inversion of Discrete Fourier Integral Operators via Hierarchically Semiseparable Matrices — arXiv:2609.11520 — arXiv (en), https://arxiv.org/abs/2609.11520 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df8e04997b8b (Metraipolis archive dc_df8e04997b8b, sha256 2acd7805c04c9bf4e9ecd108ab04ad1d8e2972c277b53ce4b49e442af5a9e758)
BibTeX
@misc{dcdf8e04997b8b,
title = {Approximate Inversion of Discrete Fourier Integral Operators via Hierarchically Semiseparable Matrices — arXiv:2609.11520},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11520},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df8e04997b8b; sha256 2acd7805c04c9bf4e9ecd108ab04ad1d8e2972c277b53ce4b49e442af5a9e758},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11520. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper introduces a novel method for approximating the inverse of discrete Fourier integral operators (FIOs). Given an $N \times N$ matrix representation $K$ of an FIO, the proposed algorithm consists of two stages. In the offline stage, we first construct a butterfly factorization (BF) $\tilde{K}$ of $K$, which enables fast forward matrix-vector multiplication. We then construct a hierarchically semiseparable (HSS) approximation $\tilde{G} \approx G$, where $G = K^{*} K$, using fast applications of $\tilde{K}$ and $\tilde{K}^{*}$ to random matrices. Finally, we apply the ULV factorization to the HSS matrix $\tilde{G}$ to obtain an approximation $\tilde{F} \approx G^{-1}$. Combining these approximations yields an approximate inverse $K^{-1} \approx \tilde{F} \tilde{K}^{*}$. The offline stage has complexity $O(N \log^{2} N)$ for 1D problems and $O(N^{1.5} \log N)$ for 2D problems. In the online stage, the proposed method approximates $K^{-1} u$ for a given input vector $u$ with complexity $O(N \log N)$ for both 1D and 2D problems. The proposed method can be used either as a direct solver or as a preconditioner for iterative methods. Numerical results for 1D and 2D FIOs demonstrate the effectiveness of the proposed method.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.11520 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:55:33.336Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).