Polynomial bases for continuous function spaces, in Trends and Applications in Constructive

  • 格式:pdf
  • 大小:132.25 KB
  • 文档页数:11
i+j
(9)
The linearization coefficients g (i, j, k) are defined in terms of

Pi Pj =
k=0
g (i, j, k)Pk =
k=|i−j |
g (i, j, k)Pk ,
i, re g (i, j, |i − j |), g (i, j, i + j ) = 0. The nonnegativity of the linearization coefficients is sufficient for a special boundedness property, which we will introduce in Section 4.
n n
Kn (x, y ) =
k=0
Pk (x)Pk (y )h(k ) =
k=0
pk (x)pk (y ),
(5)
where h(k ) = (
S 2 Pk (x) dπ (x))−1 =
1 a2 0
k −1 i=0 ai , k i=1 ci
k ∈ N0 ,
(6)
and (pk )∞ k=0 is the orthonormal polynomial sequence with respect to π defined by pk = h(k )Pk . (7) For z ∈ S it holds (Kn (z, z ))−1 =

f=
k=0
ϕk Φk ,
(11)
2
where limn→∞ k=0 ϕk Φk is with respect to the sup-norm. A basis (Φk )∞ k=0 of polynomials is called polynomial basis. A polynomial basis with (1) is called Faber basis. There is a famous result of Faber [4] in 1914 that in case of S is an interval [c, d] there doesn’t exist a polynomial basis (Pk )∞ k=0 of C ([c, d]) with property (1). Concerning C ([c, d]) great efforts have been made in constructing polynomial bases and to minimize the degrees as far as possible. In 1977 Temlyakov [20] has investigated a method of construction, where the growth of the degrees fulfills deg Pk ≤ C k log log(k ). Later on, in 1985 Bochkarev [2] has used the Fej´ er kernel to construct a basis with linear bounds, that is deg Pk ≤ 4k . In 1987 Privalov [14] published a somehow negative result, which implies the result of Faber. Namely, if there is a polynomial basis (Pk )∞ k=0 of C ([c, d]), then there exists a δ > 0 such that deg Pk ≥ (1 + δ ) k for all k ≥ k0 , where k0 is a proper integer. Also, in 1991 Privalov gave a positive result, see [15]. He proved that for any ǫ > 0 there exists a polynomial basis of C ([c, d]) with deg Pk ≤ (1 + ǫ) k . Such a basis is called polynomial basis of optimal degree (with respect to ǫ). If we are searching for Banach spaces C (S ) equipped with a Faber basis, then we have to choose S different from an interval. In this setting spaces C (S ) with a so-called Lagrange basis are discussed in [16]. In Section 3 we investigate a basic class of compact sets S and gave a sufficient and necessary condition for the existence of a Lagrange basis. Note, that the results mentioned above are not based upon the fact of orthogonality. In case of orthogonality the question ”Does (Pk )∞ k=0 constitute an orthogonal polynomial basis of C (S )?” is equivalent to the question if any function f ∈ C (S ) is represented by its Fourier series
Polynomial bases for continuous function spaces
Josef Obermaier and Ryszard Szwarc
Abstract Let S ⊂ R denote a compact set with infinite cardinality and C (S ) the set of real continuous functions on S . We investigate the problem of polynomial and orthogonal polynomial bases of C (S ). In case of S = {s0 , s1 , s2 , . . .} ∪ {σ }, where (sk )∞ k=0 is a monotone sequence with σ = limk→∞ sk , we give a sufficient and necessary condition for the existence of a so-called Lagrange basis. Furthermore, we show that little q-Jacobi polynomials which fulfill a certain boundedness property constitute a basis in case of Sq = {1, q, q 2 , . . .} ∪ {0}, 0 < q < 1.
1
Introduction
One important goal in approximation theory is the representation of functions with respect to a set of simple functions. Here, we focus on the Banach space C (S ) of real continuous functions on a compact set S ⊂ R with infinite cardinality. Among the continuous functions polynomials are one of the most simple to deal with. Hence, further on we discuss the representation of f ∈ C (S ) with respect to a sequence of polynomials (Pk )∞ k=0 . Moreover, it is profitable to look for a sequence with deg Pk = k for all k ∈ N0 , (1) which guarantees that every polynomial has a finite representation. Of special interest are orthogonal polynomial sequences with respect to a probability measure π on S , where a representation is based on the Fourier coefficients ˆ(k ) = f f (x)Pk (x) dπ (x), k ∈ N0 , (2)
S
of f ∈ C (S ). Let us recall some important facts about orthogonal polynomials, see [3]. An orthogonal polynomial sequence (Pk )∞ k=0 with compact support S and property (1) satisfies a three term recurrence relation P1 (x)Pk (x) = ak Pk+1 (x) + bk Pk (x) + ck Pk−1 (x), starting with P0 (x) = a0 and P1 (x) = (x − b)/a, 1 (4) k ∈ N, (3)