The equal coefficients quadrature rules and their numerical improvement (Q2491027): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.01.130 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2098706016 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3996272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3136490 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3323133 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3847247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4195836 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:24, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The equal coefficients quadrature rules and their numerical improvement |
scientific article |
Statements
The equal coefficients quadrature rules and their numerical improvement (English)
0 references
18 May 2006
0 references
This paper deals with new equal coefficients quadrature rules of the following kind: \[ \int_a^b w(x)f(x)\text{ d}x\simeq C_n\sum_{i=1}^n f(x_i). \tag{1} \] In particular, after presenting some examples and showing that no integration formula of Newton-Cotes type with equal coefficients (other than the trapezoidal one) exists, the authors prove that the precision degree of constant coefficients formulas based on \(n\) quadrature nodes can be increased from \(n\) to \(n+2\) by taking the upper and the lower bounds of the integration formula as unknowns. In order to do this, starting from the assumption that (1) is exact for \(f(x)=x^j,\;j=0,\dots,n\), a matrix proof is provided to show that the nonlinear system for the basis \(f(x)=x^j,\;j=0,\dots,n+2\) has no analytic solution. So the system of order \((n+2)\times(n+2)\) is numerically solved for \(x_1,\ldots,x_n\) and the two additional unknowns \(a\) and \(b\), since \(C_n={1\over n}\int_a^b w(x)\text{ d}x\) by putting \(f(x)\equiv1\) in (1). Therefore the precision degree has been approximately increased by two degrees. A great deal of numerical examples show the computational efficiency of the improved equal coefficients rules with respect to well known methods, such as the two-point trapezoidal and the \(n\)-point Gauss-Chebyshev of the first kind rules. In particular it is worthy to point out that the improved 6-point and 7-point formulas can be compared in average with the 562-point and the 408-point formulas of usual Gauss-Legendre quadrature rules for all the examples presented.
0 references
quadrature formulas
0 references
equal coefficient quadrature rules
0 references
precision degree
0 references
method of undetermined coefficient
0 references
nonlinear system
0 references
comparison of methods
0 references
Newton-Cotes quadrature
0 references
numerical examples
0 references
Gauss-Legendre quadrature rules
0 references