Low-Rank Acceleration of the Operator Fourier Transform
Abstract
We develop a numerical algorithm for the efficient solution or approximation of solutions to the Helmholtz equation on a structured grid in two dimensions. We make use of the Operator Fourier Transform (OFT) and a low-rank cross approximation scheme (Cross-DEIM) to decompose the problem into an integral over a pseudo-time of solutions to the Schrödinger equation. The OFT is a framework for solving operator equations like fractional Laplacian equations or the Helmholtz equation, when the latter i...
Description / Details
We develop a numerical algorithm for the efficient solution or approximation of solutions to the Helmholtz equation on a structured grid in two dimensions. We make use of the Operator Fourier Transform (OFT) and a low-rank cross approximation scheme (Cross-DEIM) to decompose the problem into an integral over a pseudo-time of solutions to the Schrödinger equation. The OFT is a framework for solving operator equations like fractional Laplacian equations or the Helmholtz equation, when the latter is written as a product of two paraxial operators. The main computational cost in the OFT is the solution to the Schrödinger equation, especially when the dimension or mesh resolution is high. In this work, we alleviate this cost by utilizing a low-rank method. Such methods aim to beat the curse of dimensionality when low-rank structures are present in the solution. We show that the combination of these two approaches can have large cost reductions for certain classes of problems.
Source: arXiv:2606.09689v1 - http://arxiv.org/abs/2606.09689v1 PDF: https://arxiv.org/pdf/2606.09689v1 Original Link: http://arxiv.org/abs/2606.09689v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Jun 9, 2026
Mathematics
Mathematics
0