Related papers: Fast and accurate evaluation of dual Bernstein pol…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
This paper deals with the merging problem of segments of a composite B\'ezier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P.…
It is well known that Sobolev-type orthogonal polynomials with respect to measures supported on the real line satisfy higher-order recurrence relations and these can be expressed as a (2N+1)-banded symmetric semi-infinite matrix. In this…
We introduce a class of orthogonal polynomials in two variables which generalizes the disc polynomials and the 2-$D$ Hermite polynomials. We identify certain interesting members of this class including a one variable generalization of the…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…
The q-Laguerre polynomials correspond to an indetermined moment problem. For explicit discrete non-N-extremal measures corresponding to Ramanujan's ${}_1\psi_1$-summation we complement the orthogonal q-Laguerre polynomials into an explicit…
The computation of the entries of Jacobi operators associated with orthogonal polynomials has important applications in numerical analysis. From truncating the operator to form a Jacobi matrix, one can apply the Golub--Welsh algorithm to…
In this work, a new approach has been developed to obtain numerical solution of linear Volterra type integral equations by obtaining asymptotic approximation to solutions. Using the classical Bernoulli polynomials, a set of orthonormal…
We present a generalization of multiple orthogonal polynomials of type I and type II, which we call multiple orthogonal polynomials of mixed type. Some basic properties are formulated, and a Riemann-Hilbert problem for the multiple…
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.