English
Related papers

Related papers: Higher order corrected trapezoidal rules in Lebesg…

200 papers

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…

Numerical Analysis · Computer Science 2018-08-30 Li Fan , David I Shuman , Shashanka Ubaru , Yousef Saad

A numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain…

Numerical Analysis · Mathematics 2019-05-27 Mark Ainsworth , Christian Glusa

We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem…

Algebraic Geometry · Mathematics 2010-10-05 Motohico Mulase , Naizhen Zhang

We present the evaluation of a family of exponential-logarithmic integrals. These have integrands of the form P(exp(x),ln(x)) where P is a polynomial. The examples presented here appear in sections 4.33, 4.34 and 4.35 in the classical table…

Classical Analysis and ODEs · Mathematics 2007-05-23 Victor H. Moll

Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…

Numerical Analysis · Mathematics 2012-06-06 Jean-Marie Mirebeau

This work studies numerical integration by the M\"obius-transformed trapezoidal rule, which combines the classical trapezoidal rule with a change of variables induced by a M\"obius transformation that maps the unit circle onto the real…

Numerical Analysis · Mathematics 2026-05-01 Nuutti Hyvönen , Yuya Suzuki

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

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…

Numerical Analysis · Mathematics 2023-08-25 Dirk Nuyens , Yuya Suzuki

In this work we propose and analyse a numerical method for computing a family of highly oscillatory integrals with logarithmic singularities. For these quadrature rules we derive error estimates in terms of $N$, the number of nodes, $k$ the…

Numerical Analysis · Mathematics 2013-11-19 Victor Dominguez

We establish fractional Leibniz rules in weighted settings for nonnegative self-adjoint operators on spaces of homogeneous type. Using a unified method that avoids Fourier transforms, we prove bilinear estimates for spectral multiplier on…

Classical Analysis and ODEs · Mathematics 2025-11-26 The Anh Bui

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

Number Theory · Mathematics 2021-10-01 Shenxing Zhang

The aim of this note is to provide a fractional integration theorem in the framework of Laguerre expansions. The method of proof consists of establishing an asymptotic estimate for the involved kernel and then applying a method of Hedberg…

Classical Analysis and ODEs · Mathematics 2008-02-03 George Gasper , Krzysztof Stempak , Walter Trebels

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Marc Moreno Maza , Alexey Ovchinnikov

Let $F(x) := (f_{ij}(x))_{i,j=1,\ldots,p},$ be a real symmetric polynomial matrix of order $p$ and let $f(x)$ be the largest eigenvalue function of the matrix $F(x).$ We denote by ${\partial}^\circ f(x)$ the Clarke subdifferential of $f$ at…

Algebraic Geometry · Mathematics 2016-01-06 Si Tiep Dinh , Tien Son Pham

We present a new combinatorial formula for Hall-Littlewood functions associated with the affine root system of type $\tilde A_{n-1}$, i.e. corresponding to the affine Lie algebra $\hat{\mathfrak{sl}}_n$. Our formula has the form of a sum…

Combinatorics · Mathematics 2016-07-12 Boris Feigin , Igor Makhlin

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…

Numerical Analysis · Mathematics 2020-08-28 Jean Lasserre

The trigonometric interpolants to a periodic function $f$ in equispaced points converge if $f$ is Dini-continuous, and the associated quadrature formula, the trapezoidal rule, converges if $f$ is continuous. What if the points are…

Numerical Analysis · Mathematics 2016-12-14 Anthony P. Austin , Lloyd N. Trefethen

This paper considers filtered polynomial approximations on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$, obtained by truncating smoothly the Fourier series of an integrable function $f$ with the help of a "filter" $h$, which is a…

Classical Analysis and ODEs · Mathematics 2015-09-15 Heping Wang , Ian H. Sloan

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

Metric Geometry · Mathematics 2013-06-27 Velleda Baldoni , Nicole Berline , Jesus De Loera , Matthias Köppe , Michèle Vergne