Related papers: Quadrature rules with (not too many) derivatives
The general Poisson summation formula of Mellin analysis can be considered as a quadrature formula for the positive real axis with remainder. For Mellin bandlimited functions it becomes an exact quadrature formula. Our main aim is to study…
The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…
We study quadrature rules for functions from an RKHS, using nodes sampled from a determinantal point process (DPP). DPPs are parametrized by a kernel, and we use a truncated and saturated version of the RKHS kernel. This link between the…
We develop quadrature rules for the isogeometric analysis of wave propagation and structural vibrations that minimize the discrete dispersion error of the approximation. The rules are optimal in the sense that they only require two…
In this paper, we derive a variant of the Taylor theorem to obtain a new minimized remainder. For a given function $f$ defined on the interval $[a,b]$, this formula is derived by introducing a linear combination of $f'$ computed at $n+1$…
Quadrature formulas for spheres, the rotation group, and other compact, homogeneous manifolds are important in a number of applications and have been the subject of recent research. The main purpose of this paper is to study coordinate…
Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…
A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…
Quadratic assignment problems are a fundamental class of combinatorial optimization problems which are ubiquitous in applications, yet their exact resolution is NP-hard. To circumvent this impasse, it was proposed to regularize such…
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…
If $D$ is the definite quaternion algebra over $\qu$ of discriminant $p$, we compute, for any prime $p>3$, the number of infinite dimensional cusp forms on $D^*$ which are trivial at infinity, tamely ramified at $p$, and have given…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
In this paper problem of construction of optimal quadrature formulas in $W_2^{(m,m-1)}(0,1)$ space is considered. Here by using Sobolev's algorithm when $m=1,2$ we find the optimal coefficients of the quadrature formulas of the form $$…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
We construct several sequences of asymptotically optimal definite quadrature formulae of fourth order and evaluate their error constants. Besides the asymptotical optimality, an advantage of our quadrature formulae is the explicit form of…
Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this,…
A (positive definite and integral) quadratic form $f$ is called regular if it represents all integers that are locally represented. It is known that there are only finitely many regular ternary quadratic forms up to isometry. However, there…
The solution of a class of third order ordinary differential equations possessing two parameter Lie symmetry group is obtained by group theoretic means. It is shown that reduction to quadratures is possible according to two scenarios: 1) if…