BIT Numerical Mathematics· 2026Q1
Parameter estimation for multivariate exponential sums via iterative rational approximation
- 0citations
- Q1SCImago
- 2026year
Short summary
Two new methods reconstruct multivariate exponential sums by reformulating the problem as multivariate rational interpolation, solved by reducing it to univariate problems tackled with the AAA method.
AI-generated from the title and abstract; the full text is not read.
Key points
- Multivariate exponential sums are analyzed by reformulating the problem as multivariate rational interpolation.
- Two new methods reduce the multivariate problem to solvable univariate rational interpolation problems.
- The univariate AAA method is employed to solve the reduced problems.
- The first method uses indices from straight lines for efficient reconstruction from limited data.
- The second method uses the full index grid and recursive dimension reduction.
AI-generated from the title and abstract; the full text is not read.
Abstract
Abstract We present two new methods for multivariate exponential analysis. In [1], we developed a new algorithm for reconstruction of univariate exponential sums by exploiting the rational structure of their Fourier coefficients and reconstructing this rational structure with the AAA (“adaptive Antoulas–Anderson”) method for rational approximation [2]. In this paper, we extend these ideas to the multivariate setting. Similarly as in univariate case, the Fourier coefficients of multivariate exponential sums have a rational structure and the multivariate exponential recovery problem can be reformulated as multivariate rational interpolation problem. We develop two approaches to solve this special multivariate rational interpolation problem by reducing it to the several univariate ones, which are then solved again via the univariate AAA method. Our first approach is based on using indices of the Fourier coefficients chosen from several straight lines in the d -dimensional grid, which ensures efficient reconstruction from a relatively small amount of input data. The second approach is based on employing the full grid of indices of the Fourier coefficients and relies on the idea of recursive dimension reduction. We demonstrate performance of our methods with several numerical examples.
The authors' abstract, as published at the source. BIT Numerical Mathematics, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Applied Mathematics
Applied MathematicsMathematics