Optical Fourier Transform-Based Preconditioning for Large-Scale Inverse Problems
Abstract
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 transforms, exploit light propagation through optical systems and offer the potential for greater throughput and energy efficiency than conventional digital FFT implementations. However, practical optical systems are inherently imperfect and introduce a variety of errors into the computed output. Thus, OFTs can only provide approximations to their digital counterpart, and the implications of these inexact transforms for iterative solvers remains largely unexplored. This work investigates the feasibility of OFT-based preconditioning of iterative Krylov subspace methods for the solution of discrete inverse problems. We digitally simulate the optical Fourier transform using the FFT and incorporate sources of error expected in practical optical systems into the simulation. Numerical experiments suggest that given sufficient optical system quality, iterative methods utilizing OFT-based preconditioners can maintain reconstruction quality and convergence comparable to those with fully digital FFT-based preconditioners.
Related
- A Superfast Direct Solver for 2D Type-II Inverse Nonuniform Discrete Fourier Transform Based on Hierarchically Semiseparable Matrices
- Fourier--Laplace Injectivity for Oblique and Polygonal Cylinders in Passive Inverse Problems
- A parameterized block LU preconditioning for double saddle point problems
- The quantum connection, Fourier-Laplace transform, and families of A∞ -categories
- FASS: Discrete Fourier Transform Adapters for Speech Separation With Incremental Learning
BibTeX
@misc{drum2026optical,
title = {{Optical Fourier Transform-Based Preconditioning for Large-Scale Inverse Problems}},
author = {Chelsea Drum and Lucas Onisk and Ariana N. Brown and James G. Nagy},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17275},
eprint = {2610.17275},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17275},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Optical Fourier Transform-Based Preconditioning for Large-Scale Inverse Problems
AU - Chelsea Drum
AU - Lucas Onisk
AU - Ariana N. Brown
AU - James G. Nagy
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.17275
UR - https://arxiv.org/abs/2610.17275
AB - 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 transforms, exploit light propagation through optical systems and offer the potential for greater throughput and energy efficiency than conventional digital FFT implementations. However, practical optical systems are inherently imperfect and introduce a variety of errors into the computed output. Thus, OFTs can only provide approximations to their digital counterpart, and the implications of these inexact transforms for iterative solvers remains largely unexplored. This work investigates the feasibility of OFT-based preconditioning of iterative Krylov subspace methods for the solution of discrete inverse problems. We digitally simulate the optical Fourier transform using the FFT and incorporate sources of error expected in practical optical systems into the simulation. Numerical experiments suggest that given sufficient optical system quality, iterative methods utilizing OFT-based preconditioners can maintain reconstruction quality and convergence comparable to those with fully digital FFT-based preconditioners.
ER -