2014
DOI: 10.1142/s0219530513500309
|View full text |Cite
|
Sign up to set email alerts
|

A Generalization of the Ostrowski–gruss Inequality

Abstract: A new generalization of the Ostrowski–Gruss inequality is introduced in three different cases for functions in L1[a, b] and L∞[a, b] spaces and its application is given for deriving error bounds of some quadrature rules.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
9
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 15 publications
1
9
0
Order By: Relevance
“…Following the papers of Masjed-Jamei and Dragomir [9,10,11,12,13], let us introduce the integral transform L K (. ; x) as follows.…”
Section: The Operator L K (; X)mentioning
confidence: 99%
“…Following the papers of Masjed-Jamei and Dragomir [9,10,11,12,13], let us introduce the integral transform L K (. ; x) as follows.…”
Section: The Operator L K (; X)mentioning
confidence: 99%
“…where w(x) is a positive function on [a, b], {x k } n k=0 and {w k } n k=0 are respectively nodes and weight coefficients and R n+1 ( f ) is the corresponding error [18]. Let Π d be the set of algebraic polynomials of degree at most d. The quadrature formula (14) has degree of exactness d if for every p ∈ Π d we have R n+1 (p) = 0. In addition, if R n+1 (p) 0 for some Π d+1 , formula (14) has precise degree of exactness d. The convergence order of quadrature formula (14) depends on the smoothness of the function f as well as on its degree of exactness.…”
Section: Applications In Numerical Quadrature Rulesmentioning
confidence: 99%
“…Let Π d be the set of algebraic polynomials of degree at most d. The quadrature formula (14) has degree of exactness d if for every p ∈ Π d we have R n+1 (p) = 0. In addition, if R n+1 (p) 0 for some Π d+1 , formula (14) has precise degree of exactness d. The convergence order of quadrature formula (14) depends on the smoothness of the function f as well as on its degree of exactness. It is well known that for given n + 1 mutually different nodes {x k } n k=0 we can always achieve a degree of exactness d = n by interpolating at these nodes and integrating the interpolated polynomial instead of f .…”
Section: Applications In Numerical Quadrature Rulesmentioning
confidence: 99%
See 1 more Smart Citation
“…Also explicit error bounds for numerical quadrature and nonstandard quadrature formulas will be discussed. Also we recaptured many established results from articles [12], [13], [14] and [21].…”
mentioning
confidence: 99%