1993
DOI: 10.1006/jath.1993.1066
|View full text |Cite
|
Sign up to set email alerts
|

A Convergence Result in Nodal Spline Interpolation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

1993
1993
2014
2014

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…Also, from (4. which, together with the above mentioned significant improvement obtained for uniform partitions, clearly illustrates the usefulness of Peano kernel techniques for interpolation error analysis as opposed to the cruder estimation methods based on estimating the Lebesgue constant &V& , as employed in [7,9].…”
Section: (234)mentioning
confidence: 72%
See 3 more Smart Citations
“…Also, from (4. which, together with the above mentioned significant improvement obtained for uniform partitions, clearly illustrates the usefulness of Peano kernel techniques for interpolation error analysis as opposed to the cruder estimation methods based on estimating the Lebesgue constant &V& , as employed in [7,9].…”
Section: (234)mentioning
confidence: 72%
“…69 81], to obtain, for f # C r [a, b], r=1, 2, 3, error constants in the Jackson-type bounds for & f&Vf & which are, in particular for the uniform primary knot sequence (1.14), significantly smaller than the corresponding error constants obtained in [7,9].…”
Section: Introductionmentioning
confidence: 93%
See 2 more Smart Citations
“…In [4] two examples of sequences { f N } based on locally uniform partitions and satisfying (4)-(6) are provided for any positive integer p. These are the modified approximating splines and the modified optimal nodal splines, which are obtained by modifying the approximating splines [8] as well as the optimal nodal splines [1,2,3] in such a way that condition (5) is true for any positive integer p. In this paper, we consider sequences of approximating splines for which we can prove (4)-(6) without modifying their definition on [a, b]. In particular, we shall consider the Martensen spline operator, introduced in [9] and recently studied in [15,16].…”
Section: G(x + H) − G(x)| G ∈ C(j)mentioning
confidence: 99%