Related papers: An adaptive partition of unity method for Chebyshe…
In this paper a local approximation method on the sphere is presented. As interpolation scheme we consider a partition of unity method, such as the modified spherical Shepard's method, which uses zonal basis functions (ZBFs) plus spherical…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
It is well known that the projection method is not convergent for monotone equilibrium problems. Recently Sosa \textit{et al.} in \cite{SS2011} proposed a projection algorithm ensuring convergence for paramonotone equilibrium problems. In…
We propose an optimization algorithm to compute the optimal sensor locations in experimental design in the formulation of Bayesian inverse problems, where the parameter-to-observable mapping is described through an integral equation and its…
In this letter, we present a fast and well-conditioned spectral method based on the Chebyshev polynomials for computing the continuous part of the nonlinear Fourier spectrum. The algorithm achieves a complexity of $O(N_{\text{iter.}}N\log…
We present an adaptive delaminating Levin method for evaluating bivariate oscillatory integrals over rectangular domains. Whereas previous analyses of Levin methods impose non-resonance conditions that exclude stationary and resonance…
} The main goal of this note is to provide new, mostly multidimensional densities, compactly supported and list many of its properties that enable effective calculations. The idea of obtaining such densities is firstly to build some…
We present new convergence estimates of generalized empirical interpolation methods in terms of the entropy numbers of the parametrized function class. Our analysis is transparent and leads to sharper convergence rates than the classical…
The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order…
Anderson acceleration (or Anderson mixing) is an efficient acceleration method for fixed point iterations $x_{t+1}=G(x_t)$, e.g., gradient descent can be viewed as iteratively applying the operation $G(x) \triangleq x-\alpha\nabla f(x)$. It…
Harmonic Balance is one of the most popular methods for computing periodic solutions of nonlinear dynamical systems. In this work, we address two of its major shortcomings: First, we investigate to what extent the computational burden of…
Generalized Chebyshev acceleration is a semi-iterative technique applicable to a basic iterative method only when the eigenvalues of the iteration matrix satisfy a highly restrictive inclusion condition. In this work, we relax this…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the…
We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…
The subject of the present study is the Monte Carlo path-integral evaluation of the moments of spectral functions. Such moments can be computed by formal differentiation of certain estimating functionals that are infinitely-differentiable…
In applied mathematics, especially in optimization, functions are often only provided as so called "Black-Boxes" provided by software packages, or very complex algorithms, which make automatic differentation very complicated or even…
It is known that the statistical properties of the spectrum provide an essential characterization of quantum chaos. The computation of a large group of interior eigenvalues at the middle spectrum is thus an important problem for quantum…