Related papers: Fast and accurate evaluation of dual Bernstein pol…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…
We present a unified deterministic approach for experimental design problems using the method of interlacing polynomials. Our framework recovers the best-known approximation guarantees for the well-studied D/A/E-design problems with simple…
The present paper is about Bernstein-type estimates for Jacobi polynomials and their applications to various branches in mathematics. This is an old topic but we want to add a new wrinkle by establishing some intriguing connections with…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…
We extend the classical Bernstein technique to the setting of integro-differential operators. As a consequence, we provide first and one-sided second derivative estimates for solutions to fractional equations, including some convex fully…
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
We consider measures supported on the bi-circle and review the recurrence relations satisfied by the orthogonal polynomials associated with these measures constructed using the lexicographical or reverse lexicographical ordering. New…
We tersely review a recently introduced technique to identify systems of two nonlinearly-coupled Ordinary Di{\S}erential Equations (ODEs) solvable by algebraic operations; and we report some specifc examples of this kind, namely systems of…
A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…
The one variable Bernstein-Szego theory for orthogonal polynomials on the real line is extended to a class of two variable measures. The polynomials orthonormal in the total degree ordering and the lexicographical ordering are constructed…
Binary optimization, a representative subclass of discrete optimization, plays an important role in mathematical optimization and has various applications in computer vision and machine learning. Usually, binary optimization problems are…
In [C. Mouhot and L. Pareschi, "Fast algorithms for computing the Boltzmann collision operator," Math. Comp., to appear; C. Mouhot and L. Pareschi, C. R. Math. Acad. Sci. Paris, 339 (2004), pp. 71-76], fast deterministic algorithms based on…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…