Nonstandard Gaussian quadrature formulae based on operator values (Q963255)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5694695
Language Label Description Also known as
default for all languages
No label defined
    English
    Nonstandard Gaussian quadrature formulae based on operator values
    scientific article; zbMATH DE number 5694695

      Statements

      Nonstandard Gaussian quadrature formulae based on operator values (English)
      0 references
      19 April 2010
      0 references
      Let \(H=H_{\delta}\) be any right \(\delta\)-neighborhood of the number zero, i.e., \(H_{\delta}=[0,\delta),\,\delta>0.\) Let \({\mathcal A}^h,\,h\in H\), be the family of linear operators acting on the space of all algebraic polynomials \({\mathcal P}\), such that the degree of polynomials are preserved, i.e., \[ \text{deg}({\mathcal A}^hp)=\text{deg}(p),\tag{1} \] and \[ {\lim_{h\to 0^{+}}({\mathcal A}^hp)(x)=p(x),\,x\in C,} \tag{2} \] for any \(p\in {\mathcal P}\) and each \(h\in H\). For a given family of linear operators \({\mathcal A}^h, h\in H\), let the non-standard interpolatory quadrature of Gaussian type: \[ {\int_{R}f(x)d\mu(x)=\sum_{k=1}^{n}w_{k}({\mathcal A}^hf)(x_{k})+{\mathcal R}_{n}(f),} \tag{3} \] which is exact for each polynomial of degree at most \(2n-1\), i.e., \({\mathcal R}_{n}({\mathcal P}_{2n-1})=0\). The main results of this paper can be stated in the following form: Theorem 2.1 Let \({\mathcal A}^h,\, h\in H\), be a family of linear operators satisfying the conditions (1) and (2) and \(d\mu\) be a finite positive Borel measure on the real line with its support supp\((d\mu)\subset R\). For any \(n\in N\) there exists \(\varepsilon>0\), such that for every \(h\in H_{\varepsilon}=[0,\varepsilon)\) there exists the unique interpolatory quadrature formula (3) of Gaussian type, with nodes \(x_{k}\in \text{Co(supp}(\mu))\) and positive weights \(w_{k}>0,\,k=1,\dots,n\). Also, the authors propose a stable numerical algorithm for constructing such quadrature formulae. In particular, for some special classes of linear operators they obtain interesting explicit results connected with theory of orthogonal polynomials.
      0 references
      0 references
      Gaussian quadrature
      0 references
      interval quadrature
      0 references
      linear operator
      0 references
      zeros
      0 references
      weight
      0 references
      measure
      0 references
      degree of exactness
      0 references
      orthogonal polynomial
      0 references
      linear functional
      0 references
      non-standard interpolatory quadrature
      0 references
      numerical algorithm
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers