Computation of differentiating matrices for classical orthogonal polynomials of continuous and discrete argument

Recurrences are derived for computing the elements of the differentiating matrix for classical orthogonal polynomials of continuous and discrete argument. Two approaches to construction of difference differentiation formulas are considered. Examples of differentiating matrices for Hahn and Chebyshev orthogonal polynomials of discrete argument are given.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 73, pp. 19–24, 1992.     

基于前向差分的一阶数值微分公式验证与实践

根据多项式插值理论,可以通过构造相应的插值多项式来逼近未知的目标函数,再进一步求一阶导数,从而得到该目标函数的一阶数值微分公式.对于此数值微分公式,探讨基于前向差分的未知目标函数的多点一阶微分近似公式;即,等间距情况下的二至十六个数据点的前向差分公式.计算机数值实验进一步验证与表明,该用于未知目标函数一阶数值微分的多点公式可以取得较高的计算精度.     

Numerical methods based on multipoint Hermite interpolating polynomials for solving the Cauchy problem for stiff systems of ordinary differential equations

Families of A-, L-, and L(δ)-stable methods are constructed for solving the Cauchy problem for a system of ordinary differential equations (ODEs). The L(δ)-stability of a method with a parameter δ ∈ (0, 1) is defined. The methods are based on the representation of the right-hand sides of an ODE system at the step h in terms of two-or three-point Hermite interpolating polynomials. Comparative results are reported for some test problems. The multipoint Hermite interpolating polynomials are used to derive formulas for evaluating definite integrals. Error estimates are given.     

Bivariate interpolating polynomials and splines (I)

The multivariate splines which were first presented by de Boor as a complete theoretical system have intrigued many mathematicians who have devoted many works in this field which is still in the process of development. The author of this paper is interested in the area of interpolation with special emphasis on the interpolation methods and their approximation orders. But such B-splines (both univariate and multivariate) do not interpolated directly, so I approached this problem in another way which is to extend my interpolating spline of degree 2n-1 in univariate case (See[7]) to multivariate case. I selected triangulated region which is inspired by other mathematician’s works (e.g. [2] and [3]) and extend the interpolating polynomials from univariate to m-variate case (See [10])In this paper some results in the case m=2 are discussed and proved in more concrete details. Based on these polynomials, the interpolating splines (it is defined by me as piecewise polynomials in which the unknown partial derivatives are determined under certain continuous conditions) are also discussed. The approximation orders of interpolating polynomials and of cubic interpolating splines are inverstigated. We limited our discussion on the rectangular domain which is partitioned into equal right triangles. As to the case in which the rectangular domain is partitioned into unequal right triangles as well as the case of more complicated domains, we will discuss in the next paper.     

Generalized Stieltjes Polynomials and Rational Gauss–Kronrod Quadrature

Generalized Stieltjes polynomials are introduced and their asymptotic properties outside the support of the measure are studied. As applications, we prove the convergence of sequences of interpolating rational functions, whose poles are partially fixed, to Markov functions and give an asymptotic estimate of the error of rational Gauss–Kronrod quadrature formulas when functions which are analytic on some neighborhood of the set of integration are considered.     

Closed-form expressions for the finite difference approximations of first and higher derivatives based on Taylor series

Numerical differentiation formulas based on interpolating polynomials, operators and lozenge diagrams can be simplified to one of the finite difference approximations based on Taylor series. In this paper, we have presented closed-form expressions of these approximations of arbitrary order for first and higher derivatives. A comparison of the three types of approximations is given with an ideal digital differentiator by comparing their frequency responses. The comparison reveals that the central difference approximations can be used as digital differentiators, because they do not introduce any phase distortion and their amplitude response is closer to that of an ideal differentiator. It is also observed that central difference approximations are in fact the same as maximally flat digital differentiators. In the appendix, a computer program, written in MATHEMATICA is presented, which can give the approximation of any order to the derivative of a function at a certain mesh point.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

Representations of Central Matrix-Valued Carathéodory Functions in Both Nondegenerate and Degenerate Cases

We derive left and right quotient representations for central q × q matrix-valued Carathéodory functions. Moreover, we obtain recurrent formulas for the matrix polynomials involved in the quotient representations. These formulas are the starting point for getting recurrent formulas for those matrix polynomials which occur in the Arov-Krein resolvent matrix for the nondegenerate matricial Carathéodory problem.     

A combinatorial formula for Macdonald polynomials

In this paper we use the combinatorics of alcove walks to give uniform combinatorial formulas for Macdonald polynomials for all Lie types. These formulas resemble the formulas of Haglund, Haiman and Loehr for Macdonald polynomials of type GLn. At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent and Littelmann).     

Peters type polynomials and numbers and their generating functions: Approach with p‐adic integral method

The aim of this paper is to introduce and investigate some of the primary generalizations and unifications of the Peters polynomials and numbers by means of convenient generating functions and p‐adic integrals method. Various fundamental properties of these polynomials and numbers involving some explicit series and integral representations in terms of the generalized Stirling numbers, generalized harmonic sums, and some well‐known special numbers and polynomials are presented. By using p‐adic integrals, we construct generating functions for Peters type polynomials and numbers (Apostol‐type Peters numbers and polynomials). By using these functions with their partial derivative eqautions and functional equations, we derive many properties, relations, explicit formulas, and identities including the Apostol‐Bernoulli polynomials, the Apostol‐Euler polynomials, the Boole polynomials, the Bernoulli polynomials, and numbers of the second kind, generalized harmonic sums. A brief revealing and historical information for the Peters type polynomials are given. Some of the formulas given in this article are given critiques and comments between previously well‐known formulas. Finally, two open problems for interpolation functions for Apostol‐type Peters numbers and polynomials are revealed.     

