2000
DOI: 10.1007/pl00005412
|View full text |Cite
|
Sign up to set email alerts
|

Quadrature rules for rational functions

Abstract: It is shown how recent ideas on rational Gauss-type quadrature rules can be extended to Gauss-Kronrod, Gauss-Turán, and Cauchy principal value quadrature rules. Numerical examples illustrate the advantages in accuracy thus achievable. Mathematics Subject Classification (1991): 65D32 IntroductionThe idea of constructing quadrature rules that are exact for rational functions with prescribed poles, rather than for polynomials, has received some attention in recent years; see, e.g., [9], [10], [11], [2], [4]. Thes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
25
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(25 citation statements)
references
References 9 publications
0
25
0
Order By: Relevance
“…This has been largely studied when dealing with quadrature rules satisfying I σ (P) = I n (P), P being an arbitrary polynomial of degree as high as possible and σ (x) positive on [a, b] (for details, see the excellent survey [19]). On the other hand, in the last years, quadrature formulae exactly integrating rational functions with prescribed poles have been dealt with (see, for instance, [17,21]) and although numerical experiments have shown their effectiveness especially when the integrand f (x) possesses singularities close to [a, b] very few computer routines are still available (cf. [20]) and very few have been worked out in order to check error bounds for this type of quadrature rules (for a recent contribution on this topic, see [11]).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This has been largely studied when dealing with quadrature rules satisfying I σ (P) = I n (P), P being an arbitrary polynomial of degree as high as possible and σ (x) positive on [a, b] (for details, see the excellent survey [19]). On the other hand, in the last years, quadrature formulae exactly integrating rational functions with prescribed poles have been dealt with (see, for instance, [17,21]) and although numerical experiments have shown their effectiveness especially when the integrand f (x) possesses singularities close to [a, b] very few computer routines are still available (cf. [20]) and very few have been worked out in order to check error bounds for this type of quadrature rules (for a recent contribution on this topic, see [11]).…”
Section: Introductionmentioning
confidence: 99%
“…2) can be considered as rational functions with poles at the origin and at infinity. If we let those poles move and be placed so as to simulate the singularities of f great improvement in the approximation of the integral can be expected (see [21] for examples of this situation on the real line). This gave rise to the construction of quadrature formulae with nodes on the unit circle and exactly integrating rational functions with arbitrary poles not on T but fixed beforehand.…”
Section: Introductionmentioning
confidence: 99%
“…[9,10,11,14,15,22]). In what follows we will remark on some general features of the rational integration rules.…”
mentioning
confidence: 99%
“…The presence of difficult poles in the integrand causes slow convergence of the procedure, so we have to choose a suitable strategy as that of selecting some zeros of α N as difficult poles (cf. [9,10,11]). …”
mentioning
confidence: 99%
“…This is also true for the orthogonal rational functions, which have been under investigation with respect to rational Gauss-Chebyshev quadrature; see e.g. [15], [17], [18], [20], [29] and [30]. To get more general cases where explicit expressions are obtained, a technique of rational modifications of these Chebyshev weights are considered in [14].…”
Section: Introductionmentioning
confidence: 99%