arXiv (All)
open access
Approximate Inversion of Discrete Fourier Integral Operators via Hierarchically Semiseparable Matrices
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{
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Truly Sub-Nyquist Generalized Eigenvalue Method with High-Resolution#179087
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- Structure Preserving Algorithms for Quaternion Outer Inverses with Applications#179187
- Locally Approximating the Top Eigenvector of Bounded Entry Matrices#1076921
- Recovery of a Null Form in the Wave Equation from Scattering Data#987768
Record · ID 999046
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive