2011
DOI: 10.1090/surv/178/06
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian quadrature

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 0 publications
0
13
0
Order By: Relevance
“…There exists a large number of error estimates involving lower order derivatives of the integrand, available in the work by Brass et al [4,5]. Alternatively, one can estimate the error through a contour integral, which is what we will do in the following section.…”
Section: The Gauss-legendre Quadrature Rulementioning
confidence: 99%
“…There exists a large number of error estimates involving lower order derivatives of the integrand, available in the work by Brass et al [4,5]. Alternatively, one can estimate the error through a contour integral, which is what we will do in the following section.…”
Section: The Gauss-legendre Quadrature Rulementioning
confidence: 99%
“…Let d be the number of sample points to be used in the approximation and sh the roots of the Hermite polynomial Qdfalse(sfalse)false(h=1,2,,dfalse) with associated weights wh. Then by applying the Gauss–Hermite approximation to the integral in lRfalse(θfalse) we have rightlR(boldθ)centerleftlnh(trueπ˜)+i=1Klnh=1dwh,ifyi(sh,i,boldθ). By Theorem 5.1.9 of Brass & Petras (), for each i , i=1,,K, the Gauss–Hermite approximation converges to the exact integral as d.…”
Section: The Model and Parameter Estimationmentioning
confidence: 97%
“…For ℓ > 1 we have the nodes These rules are called Clenshaw-Curtis (CC) quadrature rules. It is well known that the CC-rules are positive rules, that is a ℓ j > 0 for all j and ℓ, see [4]. Observe that the nodes of the U ℓ are nested, since…”
Section: The Ccs Algorithmmentioning
confidence: 99%