Related papers: Bravais Lattices for Euclidean Degree Efficient Po…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
We present an indirect higher order boundary element method utilising NURBS mappings for exact geometry representation and an interpolation-based fast multipole method for compression and reduction of computational complexity, to counteract…
Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, DCT and IDST, respectively, together with the efficient evaluation of the modified moments by forwards recursions or by…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
A filtration of a representation whose successive quotients are isomorphic to Demazure modules is called an excellent filtration. In this paper we study graded multiplicities in excellent filtrations of fusion products for the current…
In this work, the benefits of the phase fitting technique are embedded in high order discrete Lagrangian integrators. The proposed methodology creates integrators with zero phase lag in a test Lagrangian in a similar way used in phase…
We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the…
Fractal Interpolation has been proposed in the literature as an efficient way to construct closure models for the numerical solution of coarse-grained Navier-Stokes equations. It is based on synthetically generating a scale-invariant…
In this paper, we propose new deterministic and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let $f$ be an $n$-variate polynomial given by a straight-line program, which has…
We present a high-order method that provides numerical integration on volumes, surfaces, and lines defined implicitly by two smooth intersecting level sets. To approximate the integrals, the method maps quadrature rules defined on…
We show that integrating a polynomial of degree t on an arbitrary simplex (with respect to Lebesgue measure) reduces to evaluating t homogeneous polynomials of degree j = 1, 2,. .. , t, each at a unique point $\xi$ j of the simplex. This…
We present a novel barycentric interpolation algorithm designed for analytic functions $f\in\mathcal{A}(E)$ defined on the complex plane. The algorithm, which encompasses both polynomial and rational interpolation, is tailored to handle…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of…
We discuss the growth of the Lebesgue constants for polynomial interpolation at Fekete points for fixed degree (one) and varying dimension, and underlying set $K\subset \R^d$ a simplex, ball or cube.
In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation…