2014
DOI: 10.1016/j.jat.2014.01.006
|View full text |Cite
|
Sign up to set email alerts
|

Dimension elevation in Müntz spaces: A new emergence of the Müntz condition

Abstract: We show that the limiting polygon generated by the dimension elevation algorithm with respect to the Müntz space span(1, t r1 , t r2 , ..., t rm , ...), with 0 < r 1 < r 2 < ... < r m < ... and lim n→∞ r n = ∞, over an interval [a, b] ⊂]0, ∞[ converges to the underlying Chebyshev-Bézier curve if and only if the Müntz condition ∞ i=1 1 ri = ∞ is satisfied. The surprising emergence of the Müntz condition in the problem raises the question of a possible connection between the density questions of nested Chebyshev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
(34 reference statements)
0
5
0
Order By: Relevance
“…However, in general, the initial ordinary basis F α,β n can iteratively be appended by new linearly independent functions in infinitely many ways and not every choice of functions leads to a sequence of order elevated control polygons that fulfills the desired convergence property, e.g. in EC Müntz spaces a recent characterization of the required convergence of the dimension/order elevation process can be found in [1]. In order to illustrate the last step of Algorithm 2.1, Fig.…”
Section: Main Results and Remarksmentioning
confidence: 99%
See 2 more Smart Citations
“…However, in general, the initial ordinary basis F α,β n can iteratively be appended by new linearly independent functions in infinitely many ways and not every choice of functions leads to a sequence of order elevated control polygons that fulfills the desired convergence property, e.g. in EC Müntz spaces a recent characterization of the required convergence of the dimension/order elevation process can be found in [1]. In order to illustrate the last step of Algorithm 2.1, Fig.…”
Section: Main Results and Remarksmentioning
confidence: 99%
“…Let n ≥ 1 be a fixed integer and consider the extended Chebyshev (EC) system F α,β n = ϕ n,i (u) : u ∈ [α, β] n i=0 , ϕ n,0 ≡ 1, − ∞ < α < β < ∞ (1) of basis functions in C n ([α, β]), i.e., by definition [15], for any integer 0 ≤ r ≤ n, any strictly increasing sequence of knot values α ≤ u 0 < u 1 < . .…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…, r n are consecutive integers, for design algorithms are hardly more complicated that in the polynomial case [29,30,3]. Such spaces are referred to as complete Müntz spaces in [3], see also [6,5]. From now on, we limit ourselves to the cubic-like case n = 3.…”
Section: Design With Sparse Cubic-like Müntz Spaces and Splinesmentioning
confidence: 99%
“…With these notations, the key-point to prove Theorem 3.1 is the following lemma, for the proof of which we refer to [2], see also [1]. Lemma 3.2 Assume that the Müntz density condition (8) holds.…”
Section: Müntz Spaces Over Positive Intervalsmentioning
confidence: 99%