On Divergence of Hermite—Fejér Interpolation to f(z)=z in the Complex Plane

We show that for a broad class of interpolatory matrices on [-1,1] the sequence of polynomials induced by Hermite—Fejér interpolation to f(z)=z diverges everywhere in the complex plane outside the interval of interpolation [-1,1] . This result is in striking contrast to the behavior of the Lagrange interpolating polynomials. June 15, 1998. Date accepted: January 26, 1999.     

多元分离子的构造与应用

本文研究了两类多元分离子的构造方法并提出计算公式.分析了多元分离子与Groebner 基的关系.把所求分离子应用到多元插值问题上,得到在字典序与广义字典序下用分离子表示的多元插值多项式.数值模拟显示了所述方法的有效性.     

Kazhdan–Lusztig polynomials of boolean elements

We give closed combinatorial product formulas for Kazhdan–Lusztig polynomials and their parabolic analogue of type q in the case of boolean elements, introduced in (Marietti in J. Algebra 295:1–26, 2006), in Coxeter groups whose Coxeter graph is a tree. Such formulas involve Catalan numbers and use a combinatorial interpretation of the Coxeter graph of the group. In the case of classical Weyl groups, this combinatorial interpretation can be restated in terms of statistics of (signed) permutations. As an application of the formulas, we compute the intersection homology Poincaré polynomials of the Schubert varieties of boolean elements.     

Asymptotic Conditions for Degree Diminution Along Prescribed Lines

One of the problems in bivariate polynomial interpolation is the choice of a space of polynomials suitable for interpolating a given set of data. Depending on the number of data, a usual space is that of polynomials in 2 variables of total degree not greater than k. However, these spaces are not enough to cover many interpolation problems. Here, we are interested in spaces of polynomials of total degree not greater than k whose degree diminishes along some prescribed directions. These spaces arise naturally in some interpolation problems and we describe them in terms of polynomials satisfying some asymptotic interpolation conditions. This provides a general frame to the interpolation problems studied in some of our recent papers.     

On the theory of the matching polynomial

In this paper we report on the properties of the matching polynomial α(G) of a graph G. We present a number of recursion formulas for α(G), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We consider the relation between the matching and characteristic polynomials of a graph. Finally, we consider results which provide information on the zeros of α(G).     

Optimal points for numerical differentiation

Newn-pointr ^th derivative Lagrangian numerical differentiation formulas employ the best irregular locations of points, A. From the standpoint of highest degree accuracy for derivatives at a singlefixed point (n ^th degree accuracy proven to be the highestexactly attainable for anyr). B. From the Tschebyscheff standpoint of minimal largest |remainder| over an argument range. In B the dominant term in the remainder is minimal for arguments at the zeros ofr ^th order integrals of Tschebyscheff polynomials specialized by addition of suitable (r–1)^th degree polynomials chosen to produce real, distinct locations of points within or fairly close to the range of optimization. First and second derivative formulas up to nine-point, are obtained with remainder estimates.Presented at the Eleventh International Congress of Mathematicians Edinburgh, Scotland, August 14–21, 1958.     

Discrete Fourier Analysis on Fundamental Domain and Simplex of A d Lattice in d-Variables

A discrete Fourier analysis on the fundamental domain Ω _d of the d-dimensional lattice of type A _d is studied, where Ω₂ is the regular hexagon and Ω₃ is the rhombic dodecahedron, and analogous results on d-dimensional simplex are derived by considering invariant and anti-invariant elements. Our main results include Fourier analysis in trigonometric functions, interpolation and cubature formulas on these domains. In particular, a trigonometric Lagrange interpolation on the simplex is shown to satisfy an explicit compact formula and the Lebesgue constant of the interpolation is shown to be in the order of (log n) ^d . The basic trigonometric functions on the simplex can be identified with Chebyshev polynomials in several variables already appeared in literature. We study common zeros of these polynomials and show that they are nodes for a family of Gaussian cubature formulas, which provides only the second known example of such formulas.     

Composite mixed finite elements on plane quadrilaterals

Mixed finite elements over a plane convex quadrilateral are obtained by assembling two Raviart-Thomas mixed finite elements over triangles. The macroelement is given by an eliminating procedure of the degrees of freedom related to the common edge to the two triangles. This procedure results in a finite element with a space of interpolating functions containing the polynomials of degree ? l, where l is the greater integer for which the same property is satisfied by the relevant Raviart-Thomas [Mathematical Aspects of Finite Element Methods, Roma 1975, I. Galligani and E. Magenes, Eds., Lecture Notes in Mathematics Vol. 606, Springer-Verlag, Berlin, 1975] mixed finite element. The interpolation error is estimated by means of the technique of almost equivalent affine element as given by Ciavaldini and Nédélec [Rev. Fr. Autom. Inf. Recher. Opérationnelle Ser. Rouge R2 , 29–45 (1974)]. © 1993 John Wiley & Sons, Inc.     

Some formulas involvingq-Jacobi and related polynomials

Summary A number of linear and bilinear generating functions, and connection formulas, are proved for q-Jacobi polynomials and for various q-orthogonal polynomials associated with them. Relationships between different q-extensions of the classical Gegenbauer (or ultraspherical) polynomials are also studied systematically.     

Faber polynomials corresponding to rational exterior mapping functions

Faber polynomials corresponding to rational exterior mapping functions of degree (m, m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are derived.