Related papers: New cubature formulae and hyperinterpolation in th…
We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the…
Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm considered here realizes the transfer…
We propose a novel numerical algorithm for computing the electronic structure related eigenvalue problem of incommensurate systems. Unlike the conventional practice that approximates the system by a large commensurate supercell, our…
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…
This paper contains a survey of results obtained by the authors mostly during the past few years and published by 2021. In particular, we present the best of known estimates of numerical characteristics related to the research theme.…
We propose an optimization algorithm to compute the optimal sensor locations in experimental design in the formulation of Bayesian inverse problems, where the parameter-to-observable mapping is described through an integral equation and its…
The notion of $n$th order convexity in the sense of Hopf and Popoviciu is defined via the nonnegativity of the $(n+1)$st order divided differences of a given real-valued function. In view of the well-known recursive formula for divided…
We develop a simple two-step algorithm for enclosing Chebyshev expansions whose cost is linear in terms of the polynomial degree. The algorithm first transforms the expansion from Chebyshev to the Laurent basis and then applies the interval…
We study fully-discrete approximations and quadratures of infinite-variate functions in abstract Bochner spaces associated with a Hilbert space $X$ and an infinite-tensor-product Jacobi measure. For target infinite-variate functions taking…
It is shown that quadrature formulas in many different applications can be derived from rational approximation of the Cauchy transform of a weight function. Since rational approximation is now a routine technology, this provides an easy new…
We derive a new explicit formula in terms of sums over graphs for the $n$-point correlation functions of general formal weighted double Hurwitz numbers coming from the Kadomtsev-Petviashvili tau functions of hypergeometric type (also known…
We compute numerically the $L^2$ Marcinkiewicz-Zygmund constants of cubature rules, with a special attention to their role in polynomial approximation by orthogonal bases. We test some relevant rules on domains such as the interval, the…
We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to…
To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the…
This paper introduces a novel method for the efficient and accurate computation of volume fractions on unstructured polyhedral meshes, where the phase boundary is an orientable hypersurface, implicitly given as the iso-contour of a…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
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.