Quadrature rules of Gaussian type for trigonometric polynomials with preassigned nodes (Q6546961)
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 7856375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quadrature rules of Gaussian type for trigonometric polynomials with preassigned nodes |
scientific article; zbMATH DE number 7856375 |
Statements
Quadrature rules of Gaussian type for trigonometric polynomials with preassigned nodes (English)
0 references
30 May 2024
0 references
The paper deals with quadrature rules of Gaussian type for trigonometric polynomials with preassigned nodes. In Section 1 (Introduction), the authors recall some notions regarding the trigonometric polynomials and the degree of exactness for Gaussian type quadratures for these polynomials. Section 2 is devoted to quadrature rules of Gaussian type for trigonometric polynomials with preassigned nodes. The main result of this section is Theorem 2.1, where necessary and sufficient conditions for a quadrature rule to be of Gaussian type are given. In Section 3, the authors discuss the optimal set of quadrature rules for trigonometric polynomials with preassigned nodes, the main result of the Section being Theorem 3.1. Finally, some numerical examples are presented.
0 references
multiple orthogonal polynomials
0 references
Gaussian type quadrature rules
0 references
quadrature rules wth preassigned nodes
0 references
optimal set of quadrature rules
0 references
0 references
0 references
0 references
0 references
0.8490871787071228
0 references
0.8366222977638245
0 references
0.8300943374633789
0 references
0.820160448551178
0 references
0.8076883554458618
0 references
