Related papers: A modified FC-Gram approximation algorithm with pr…
The FC-Gram algorithm approximates non-periodic functions to high order by constructing a periodic extension with controlled boundary behavior and applying trigonometric interpolation. In this paper we introduce a generalized FC-Gram…
It is well known that approximation of functions on $[0,1]$ whose periodic extension is not continuous fail to converge uniformly due to rapid Gibbs oscillations near the boundary. Among several approaches that have been proposed toward the…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…
In \cite{GCF} it is proved that any quadratic irrational number has a representation as a continuous, infinite and periodic fraction. In 1848, Charles Hermite through a letter Jacobi \cite{Per} wondered if this fact could be generalized to…
We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…
The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
We present the Fast Chebyshev Transform (FCT), a fast, randomized algorithm to compute a Chebyshev approximation of functions in high-dimensions from the knowledge of the location of its nonzero Chebyshev coefficients. Rather than sampling…
Moulinec and Suquet introduced FFT-based homogenization in 1994, and twenty years later, their approach is still effective for evaluating the homogenized properties arising from the periodic cell problem. This paper builds on the author's…
This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an…
Sparse grids based on Lagrange polynomials have become one of the staple methods for approximating functions that are high-dimensional and expensive to evaluate, in the context e.g. of PDE-based parametric design exploration. They are…
Recent work has shown that parameterizing and optimizing coordinate transformations using normalizing flows, i.e., invertible neural networks, can significantly accelerate the convergence of spectral approximations. We present the first…
In recent years post-Newtonian approximations for isolated slowly-moving systems in general relativity have been studied by means of matched asymptotic expansions. A paper by Poujade & Blanchet in 2002 made great progress by effectively…
We propose an efficient and easy-to-implement gradient-enhanced least squares Monte Carlo method for computing price and Greeks (i.e., derivatives of the price function) of high-dimensional American options. It employs the sparse Hermite…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…