相关论文: A note on Laguerre truncated polynomials and quadr…
We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
We study efficient algorithms for linear regression and covariance estimation in the absence of Gaussian assumptions on the underlying distributions of samples, making assumptions instead about only finitely-many moments. We focus on how…
We present a quantum algorithm to evaluate matrix elements of functions of unitary operators. The method is based on calculating quadrature nodes and weights using data collected from a quantum processor. Given a unitary $U$ and quantum…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
In this paper we present the result of successively applying a Chebyshev polynomial to a continuous random variable. In particular we show that under mild assumptions the limiting distribution will be the same as the weight with respect to…
We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
This work is devoted to the study of integration with respect to binomial measures. We develop interpolatory quadrature rules and study their properties. Local error estimates for these rules are derived in a general framework.
Sets of orthogonal martingales are importants because they can be used as stochastic integrators in a kind of chaotic representation property, see [20]. In this paper, we revisited the problem studied by W. Schoutens in [21], investigating…
We consider orthogonal polynomials on the unit circle with respect to a weight which is a quotient of $q$-gamma functions. We show that the Verblunsky coefficients of these polynomials satisfy discrete Painlev\'e equations, in a Lax form,…
Let W: R to (0,1] be continuous. Bernstein's approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm ||fW|| Linfinity(R) . The qualitative form of this problem was solved by Achieser,…
In this article, we focus on the error that is committed when computing the matrix logarithm using the Gauss--Legendre quadrature rules. These formulas can be interpreted as Pad\'e approximants of a suitable Gauss hypergeometric function.…
Given a sequence of polynomials $Q_n$ of degree $n$ with zeros on $[-1,1]$, we consider the triangular table of derivatives $Q_{n, k}(x)=d^k Q_n(x) /d x^k$. Under the assumption that the sequence $\{Q_n\}$ has a weak* limiting zero…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range…
We study the effects of numerical quadrature rules on error convergence rates when solving Maxwell-type variational problems via the curl-conforming or edge finite element method. A complete {\em a priori} error analysis for the case of…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds…