Symbolic-numeric Gaussian cubature rules

It is well known that Gaussian cubature rules are related to multivariate orthogonal polynomials. The cubature rules found in the literature use common zeroes of some linearly independent set of products of basically univariate polynomials. We show how a new family of multivariate orthogonal polynomials, so-called spherical orthogonal polynomials, leads to symbolic-numeric Gaussian cubature rules in a very natural way. They can be used for the integration of multivariate functions that in addition may depend on a vector of parameters and they are exact for multivariate parameterized polynomials. Purely numeric Gaussian cubature rules for the exact integration of multivariate polynomials can also be obtained.We illustrate their use for the symbolic-numeric solution of the partial differential equations satisfied by the Appell function F₂, which arises frequently in various physical and chemical applications. The advantage of a symbolic-numeric formula over a purely numeric one is that one obtains a continuous extension, in terms of the parameters, of the numeric solution. The number of symbolic-numeric nodes in our Gaussian cubature rules is minimal, namely m for the exact integration of a polynomial of homogeneous degree 2m−1.In Section 1 we describe how the symbolic-numeric rules are constructed, in any dimension and for any order. In Sections 2, 3 and 4 we explicit them on different domains and for different weight functions. An illustration of the new formulas is given in Section 5 and we show in Section 6 how numeric cubature rules can be derived for the exact integration of multivariate polynomials. From Section 7 it is clear that there is a connection between our symbolic-numeric cubature rules and numeric cubature formulae with a minimal (or small) number of nodes.     

Expansions over a Simplex of Real Functions by Means of Bernoulli Polynomials

In [1] there is an expansion in Bernoulli polynomials for sufficiently smooth real functions in an interval [a,b]R that has useful applications to numerical analysis. An analogous result in a 2-dimensional context is derived in [2] in the case of rectangle. In this note we generalize the above-mentioned one-dimensional expansion to the case of C ^m -functions on a 2-dimensional simplex; a method to generalize the expansion on an N-dimensional simplex is also discussed. This new expansion is applied to find new cubature formulas for 2-dimensional simplex.     

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.     

Minimal cubature formulas exact for Haar polynomials

The cubature formulas we consider are exact for spaces of Haar polynomials in one or two variables. Among all cubature formulas, being exact for the same class of Haar polynomials, those with a minimal number of nodes are of special interest. We outline here the research and construction of such cubature formulas.     

Gaussian Cubature Arising from Hybrid Characters of Simple Lie Groups

Lie groups with two different root lengths allow two ‘mixed sign’ homomorphisms on their corresponding Weyl groups, which in turn give rise to two families of hybrid Weyl group orbit functions and characters. In this paper we extend the ideas leading to the Gaussian cubature formulas for families of polynomials arising from the characters of irreducible representations of any simple Lie group, to new cubature formulas based on the corresponding hybrid characters. These formulas are new forms of Gaussian cubature in the short root length case and new forms of Radau cubature in the long root case. The nodes for the cubature arise quite naturally from the (computationally efficient) elements of finite order of the Lie group.     

Bounds on the error of fejer and clenshaw-curtis type quadrature for analytic functions

We consider the problem of integrating a function f : [-1,1] → R which has an analytic extension to an open disk D^r of radius r and center the origin, such that for any . The goal of this paper is to study the minimal error among all algorithms which evaluate the integrand at the zeros of the n-degree Chebyshev polynomials of first or second kind (Fejer type quadrature formulas) or at the zeros of (n-2)-degree Chebyshev polynomials jointed with the endpoints -1,1 (Clenshaw-Curtis type quadrature formulas), and to compare this error to the minimal error among all algorithms which evaluate the integrands at n points. In the case r > 1, it is easy to prove that Fejer and Clenshaw-Curtis type quadrature are almost optimal. In the case r = 1, we show that Fejer type formulas are not optimal since the error of any algorithm of this type is at least about n^-2. These results hold for both the worst-case and the asymptotic settings.     

基于Jacobi多项式零点的Grünwald插值算子

本文考虑基于一般Jacobi多项式J_n~(α,β)(x)(—1<α,β<1)零点的Grnwald插值多项式G_n(f,x);主要证明了G_n(f,x)在(—1,1)内几乎一致收敛于连续函数f(x),并给出了点态逼近估计;拓广和完善了文献[1,2]的结果。     

Numerical integration over polygons using an eight-node quadrilateral spline finite element

In this paper, a cubature formula over polygons is proposed and analysed. It is based on an eight-node quadrilateral spline finite element [C.-J. Li, R.-H. Wang, A new 8-node quadrilateral spline finite element, J. Comp. Appl. Math. 195 (2006) 54–65] and is exact for quadratic polynomials on arbitrary convex quadrangulations and for cubic polynomials on rectangular partitions. The convergence of sequences of the above cubatures is proved for continuous integrand functions and error bounds are derived. Some numerical examples are given, by comparisons with other known cubatures.     

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.     

An invariant cubature formula of degree nine for a hypercube

In this work, cubature formulas for computation of integrals over the hypercube in R ⁿ

$C_n = \{ x = (x_1 ,x_2 ,...,x_n ) \in R^n | - 1 \leqslant x_i \leqslant 1,i = 1,2,...,n\} $

are constructed using Sobolev?s theorem. These formulas are precise for all polynomials of degree at most nine and are invariant under the group of all orthogonal transformations of the hyperoctahedron

$G_n = \left\{ {x = (x_1 ,x_2 ,...,x_n ) \in R^n |\sum\limits_{i = 1}^n {|x_i |} \leqslant 1} \right\}$

onto itself.

Section 1 contains introduction into the subject and a review of known results. In Sections 2 and 3, we determine parameters of the cubature formula for n = 4 and n = 3, respectively. Numerical results (the nodes and coefficients of the cubature formulas) are presented in Section 4.     

