Optimal quadrature formulas in the sense of Sard in \(W_2^{(m,m-1)}\) space (Q2017984)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal quadrature formulas in the sense of Sard in \(W_2^{(m,m-1)}\) space
    scientific article

      Statements

      Optimal quadrature formulas in the sense of Sard in \(W_2^{(m,m-1)}\) space (English)
      0 references
      0 references
      23 March 2015
      0 references
      The authors consider quadrature formulas \[ \int_0^1 \varphi(x)\,dx \approx \sum_{j=0}^N C_j\,\varphi(x_j) \] for functions \(\varphi \in W_2^{(m,m-1)}(0,1)\) with \(m\geq 1\), i.e., \(\varphi:\,[0,\,1] \to {\mathbb R}\), \(\varphi^{(m-1)}\) is absolutely continuous, and \(\varphi^{(m)} \in L_2(0,1)\). Minimization of the norm of the corresponding error functional by the coefficients \(C_j\), when the nodes \(x_j\) are fixed, is called Sard's problem. The obtained quadrature formula is the optimal quadrature formula in the sense of Sard. Based on the method of \textit{S. L. Sobolev} [Sov. Math., Dokl. 18, 896--900 (1977); translation from Dokl. Akad. Nauk SSSR 235, 34--37 (1977; Zbl 0443.41021)], the authors obtain new optimal quadrature formulas in the sense of Sard for \(N+1 \geq m\). Explicit expressions of the optimal coefficients \(C_j\) are given. For \(m=1\), the norm of the error functional of the optimal quadrature formula in \(W_2^{(1,0)}(0,1)\) is calculated. Note that the error of the optimal quadrature formula in \(W_2^{(1,0)}(0,1)\) is less than the error of the optimal quadrature formula in the Sobolev space \(L_2^{(1)}(0,1)\). Numerical results are given, too.
      0 references
      quadrature formulas
      0 references
      optimal quadrature formulas in the sense of Sard
      0 references
      optimal coefficients
      0 references
      fixed nodes
      0 references
      error functional
      0 references
      numerical result
      0 references
      0 references
      0 references

      Identifiers