Numerical Methods for the Inverse Nonlinear Fourier Transform
Stella Civelli, Luigi Barletti, Marco Secondini
我们介绍了一种新的计算非线性逆傅里叶变换的数值方法，并将其计算复杂性和准确性与文献中可用的其他方法进行了比较。对于给定的精度，所提出的方法需要最少的操作次数
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the proposed method requires the lowest number of operations
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Optical Fourier Transform-Based Preconditioning for Large-Scale Inverse Problems
本研究探讨将光学傅里叶变换（OFT）作为预处理子应用于迭代Krylov子空间方法求解离散逆问题的可行性，经模拟实验表明，质量足够的OFT预处理子可达到与数字FFT预处理子相当的重建质量和收敛性。
Inverse nonlinear fast Fourier transform on SU(2) with applications to quantum signal processing
本文研究SU(2)上的逆非线性傅里叶变换，首次证明层剥离算法的数值稳定性，提出接近线性复杂度的逆非线性快速傅里叶变换算法，可用于量子信号处理及广义量子信号处理的相位因子计算。
Multiscale Fourier Neural Operator for Inverse Wave Scattering in Highly Oscillatory Media
提出基于多尺度傅里叶神经算子(MscaleFNO)的Helmholtz方程逆介质问题算子学习方法，通过降低谱偏差的神经代理模型映射高振荡介质到散射波场，并引入扩散模型正则化最小二乘逆求解器，数值实验验证了高振荡介质重建的有效性。
Fourier Extension Based on Weighted Generalized Inverse
本文提出基于加权广义逆的傅里叶扩展方法，通过引入权重算子和GTSVD正则化，有效控制高频成分并提高导数近似精度，减少扩展域中的振荡。
Iterative execution of discrete and inverse discrete Fourier transforms with applications for signal denoising via sparsification
本文提出了一种迭代算法家族，通过反复执行离散和反向离散傅里叶变换，利用稀疏化操作在时域和频域数据中实现信号去噪，特别是在高斯噪声中恢复周期性尖峰信号。
This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a hierarchical matrix representation is constructed for the hermitian matrix arising from composing the Fourier integral operator with its adjoint. This representation is inverted efficiently with a new algorithm based on the hierarchical interpolative factorization. By combining these two factorizations, an approximate inverse factorization for the Fourier integral o…
Solving the multi-frequency electromagnetic inverse source problem by the Fourier method
本文提出基于傅里叶方法和极化向量分解的新型方法，用于求解时谐麦克斯韦方程组的源分布反问题，并通过数学证明和数值实验验证了方法的有效性。
Resolving the Gibbs Phenomenon in Fractional Fourier Series via Inverse Polynomial Reconstruction
本文提出通过逆多项式重建方法解决分数傅里叶级数中的吉布斯现象，通过匹配伦德伯格多项式展开的傅里叶系数与给定频谱数据，而非投影受损的有限和到多项式基上，首次将该方法扩展至分数傅里叶级数，并建立L^∞误差估计，证明解析函数的指数收敛性。
A direct solution to the interpolative inverse non-uniform fast Fourier transform problem for spectral analyses of non-equidistant time-series data
本文提出一种基于最小二乘优化的直接解法，利用 NFFT 伴随变换重建非等距采样数据的频谱，改进了迭代方法并具有与最新直接逆变换方法相当的时间复杂度，且软件以 Python 包形式提供，易于跨平台实现。
Approximating the Analytic Fourier Transform with the Discrete Fourier Transform
本文通过黎曼和用离散傅里叶变换近似有限域上的傅里叶变换，利用快速傅里叶变换算法提高计算效率，讨论了该方法的优缺点并提供MATLAB实现代码。
A Superfast Direct Solver for Type-III Inverse Nonuniform Discrete Fourier Transform
本文提出了一种超快直接求解类型III逆非均匀离散傅里叶变换的方法，通过矩阵分解实现准线性复杂度的正反向运算，并提供误差界和数值验证。
A Localized Fourier Extension Method for Piecewise-Smooth Inverse Source Reconstruction
针对半无限带域泊松方程的分段光滑逆源重建问题，提出结合交错分区、GTSVD正则化等的局域傅里叶延拓方法，在中低噪声下鲁棒性优于对比方法。
Quantitative estimates: How well does the discrete Fourier transform approximate the Fourier transform on $\mathbb{R}$
本文研究了离散傅里叶变换在实数上近似傅里叶变换的精度问题，推导了误差估计并提出了采样参数之间的关系方法。
A Deep Learning-Enhanced Fourier Method for the Multi-Frequency Inverse Source Problem with Sparse Far-Field Data
本文提出一种结合深度学习和傅里叶方法的框架，用于解决多频反源问题中的稀疏远场数据挑战，通过迁移学习提升鲁棒性和效率。
This paper is concerned with the inverse random source problem for a stochastic time fractional diffusion equation, where the source is assumed to be driven by a Gaussian random field. The direct problem is shown to be well-posed by examining the well-posedness and regularity of the solution for the equivalent stochastic two-point boundary value problem in the frequency domain. For the inverse problem, the Fourier modulus of the diffusion coefficient of the random source is proved to be uniquely determined by the variance of the Fourier transform of the boundary data. As a phase retrieval for …
This paper is concerned with the convergence of a series associated with a certain version of the convexification method. That version has been recently developed by the research group of the first author for solving coefficient inverse problems. The convexification method aims to construct a globally convex Tikhonov-like functional with a Carleman Weight Function in it. In the previous works the construction of the strictly convex weighted Tikhonov-like functional assumes a truncated Fourier series (i.e. a finite series instead of an infinite one) for a function generated by the total wave fi…
Discrete Weierstrass Fourier Transform and Experiments
本文提出一种更快更通用的离散傅里叶变换方法，用于近似离散数据，并通过实验验证其收敛速度优于传统方法。
We investigate an interpolation/extrapolation method that, given scattered observations of the Fourier transform, approximates its inverse. The interpolation algorithm takes advantage of modelling the available data via a shape-driven interpolation based on Variably Scaled Kernels (VSKs), whose implementation is here tailored for inverse problems. The so-constructed interpolants are used as inputs for a standard iterative inversion scheme. After providing theoretical results concerning the spectrum of the VSK collocation matrix, we test the method on astrophysical imaging benchmarks.
Fast Inverse Nonlinear Fourier Transform
本文提出两种快速非线性傅里叶变换逆变换算法，复杂度为O(KN+Nlog²N)，收敛率为O(N⁻²)，通过新的快速分层剥离方案和快速达布变换算法实现。
A Fourier finite volume approach for the optical inverse problem of quantitative photoacoustic tomography
本研究提出一种结合空间有限体积格式与方向变量截断傅里叶展开的方法，可在扩散近似与辐射传输模型间插值调整精度，结合Matlab拟牛顿优化求解定量光声层析成像光学逆问题，在扩散近似不足场景下仅增少量傅里叶项即可显著提升重建精度。
Fast complexified quaternion Fourier transform
提出一种离散复四元数傅里叶变换，通过四个标准复数傅里叶变换实现计算，并讨论其性质。
Direct Inversion of the 3D Pseudo-polar Fourier Transform
伪极傅里叶变换是一种专门的非等间距傅里叶变换，它在称为伪极网格的近极网格上计算傅里叶变换。伪极坐标网格相对于其他非均匀采样几何结构的优点在于，可以使用快速且稳定的算法来反演在伪极坐标网格上对傅里叶变换进行采样的变换。对于其他采样几何形状，即使非等间距的傅里叶变换可以被反转，仅有的已知算法是迭代的。这些算法的收敛速度以及它们的精度是难以控制的，因为它们既依赖于采样几何形状，也依赖于未知的重建对象。本文提出了一种三维伪极傅里叶变换的直接反演算法。该算法是基于一维的rescue操作，并被证明是显着快于现有的迭代反演算法。
A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules
提出了一种基于快速傅里叶变换的方法，用于高效计算晶格规则的权重枚举多项式和三角度数。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。