Weighted interpolation for equidistant nodes

Weighted Lagrange interpolation is proposed for solving Lagrange interpolation problems on equidistant or almost equidistant data. Good condition numbers are found in the case of rational interpolants whose denominator has degree about twice the number of data to be interpolated. Since the degree of the denominator is higher than that of the numerator, simple functions like constants and linear polynomials will not be reproduced. Furthermore, the interpolant cannot be expressed by a barycentric formula. As a counterpart, the interpolation algorithm is simple and leads to small Lebesgue constants.     

Lebesgue functions corresponding to a family of Lagrange interpolation polynomials

In this paper we obtain various explicit forms of the Lebesgue function corresponding to a family of Lagrange interpolation polynomials defined at an even number of nodes. We study these forms by using the derivatives up to the second order inclusive. We estimate exact values of Lebesgue constants for this family from below and above in terms of known parameters. In a particular case we obtain new convenient formulas for calculating these estimates.     

On a certain class of Lebesgue constants

The Lebesgue constants associated with interpolation at the extrema of the Chebyshev polynomials are investigated. It is shown that these constants are smaller than those associated with the zeros of the Chebyshev polynomials.     

On condition numbers of polynomial eigenvalue problems

In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition numbers of eigenvalues and the pseudospectral growth rate. We obtain that if a simple eigenvalue of a matrix polynomial is ill-conditioned in some respects, then it is close to be multiple, and we construct an upper bound for this distance (measured in the euclidean norm). We also derive a new expression for the condition number of a simple eigenvalue, which does not involve eigenvectors. Moreover, an Elsner-like perturbation bound for matrix polynomials is presented.     

A complete description of the Lebesgue functions for classical lagrange interpolation polynomials

Explicit forms of Lebesgue functions are not described in the mathematical literature by now. This issue is related to the problem of reducing sums of modules of fundamental polynomials or the corresponding Dirichlet kernels. That is why the complete study of graphs of Lebesgue functions remains a complicated topical problem in the theory of approximation. In this paper we solve the mentioned problems both for odd and even numbers of interpolation nodes. We find explicit forms of Lebesgue functions and study them by means of the differential calculus. All mentioned forms are new.     

The Lagrange trigonometric interpolation polynomial with the minimal norm considered as an operator from <Emphasis Type="Italic">C</Emphasis><Subscript>2π</Subscript> to <Emphasis Type="Italic">C</Emphasis><Subscript>2π</Subscript>

In this paper we perform a comparative analysis of Lebesgue functions and constants of a family of Lagrange polynomials. We prove that if a polynomial from the family has the minimal norm in the space of square summable functions, then it also has the minimal norm as an operator which maps the space of continuous functions into itself.     

Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases

Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider the effect of the choice of polynomial basis on the pseudospectrum and on the conditioning of the spectrum of regular matrix polynomials. In particular, we consider the direct use of the Lagrange basis on distinct interpolation nodes, and give a geometric characterization of “good” nodes. We also give some tools for computation of roots at infinity via a new, natural, reversal. The principal achievement of the paper is to connect pseudospectra to the well-established theory of Lebesgue functions and Lebesgue constants, by separating the influence of the scalar basis from the natural scale of the matrix polynomial, which allows many results from interpolation theory to be applied. This work was partially funded by the Natural Sciences and Engineering Research Council of Canada, and by the MITACS Network of Centres of Excellence.     

Polynomials with integer coefficients and their zeros

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.     

A numerical study of divergence-free kernel approximations

Approximation properties of divergence-free vector fields by global and local solenoidal bases are studied. A comparison between interpolants generated with radial kernels and multivariate polynomials is presented. Numerical results show higher rates of convergence for derivatives of the vector field being approximated in directions enforced by the divergence operator when a rectangular grid is used. We also compute the growth of Lebesgue constants for uniform and clustered nodes and study the flat limit of divergence-free interpolants based on radial kernels. Numerical results are presented for two- and three-dimensional vector fields.     

Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook placements). For general sets of entries, these numbers of matrices are not polynomials in q (Stembridge in Ann. Comb. 2(4):365, 1998); however, when the set of entries is a Young diagram, the numbers, up to a power of q?1, are polynomials with nonnegative coefficients (Haglund in Adv. Appl. Math. 20(4):450, 1998). In this paper, we give a number of conditions under which these numbers are polynomials in q, or even polynomials with nonnegative integer coefficients. We extend Haglund’s result to complements of skew Young diagrams, and we apply this result to the case where the set of entries is the Rothe diagram of a permutation. In particular, we give a necessary and sufficient condition on the permutation for its Rothe diagram to be the complement of a skew Young diagram up to rearrangement of rows and columns. We end by giving conjectures connecting invertible matrices whose support avoids a Rothe diagram and Poincaré polynomials of the strong Bruhat order.     

