arXiv (All)
open access
Optical Fourier Transform-Based Preconditioning for Large-Scale Inverse Problems
Fast Fourier Transform (FFT)-based preconditioners provide an efficient approach for approximating inverse operators in large-scale linear inverse problems when the underlying operator structure can be exploited in the Fourier domain. Optical Fourier transforms (OFTs), the analog of digital Fourier
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
- Unlocking massively parallel spectral proper orthogonal decompositions in the PySPOD package#1232564
- A Fast Nonuniform Solver for the Poisson Equation over a Disk#1154603
- Computation of higher order Lie derivatives on the Infinity Computer#741397
- Analysis of Compact Symmetric Finite Difference Methods with Highest Possible Orders for Elliptic Equations#1013450
- MORCA: Offline-to-Online Reinforcement Learning for Adaptive Cache Reuse in Video Diffusion Acceleration#1234882
Record · ID 1342151
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