Related papers: Bravais Lattices for Euclidean Degree Efficient Po…
Computing accurate splines of degree greater than three is still a challenging task in today's applications. In this type of interpolation, high-order derivatives are needed on the given mesh. As these derivatives are rarely known and are…
We introduce a new method to approximate integrals $\int_{\mathbb{R}^d} f(\boldsymbol{x}) \, \mathrm{d} \boldsymbol{x}$ which simply scales lattice rules from the unit cube $[0,1]^d$ to properly sized boxes on $\mathbb{R}^d$, hereby…
We present a new formula for divided difference and few new schemes of divided difference tables in this paper. Through this, we derive new interpolation, numerical differentiation and numerical integration formulas with arbitrary order of…
Discretizing an analytic function on a uniform real-space grid is often done via a straightforward collocation method. This is ubiquitous in all areas of computational physics and quantum chemistry. An example in Density Functional Theory…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
We establish a deterministic and stochastic spherical quasi-interpolation framework featuring scaled zonal kernels derived from radial basis functions on the ambient Euclidean space. The method incorporates both quasi-Monte Carlo and Monte…
This paper studies a generalization of hyperinterpolation over the high-dimensional unit cube. Hyperinterpolation of degree \( m \) serves as a discrete approximation of the \( L_2 \)-orthogonal projection of the same degree, using Fourier…
Vector extrapolation methods are widely used in large-scale simulation studies, and numerous extrapolation-based acceleration techniques have been developed to enhance the convergence of linear and nonlinear fixed-point iterative methods.…
We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
We present simplified formulae for the analytic integration of the Newton potential of polynomials over boxes in two- and three-dimensional space. These are implemented in an easy-to-use C++ library that allows computations in arbitrary…
Multipoint secant and interpolation methods are effective tools for solving systems of nonlinear equations. They use quasi-Newton updates for approximating the Jacobian matrix. Owing to their ability to more completely utilize the…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Using the theory of quasiconformal mappings, we simplify the proof of the recent result by Taylor and Totik (see IMA Journal of Numerical Analysis 30 (2010) 462--486) on the behavior of the Lebesgue constants for interpolation points on a…
The Floater--Hormann family of rational interpolants do not have spurious poles or unattainable points, are efficient to calculate, and have arbitrarily high approximation orders. One concern when using them is that the amplification of…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
The paper contains a survey of the results obtained by the author in recent years. These results concern the application in multivariate polynomial interpolation of some geometric constructions and methods. In particular, we give estimates…
This article gives a ``fundamental solution'' based energy-norm harmonic interpolation approach for two half-space settings of interest: the upper-half $\mathbb{R}^n$ plane, where fundamental solutions satisfy Laplace's equation, and the…