Related papers: Minimal Cubature rules and polynomial interpolatio…
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…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…
We introduce simple quadrature rules for the family of nonparametric nonconforming quadrilateral element with four degrees of freedom. Our quadrature rules are motivated by the work of Meng {\it et al.} \cite{meng2018new}. First, we…
Orthogonal polynomials for a family of weight functions on $[-1,1]^2$, $$ \CW_{\a,\b,\g}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} (1-x^2)^\g(1-y^2)^{\g}, $$ are studied and shown to be related to the Koornwinder polynomials defined on the region…
Not every positive functional defined on bi-variate polynomials of a prescribed degree bound is represented by the integration against a positive measure. We isolate a couple of conditions filling this gap, either by restricting the class…
Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…
In this dissertation, it is first shown that, when the radial basis function is a $p$-norm and $1 < p < 2$, interpolation is always possible when the points are all different and there are at least two of them. We then show that…
The recently developed quadrature by expansion (QBX) technique accurately evaluates the layer potentials with singular, weakly or nearly singular, or even hyper singular kernels in the integral equation reformulations of partial…
We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…
We obtain new curvature estimates and Bernstein type results for minimal $n-$submanifolds in $\ir{n+m},\, m\ge 2$ under the condition that the rank of its Gauss map is at most 2. In particular, this applies to minimal surfaces in Euclidean…
This paper considers binary classification of high-dimensional features under a postulated model with a low-dimensional latent Gaussian mixture structure and non-vanishing noise. A generalized least squares estimator is used to estimate the…
We give Chebyshev-type quadrature formulas for certain new weight classes. These formulas are of highest possible degree when the number of nodes is a power of 2. We also describe the nodes in a constructive way, which is important for…
In this document I develop a weight function theory of positive order basis function interpolants and smoothers. **In Chapter 1 the basis functions and data spaces are defined directly using weight functions. The data spaces are used to…
We prove the following proposition. Under linear interpolation on a Euclidean $n$-dimensional ball $B$, an interpolation projector whose nodes coincide with the vertices of a regular simplex inscribed into the boundary sphere has the…
The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…
The $\mathcal{L}_2$ discrepancy is one of several well-known quantitative measures for the equidistribution properties of point sets in the high-dimensional unit cube. The concept of weights was introduced by Sloan and Wo\'{z}niakowski to…
Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…
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 construct a class of super-reflexive complementably minimal spaces, and study uniformly convex distortions of the norm on Hilbert space by using methods of complex interpolation.