An ABC inequality for Mahler’s measure

We prove an upper bound for the Mahler measure of the Wronskian of a collection of N linearly independent polynomials with complex coefficients. If the coefficients of the polynomials are algebraic numbers we obtain an inequality for the absolute Weil heights of the roots of the polynomials. This later inequality is analogous to the abc inequality for polynomials, and also has applications to Diophantine problems.     

Computation methods for combinatorial sums and Euler‐type numbers related to new families of numbers

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order. We can show that these numbers are related to the well‐known numbers and polynomials such as the Stirling numbers of the second kind and the central factorial numbers, the array polynomials, the rook numbers and polynomials, the Bernstein basis functions and others. In order to derive our new identities and relations for these numbers, we use a technique including the generating functions and functional equations. Finally, we give not only a computational algorithm for these numbers but also some numerical values of these numbers and the Euler numbers of negative order with tables. We also give some combinatorial interpretations of our new numbers. Copyright © 2016 John Wiley & Sons, Ltd.     

Reversion of power series and the extended Raney coefficients

In direct as well as diagonal reversion of a system of power series, the reversion coefficients may be expressed as polynomials in the coefficients of the original power series. These polynomials have coefficients which are natural numbers (Raney coefficients). We provide a combinatorial interpretation for Raney coefficients. Specifically, each such coefficient counts a certain collection of ordered colored trees. We also provide a simple determinantal formula for Raney coefficients which involves multinomial coefficients.

     

On a Characterization of Integrability for the Reciprocal Weight of Orthogonal Polynomials on the Circle

We prove a necessary and sufficient condition for integrability of the reciprocal weight function of orthogonal polynomials. The condition is given in terms of the asymptotic behaviour of the norm of extremal polynomials with prescribed coefficients.     

About Polynomials Whose Divided Differences are Integer-Valued on Prime Numbers

We first globalize some recent results about polynomials whose divided differences are integer-valued on subsets of discrete valuation domains. This allows us to describe explicit computations, in particular for polynomials which are integer-valued on the prime numbers. Then, we specialize other recent results about integer-valued polynomials on triangular matrices to matrices whose coefficients are in some subsets, and in particular, when the coefficients are primes.     

The Basis Properties of Some Systems of Exponential Functions,Cosines, and Sines

We consider some systems of exponential functions, cosines, and sines with complex-valued coefficients and establish a necessary and sufficient condition for completeness and minimality of these systems in Lebesgue spaces.     

Computing the Homology of Real Projective Sets

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise). Its cost depends on the condition of the input as well as on its size and is singly exponential in the number of variables (the dimension of the ambient space) and polynomial in the condition and the degrees of the defining polynomials. In addition, we show that outside of an exceptional set of measure exponentially small in the size of the data, the algorithm takes exponential time.     

Interlacing properties of zeros of multiple orthogonal polynomials

It is well known that the zeros of orthogonal polynomials interlace. In this paper we study the case of multiple orthogonal polynomials. We recall known results and some recursion relations for multiple orthogonal polynomials. Our main result gives a sufficient condition, based on the coefficients in the recurrence relations, for the interlacing of the zeros of neighboring multiple orthogonal polynomials. We give several examples illustrating our result.     

Lebesgue constant for Lagrange interpolation on equidistant nodes

Properties of Lebesgue function for Lagrange interpolation on equidistant nodes are investigated. It is proved that Lebesgue function can be formulated both in terms of a hypergeometric function 2F1 and Jacobt polynomials. Moreover, an integral expression of Lebesgue function is also obtained and the asymptotic behavior of Lebesgue constant is studied.