一个无限可微函数类的最优Lagrange 插值

本文研究\,$[-1,1]$上的一个无限可微函数类$F_\infty$在空间$L_\infty[-1,1]$及加权空间$L_{p,\omega}[-1,1]$, $1\le p< \infty$ ($\omega$是$(-1,1)$上的非负连续可积函数)的最优Lagrange插值.我们证明了基于首项系数为1且于$L_{p,\omega}[-1,1]$上有最小范数的多项式零点的Lagrange插值对$1\le p< \infty$是最优的. 同时我们给出了当结点组包含端点时的最优结点组.     

Different Quality Indexes for Lattice Rules

We consider lattice rules (i.e. cubature formulas with equal coefficients whose nodes lie on a lattice) which are exact for trigonometric polynomials in two variables with different spectra. Various quality indexes are characterized. Extremal properties of indexes are obtained. A new family of lattice rules of trigonometric degree is presented. Also a family of lattice rules exact on trigonometric polynomials of a hexagonal spectrum is constructed.     

Inequalities for the Derivatives of Rational Functions with Real Zeros

We study Turán-type inequalities for the derivatives of rational functions, whose zeros are all real and lie inside [-1,1] but whose poles are outside (-1,1), in the supremum- and L2-norms respectively. We generalize several well-known results for classical polynomials. We also obtain a sharp L2 Bernstein-type inequality for the rational system with prescribed poles.     

WEIGHT FUNCTIONS FOR SOME NEW CLASSES OF ORTHOGONAL POLYNOMIALS

This article continue the discussion of finding weight functions for orthogonal polynomials in thtee situations. The Gegenbauer polynoraials are shown to have a distributional weight function.The polynomials of Geronimus [6] which are orthogonal on[—1,1]ale explicitely calculated.An application to Pade approximations is made.Two negative situations are mentioned.     

Cubature Formulas of a Nonalgebraic Degree of Precision

We deal with cubature formulas that are exact for polynomials and also for polynomials multiplied by r, where r is the Euclidean distance to the origin. A general lower bound for the number of nodes for a specified degree of precision is given. This bound is improved for centrally symmetric integrals. A set of constraints (consistency conditions) is introduced for the construction of fully symmetric formulas. For one dimension and arbitrary degree, it is shown that the lower bound is sharp for centrally symmetric integrals. For higher dimensions, as an illustration, cubature formulas are only constructed for low degrees. March 6, 2000. Date revised: April 30, 2001. Date accepted: May 31, 2001.     

Hermite-Fejér插值算子的一个渐近估计式

设f(x)在[-1,1]上的二阶导数存在且有界,H_n[f(t);x]、R_n[f(t);x]分别为具有第一类、第二类零点的Hermite-Fejér插值多项式,则当n→∞时,有 H_n[f(t);x]-f(x)=O(1/n)(-1相似文献   

Remarks on some associated Laguerre integral results

Motivated essentially by their possible need in a fairly large number of physical and chemical contexts, Mavromatis and Alassar [1] derived several associated Laguerre integral results by eliminating an unnecessary constraint used in an earlier paper on the subject by Mavromatis [2]. The main object of the present sequel to these recent works is to investigate and apply much more general families of integral formulas, involving products of two or more Laguerre polynomials, which have been considered in the mathematical literature rather extensively.     

求解第一类积分方程的正则化—小波方法及其数值试验

1 方法的描述 第一类(Fredholm)积分方程是指形如 (1.1)的积分方程,其中核k(x,y)和右端函数f(x)给定,u(x)是未知函数.许多物理、化学、力学和工程应用问题都能导致第一类积分方程.求解第一类积分方程的一个本质性困难是方程的不适定性,即解的存在性、唯一性和稳定性遭到破坏.常用的数值方法有奇异值分解(SVD)方法、Tikhonov正则化方法、投影方法、正则化-样条方法、再生核方法等.本文提出一种新的正则化-小波方法,在第一类积分方程有多个解时,可以求出具有最小范数的数值解;如果原积分方程有唯一解,则所得的数值解收敛于准确解.数值试验表明,该方法是可行的. 我们在L~2[a,b]中考虑第一类(Fredholm)积分方程,即假设方程(1.1)中积分算子K∈L~2([a,b]×[a,b])及右端f(x)∈L~2[a,b]给定.为保证数值求解算法的稳定性,我们先用正则化方法处理该方程,将不适定问题化为泛函极值问题来求解,然后利用多重正交样条小波基构造求解格式.由于我们给出了直接计算低阶的多重正交样条小波基函数的一般公式,使得解法可以在计算机迅速实现.     

Divergence of diagonal Padé approximants and the asymptotic behavior of orthogonal polynomials associated with nonpositive measures

In this paper we prove the existence of real- and complex-valued measuresμ on the interval [?1,1] with the property that the diagonal Padé approximants [n/n],n=1,2,..., to the functionf(z)=∫dμ(x)/(x?z) neither converge at any fixed pointz∈C～[?1,1] nor converge in capacity on any open (nonempty) setS inC～[?1,1]. This result is derived from a theorem on the asymptotic behavior of orthogonal polynomials. It will be shown that it is possible to construct measuresμ. on [?1,1] such that for any arbitrarily prescribed asymptotic behavior there exist subsequences of the associated orthogonal polynomialsQ _n that have this behavior.     

Difference Fourier transforms for nonreduced root systems

In the first part of the paper kernels are constructed which meromorphically extend the Macdonald-Koornwinder polynomials in their degrees. In the second part the kernels associated with rank one root systems are used to define nonsymmetric variants of the spherical Fourier transform on the quantum SU(1,1) group. Related Plancherel and inversion formulas are derived using double affine Hecke algebra techniques.