Introduction

Wide application of spline approximations in the theory and practise is well known [14]. Essential point for spline constructions is the usage of approximationrelations which firstly appeared in the finite element method. Approximationrelations were introduced in [57]. Approximation and interpolation properties of spline-waveletdecompositions are based on relations just mentioned [8].

The main problem of spline-wavelet decompositions is the construction of the chain ofembedded spaces. The problem is discussed in the case of the spaces ofnon-polynomial splines for irregular grids [912]; there, the chains are constructed for smooth spaces (which are calledspaces of B φ splines) of the first, second, and third orders. Spline spaces of arbitraryorder were constructed by [8], but the embedding was obtained only for special non-smooth splinespaces.

The aims of this paper are to obtain necessary and sufficient conditions of existenceand smoothness for non-polynomial spline spaces of fifth order, to establish theuniqueness of the B φ -spline spaces in the class C4among mentioned spaces (of fixed grid), and to prove the embedding ofthe B φ -spline spaces corresponding to embedded grids.

Methods

In the paper, the approximation relations with initial grid and with complete chainof vectors are applied to obtaining of the minimal spline spaces. Usage of locallyorthogonal chain of vectors gives opportunity to construct special approximationrelations from which the initial space of B φ splines is constructed.

Results and discussion

Spaces of (X,A,φ) splines of fifth order

Consider the grid X={x j }j∈Z on interval (α,β),

X : < x 1 < x 0 < x 1 < ;

where x j ∈(α,β), α= lim j x j , β= lim j + x j , 0< c 1 x j + 1 x j x j x j 1 c 2 j∈Z, c1, and c2 are fixed.

Let φ(t) be column vector functionφ(t)∈R6,φC5[α,β] such that

|det(φ,φ ,φ ′′ ,φ ′′′ ,φ IV ,φ V )(t)|c>0t[α,β].
(1.1)

A set A={a j }j∈Z of column vectors a j ∈R6is called a chain of vectors. Differentenumerations are permitted for the same chain of vectors: two differentenumerations can be distinguished from each other with constant summand anddirection of numbering, for example, A= { a j } j Z with j=−j + j0 (where j0 is an integer constant) is another enumeration of the samechain.

A chain A={a i }i∈Z is locally orthogonal to a chain B={b j }j∈Zif there exist enumerations such that

b j T a j p =0jZ,p I 5 ,
(1.2)

where I5={1,2,3,4,5}.

Lemma 1

If a chain A is locally orthogonal to a chain B, then B islocally orthogonal to A.

Proof

Using Equation 1.2, we get

a j T b j + p = 0 j Z , p I 5 .

Now, we enumerate the chain {b j }j∈Z by definition bj=bj + 6.

Then,

a j T b j p = 0 j Z , p I 5 .

This concludes the proof. □

By Lemma 1 the local orthogonality is symmetric, and therefore, the discussedchains A and B are called locally orthogonal chains.

A chain A={a j }j∈Z is called a non-generated chain ifa j 0j∈Z.

Consider a square matrix A j =(aj−5,aj−4,aj−3,aj−2,aj−1,a j ).

The chain A={a j }j∈Z is called a complete chain of vectors ifdetA j ≠0∀j∈Z. It is clear that the complete chain isnon-generated.

Let A denote a set of all complete chains.

Lemma 2

Suppose A={a i }i∈Zand B={b j }j∈Zare non-generated locally orthogonal chains,then the following conditions are equivalent:

  1. (1)

    the chain A is a complete chain,

  2. (2)

    the chain B is a complete chain.

Proof

Let B be a complete chain. If A is not complete, then thereexists j∈Z such that a j =c1aj−1 + c2aj−2 + c3aj−3 + c4aj−4 + c5aj−5, where c1,c2,c3,c4,c5∈R1. Taking into account that A andB are locally orthogonal (see (1.2)), we obtain

b j T a j =0.
(1.3)

From Equation 1.2, we also deduce that

b j + p T a j =0p I 5 .
(1.4)

Combining Equations 1.3 and 1.4 gives a j =0. This contradiction proves the first part of the lemma. Second partis proved analogously. □

Lemma 3

If A={a i }i∈Z and B={b j }j∈Z are complete chains and relation (1.2) isfulfilled, then

b j T a j 0, b j + 6 T a j 0.
(1.5)

Proof

The proof is by reductio ad absurdum. If there existsj∈Z such that relation (1.3) holds, then by Equation 1.4, weget a j =0; this contradicts the completeness of the chain A. The firstrelation in Equation 1.5 is proved. Arguing as above, we find that thesecond relation in Equation 1.5 is true. □

Lemma 4

For an arbitrary complete chain A={a j }j∈Z, there exists a non-generated locallyorthogonal chain B={b j }j∈Zwhere the directions of vectors b j are uniquely defined (up to non-zero constant factor).

Proof

We fix integer k; let b k ∈R6be a vector satisfying

b k T a k p =0,p I 5 .
(1.6)

The conditions (1.6) are the linear system with respect to unknown vectorb k :

( a k 5 , a k 4 , a k 3 , a k 2 , a k 1 ) T b k =0.
(1.7)

By assumption, the chain A is complete; hence, vectors ak−5,ak−4, ak−3,ak−2, and ak−1are linearly independent. System (1.7) has aunique (up to constant factor) non-trivial solution b k , which can be defined by the identity

b k T x det ( a k 5 , a k 4 , a k 3 , a k 2 , a k 1 , x ) x R 6 .

This concludes the proof. □

Corollary 1

For any complete chain, there exists a locally orthogonal complete chaindefined uniquely up to non-zero constant factors.

Proof

Combining Lemmas 2 and 4, we prove the corollary.

By definition, put

M = j Z ( x j , x j + 1 ) , S j = [ x j , x j + 6 ] .

For AA we define the functions ω j (t), tM, and j∈Z, byapproximation relations

j Z a j ω j ( t ) φ ( t ) t ( x k , x k + 1 ) k Z ; supp ω j S j j Z .
(1.8)

If t is fixed in (x k ,xk + 1), then relation (1.8) contains at most six non-zerosummands:

j = k 5 k a j ω j (t)φ(t).
(1.9)

Discuss relation (1.9) as the system of linear equations with respect tounknown values ω j (t).

Let j be an arbitrary fixed integer. Consider relations (1.9) withk=j, k=j + 1, k=j+ 2, k=j + 3, k=j + 4, andk=j + 5. By Cramer’s theorem, we obtain

ω j ( t ) = det a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , φ ( t ) det a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , a j for t ( x j , x j + 1 ) ,
(1.10)
ω j ( t ) = det a j 4 , a j 3 , a j 2 , a j 1 , φ ( t ) , a j + 1 det a j 4 , a j 3 , a j 2 , a j 1 , a j , a j + 1 for t ( x j + 1 , x j + 2 ) ,
(1.11)
ω j ( t ) = det a j 3 , a j 2 , a j 1 , φ ( t ) , a j + 1 , a j + 2 det a j 3 , a j 2 , a j 1 , a j , a j + 1 , a j + 2 for t ( x j + 2 , x j + 3 ) ,
(1.12)
ω j ( t ) = det a j 2 , a j 1 , φ ( t ) , a j + 1 , a j + 2 , a j + 3 det a j 2 , a j 1 , a j , a j + 1 , a j + 2 , a j + 3 for t ( x j + 3 , x j + 4 ) ,
(1.13)
ω j ( t ) = det a j 1 , φ ( t ) , a j + 1 , a j + 2 , a j + 3 , a j + 4 det a j 1 , a j , a j + 1 , a j + 2 , a j + 3 , a j + 4 for t ( x j + 4 , x j + 5 ) ,
(1.14)
ω j ( t ) = det φ ( t ) , a j + 1 , a j + 2 , a j + 3 , a j + 4 , a j + 5 det a j , a j + 1 , a j + 2 , a j + 3 , a j + 4 , a j + 5 for t ( x j + 5 , x j + 6 ) .
(1.15)

Now, it follows from supp ω j ⊂[x j ,xj + 6] (see (1.8)) that the function ω j (t) is defined for all tM.

Equivalent record of formulas (1.10) to (1.15) is

ω j ( t ) = det { a j } j J k , j j | | j φ ( t ) det { a j } j J k , t ( x k , x k + 1 ) , k j I 5 ;
(1.16)

here J k ={k−5,k−4,k−3,k−2,k−1,k},columns of determinants are ordered uniformly, symbol ||jφ(t) indicates that column vectorφ(t) has to be placed instead of the columnvector a j .

By (1.1) the set of functions ω j j∈Z is a linearly independent system onarbitrary subinterval (a,b) of the interval(α,β). Consider the linear space

S 5 ( X , A , φ ) = C l p L { ω j } j Z ,

where L is the linear span, and C l p is the closure in the topology of point convergence. The spaceS5(X,A,φ) is called a spaceof minimal(X,A,φ)splines of fifthorder. □

Properties of minimal splines

Lemma 5

Suppose A is a complete chain and let k∈Z, t∈[x k ,xk + 1] be fixed, the following relations areequivalent:

( 1 ) ( 2 ) lim t t , t ( x k , x k + 1 ) ω j ( t ) = 0 ; det { a j } j J k , j j j φ ( t ) = 0 .

Proof

The proof is a consequence of (1.16). □

Lemma 6

Let A be a complete chain. For the validity of the equalities

lim t x k 0 ω k 6 (t)=0, lim t x k + 0 ω k (t)=0,
(2.1)

it is necessary (and if ak−6 and a k are not collinear, then it is also sufficient) that

lim t x k 0 ω j ( t ) = lim t x k + 0 ω j ( t ) j { k 5 , k 4 , k 3 , k 2 , k 1 } .
(2.2)

Proof

Necessity. Replacement of k by k−1 in (1.9) gives

j = k 6 k 1 a j ω j (t)φ(t),t( x k 1 , x k ).
(2.3)

Hence, by passing to the limits as tx k −0 and using the first condition (2.1), we obtain

j = k 5 k 1 a j ω j ( x k 0)=φ( x k ).
(2.4)

Analogously by using (1.9) and the second condition (2.1) astx k + 0, we arrive at

j = k 5 k 1 a j ω j ( x k +0)=φ( x k ).
(2.5)

In view of the linear independence of vectors ak−5, ak−4, ak−3, ak−2, and ak−1 by equalities (2.4) to (2.5), we obtainrelations (2.2). These completes the proof of necessity.

Sufficiency. Using (2.3) and (1.9), we have

j = k 6 k 1 a j ω j ( x k 0)=φ( x k )
(2.6)

and

j = k 5 k a j ω j ( x k +0)=φ( x k ),
(2.7)

respectively. It follows from (2.6), (2.7), and (2.2) that ak−6ωk−6(x k −0)=a k ω k (x k + 0); using linear independence of vectors ak−6and a k , we obtain equalities (2.1).

This completes the proof of Lemma 6. □

Theorem 1

Let A be a complete chain of vectors; then, the following conditionsare equivalent:

  1. (1)

    for any j∈Z functions ω j (t) are continuous on (α,β);

  2. (2)

    limit values at the boundary points of supp ω j are zero for all j∈Z.

Proof

Sufficiency. Since vector-function φ(t) is continuous,it will suffice to prove the continuity of the function ω j (t) in the knots of the grid X. If a knot x k is placed on the boundary of S j , the continuity of ω j (t) at x k follows from the hypotheses of the theorem. If a knot x k is placed inside S j , then conditions of Lemma 6 are fulfilled (in the part of necessity),and therefore, the relations (2.2) are true. Sufficiency is proved.

Necessity is obvious.

By definition, put φ k =φ(x k ), φ k ( i ) = φ ( i ) ( x k ). □

Theorem 2

The following conditions are equivalent:

  1. (1)

    functions ω j (t)(∀j∈Z) can be extended to (α,β) continuously;

  2. (2)

    relations

    det a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , φ j =0jZ
    (2.8)

are fulfilled.

Proof

Let us show that the condition (2) in Theorem 1 is equivalent to relations(2.8). Indeed, by (1.10), we see that equalities (2.8) are equivalent to

ω j ( x j +0)=0jZ.
(2.9)

Changing j to j + 6 in (2.8), we get

det a j + 1 , a j + 2 , a j + 3 , a j + 4 , a j + 5 , φ j + 6 =0jZ;
(2.10)

now using (1.15), we obtain

ω j ( x j + 6 0)=0jZ.
(2.11)

Thus, the equalities (2.8) are equivalent to the equalities (2.9) and (2.11);the last ones indicate that (2) is fulfilled. To conclude the proof, itremains to use Theorem 1. □

Theorem 3

Suppose φ(S)C(α,β),where S is a positive integer; then, the following conditions areequivalent:

  1. (1)

    the functions ω j ( S ) (t)(jZ) can be extended to (α,β) continuously,

  2. (2)

    relations

    det a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , φ j ( S ) = 0 j Z 2 . 8

are fulfilled.

Proof

By differentiating Equation 1.9 and using the arguments applied for proofs ofTheorems 1 and 2, we arrive at the required result. □

B φ splines of fifth order

Discuss a special case of relations (1.8) choosing a specific chain {a j }j∈Z.

First, we define vectors d k ∈R6by identities

d k T xdet( φ k ,φ k ,φ k ′′ ,φ k ′′′ ,φ k IV ,x)x R 6 ,kZ,
(3.1)

and introduce vectors a j with symbolic determinant

a j = det φ j + 1 φ j + 1 φ j + 1 ′′ φ j + 1 ′′′ φ j + 1 IV d j + 2 T φ j + 1 d j + 2 T φ j + 1 d j + 2 T φ j + 1 ′′ d j + 2 T φ j + 1 ′′′ d j + 2 T φ j + 1 IV d j + 3 T φ j + 1 d j + 3 T φ j + 1 d j + 3 T φ j + 1 ′′ d j + 3 T φ j + 1 ′′′ d j + 3 T φ j + 1 IV d j + 4 T φ j + 1 d j + 4 T φ j + 1 d j + 4 T φ j + 1 ′′ d j + 4 T φ j + 1 ′′′ d j + 4 T φ j + 1 IV d j + 5 T φ j + 1 d j + 5 T φ j + 1 d j + 5 T φ j + 1 ′′ d j + 5 T φ j + 1 ′′′ d j + 5 T φ j + 1 IV .
(3.2)
h X def = max j Z x j + 1 x j .

Theorem 4

Suppose that (1.1) is valid. Then, there exists δ>0 suchthat for h X <δ, the chain { a j } j Z is complete.

Proof

Using (1.1), we apply Taylor’s expansion for x=x j elements of determinant (3.2); as a result, we get asymptotic behaviorof a j (as h X →0) uniformly with respect tox∈(α,β). Using theasymptotics, the reader will easily prove the theorem. □

Theorem 5

The chains of vectors { d j T } i Z and { a i } i Z are locally orthogonal:

d j + p T a j =0jZ,p I 5 .
(3.3)

Proof

Using (3.2), we get

d j + p T a j = det d j + p T φ j + 1 d j + p T φ j + 1 d j + p T φ j + 1 ′′ d j + p T φ j + 1 ′′′ d j + p T φ j + 1 IV d j + 2 T φ j + 1 d j + 2 T φ j + 1 d j + 2 T φ j + 1 ′′ d j + 2 T φ j + 1 ′′′ d j + 2 T φ j + 1 IV d j + 3 T φ j + 1 d j + 3 T φ j + 1 d j + 3 T φ j + 1 ′′ d j + 3 T φ j + 1 ′′′ d j + 3 T φ j + 1 IV d j + 4 T φ j + 1 d j + 4 T φ j + 1 d j + 4 T φ j + 1 ′′ d j + 4 T φ j + 1 ′′′ d j + 4 T φ j + 1 IV d j + 5 T φ j + 1 d j + 5 T φ j + 1 d j + 5 T φ j + 1 ′′ d j + 5 T φ j + 1 ′′′ d j + 5 T φ j + 1 IV .

If p=1, then (3.1) implies that the first row of the determinant iszero; if p=2,3,4,5, then there are two equal rows in the discusseddeterminant. This completes the proof of Theorem 5.

Suppose the chain A = { a j } j Z is complete. We replace a j by a j in (1.8). Then, we obtain specific minimal splines, whichare denoted by ω j . □

Theorem 6

The relations ω j C 4 (α,β)jZ are true.

Proof

Relations (3.3) can be rewritten as d j a j i ,i I 5 or, equivalently,

d j L( a j 5 , a j 4 , a j 3 , a j 2 , a j 1 ).
(3.4)

Using (3.1), we have

d j L( φ j ,φ j ,φ j ′′ ,φ j ′′′ ,φ j IV ).
(3.5)

It follows from (3.4) and (3.5) that

L ( a j 5 , a j 4 , a j 3 , a j 2 , a j 1 ) = L ( φ j , φ j , φ j ′′ , φ j ′′′ , φ j IV ) ;

therefore, φ k ( S ) L( a j 5 , a j 4 , a j 3 , a j 2 , a j 1 ) for S=0,1,2,3,4. Thus,

det ( a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , φ k ( S ) ) = 0 .

To conclude the proof, we refer to Theorem 3. □

By definition, put

S 5 ( X , φ ) = C l p L { ω j } j Z .

According to Theorem 6, we obtain

S 5 ( X , φ ) C 4 ( α , β )

by S5(X,φ) denoting the set of all spaces of thesplines of fifth order (where grid X and function φ arefixed):

S 5 ( X , φ ) = { S 5 ( X , A , φ ) | A A } .

Theorem 7

There is a unique space S 5 (X,φ) in S5that is contained in C4(α,β).

S 5 ( X , φ ) = S 5 ( X , φ ) C 4 ( α , β ) .

Proof

By Theorem 3, the condition ω j C4(α,β) ∀j∈Z isequivalent to relations (2.12) for all S∈{0,1,2,3,4}. Supposea chain {a j }j∈Zsatisfies

det a j 5 , a j 4 , a j 3 , a j 2 , a j 1 , φ j ( S ) = 0 j Z , S = 0 , 1 , 2 , 3 , 4 .
(3.6)

We wish to prove that vector a j differs from a j with nonzero constant factors.

By Lemma 4, there exists a non-generated chain B={b j }j∈Zlocally orthogonal to chain {a j }j∈Z; directions of vectors b j are defined uniquely (up to constant factor):

b j L { a j 5 , a j 4 , a j 3 , a j 2 , a j 1 } .

Using condition (3.6), we have

φ j ( S ) L { a j 5 , a j 4 , a j 3 , a j 2 , a j 1 } , S = 0 , 1 , 2 , 3 , 4 ,

hence, b j φ j(S), S=0,1,2,3,4.

Thus,

b j L { φ j , φ j , φ j ′′ , φ j ′′′ , φ j IV } .

By assumption (1.1), vectors φ j , φ j′, φ j ′′, φ j ′′′, and φ j IV are linearly independent; it follows that b j =c j d j (see (3.1)), where constants c j are non-zero (for all j∈Z). The chains {a j }j∈Z and { a j } j Z , which are locally orthogonal to the chains {b j }j∈Z and {d j }j∈Z respectively, also differ by non-zero constantfactors c j⋆: a j = c j a j . Taking into account Equations 1.10 to 1.15, we have ω j = ω j / c j ; this completes the proof. □

Consider the relations

i = k 5 k a i ω i (t)=φ(t),
(3.7)

where t∈(x k ,xk + 1). Multiply both sides (3.7) on the left by d j T , wherej=k−5,k−4,k−3,k−2,k−1,k.By local orthogonality of the chains { d j T } i Z and { a i } i Z , we obtain six scalar relations

d k 5 T a k 5 d k 5 T a k 4 d k 5 T a k 3 d k 5 T a k 2 d k 5 T a k 1 d k 5 T a k 0 d k 4 T a k 4 d k 4 T a k 3 d k 4 T a k 2 d k 4 T a k 1 d k 4 T a k 0 0 d k 3 T a k 3 d k 3 T a k 2 d k 3 T a k 1 d k 3 T a k 0 0 0 d k 2 T a k 2 d k 2 T a k 1 d k 2 T a k 0 0 0 0 d k 1 T a k 1 d k 1 T a k 0 0 0 0 0 d k T a k × ω k 5 ( t ) ω k 4 ( t ) ω k 3 ( t ) ω k 2 ( t ) ω k 1 ( t ) ω k ( t )
= d k 5 T φ ( t ) , d k 4 T φ ( t ) , d k 3 T φ ( t ) , d k 2 T φ ( t ) , d k 1 T φ ( t ) , d k T φ ( t ) ) T
(3.8)

In the same way, multiplying both sides of (3.7) by d j T for j=k + 1,k + 2,k +3,k + 4,k + 5,k + 6 and using the localorthogonality of the chains { d j T } i Z and { a i } i Z , we get the next system of relations

d k + 1 T a k 5 0 0 0 0 0 d k + 2 T a k 5 d k + 2 T a k 4 0 0 0 0 d k + 3 T a k 5 d k + 3 T a k 4 d k + 3 T a k 3 0 0 0 d k + 4 T a k 5 d k + 4 T a k 4 d k + 4 T a k 3 d k + 4 T a k 2 0 0 d k + 5 T a k 5 d k + 5 T a k 4 d k + 5 T a k 3 d k + 5 T a k 2 d k + 5 T a k 1 0 d k + 6 T a k 5 d k + 6 T a k 4 d k + 6 T a k 3 d k + 6 T a k 2 d k + 6 T a k 1 d k + 6 T a k × ω k 5 ( t ) ω k 4 ( t ) ω k 3 ( t ) ω k 2 ( t ) ω k 1 ( t ) ω k ( t )
= d k + 1 T φ ( t ) , d k + 2 T φ ( t ) , d k + 3 T φ ( t ) , d k + 4 T φ ( t ) , d k + 5 T φ ( t ) , d k + 6 T φ ( t ) T
(3.9)

Discuss relations (3.8) and (3.9) as the systems of linear equations with respectto unknown values ω j (t), jJ k . Triangular matrices of these systems are non-singular since theirdiagonal elements are nonzero (see Lemma 3).

Note. Indeed, the solutions of the systems (3.8) and (3.9) areidentical.

Let I0={0,1,2,3,4,5}, I p 1 ={p,p+1,,5}, I p 2 ={4,3,,6p}, where pI0.

Lemma 7

The formulas (3.8) define the functions ω k p (t)p I 0 on the interval t∈(x k ,xk + 1) by values of the vector-functionφ(t) on this interval complemented with values ofmentioned vector function and its derivatives up to the fourth order in theknots x k + i i I p 1 .

Proof

From (3.1), it follows that vector d j is defined by vector-function φ(t) and itsderivatives up to the fourth order in the knot x j . Using (3.2), we see that the vector a s is defined by vector-function φ(t)and its derivatives up to the fourth order in the knots xs + iiI5. To conclude the proof, one should use the formula (3.8).□

Lemma 8

According to (3.9) the functions ω k p (t)p I 0 for t∈(x k ,xk + 1) are defined by the vector-functionφ(t) on this interval complemented with values ofthe mentioned vector function and its derivatives up to the fourth order inthe knots x k + i i I p 2 .

Proof

We again recall (3.1) and conclude that d j is defined by φ j and φ j ( q ) for q∈{1,2,3,4}; besides, according toformula (3.2), the vector a s is defined by φs + iand φ s + i ( q ) , where q∈{1,2,3,4},iI5. Now, the result follows from (3.9). □

Lemma 9

The functions ω k p (t) for pI0and t∈(x k ,xk + 1) are defined by φ(t) t ( x k , x k + 1 ) complemented with φk + iand φ k + i ( q ) for q∈{1,2,3,4}, i I p 1 I p 2 .

Proof

Since the values of vector function and its derivatives in the knots areunrestricted, the desired result follows from Lemmas 7 and 8. □

Theorem 8

The function ω j (t) is completely defined by φ(t) t [ x j , x j + 6 ] .

Proof

Using Lemma 9, we put k=j,j + 1,j +2,j + 3,j + 4,j + 5. This completes the proofof Theorem 8. □

Calibration relations

We enlarge the origin grid X by deletion of knot xk + 1, i.e., we put

x ~ j = x j for j k , x ~ j = x j + 1 for j k + 1 ,

and discuss a new grid X ~ = { x ~ j } j Z ,

X ~ : < x ~ 1 < x ~ 0 < x ~ 1 < .

We put φ ~ j = φ ( x ~ j ), φ ~ j =φ ( x ~ j ) and introduce the vectors d ~ k R 6 by identities

d ~ k T xdet( φ ~ k , φ ~ k , φ ~ k ′′ , φ ~ k ′′′ , φ ~ k IV ,x)x R 6 ,kZ.
(4.1)

Now, we define vectors a ~ j by symbolic determinant:

a ~ j = det φ ~ j + 1 φ ~ j + 1 φ ~ j + 1 ′′ φ ~ j + 1 ′′′ φ ~ j + 1 IV d ~ j + 2 T φ ~ j + 1 d ~ j + 2 T φ ~ j + 1 d ~ j + 2 T φ ~ j + 1 ′′ d ~ j + 2 T φ ~ j + 1 ′′′ d ~ j + 2 T φ ~ j + 1 IV d ~ j + 3 T φ ~ j + 1 d ~ j + 3 T φ ~ j + 1 d ~ j + 3 T φ ~ j + 1 ′′ d ~ j + 3 T φ ~ j + 1 ′′′ d ~ j + 3 T φ ~ j + 1 IV d ~ j + 4 T φ ~ j + 1 d ~ j + 4 T φ ~ j + 1 d ~ j + 4 T φ ~ j + 1 ′′ d ~ j + 4 T φ ~ j + 1 ′′′ d ~ j + 4 T φ ~ j + 1 IV d ~ j + 5 T φ ~ j + 1 d ~ j + 5 T φ ~ j + 1 d ~ j + 5 T φ ~ j + 1 ′′ d ~ j + 5 T φ ~ j + 1 ′′′ d ~ j + 5 T φ ~ j + 1 IV .
(4.2)

As before, we discuss approximation relations

j Z a ~ j ω ~ j ( t ) φ ( t ) t ( x ~ k , x ~ k + 1 ) k Z ; supp ω ~ j = [ x ~ j , x ~ j + 6 ] j Z
(4.3)

and put

S 5 ( X ~ , φ ) = C l p L { ω ~ j } j Z .

Theorem 9

If the grid X ~ is so fine that the chain A ~ = { a ~ j } j Z is complete, then

S 5 ( X ~ ,φ) S 5 (X,φ).
(4.4)

Proof

From the definition of the grid X ~ and (4.2) to (4.3), we deduce that

ω ~ j (t) ω j (t), a ~ j = a j forjk6,
(4.5)
ω ~ j (t) ω j + 1 (t), a ~ j = a j + 1 forjk+1.
(4.6)

With Equations 1.8 and 4.3, we have

j Z a ~ j ω ~ j ( t ) j Z a j ω j ( t ) t ( α , β ) ,

and (after annihilation of identical terms, defined by relations (4.5) to(4.6)) we obtain

j = k 5 k a ~ j ω ~ j (t) j = k 5 k + 1 a j ω j (t)t(α,β).
(4.7)

Discuss relations (4.7) as a system of linear equations with respect tounknown values { ω ~ k i (t)}, iI0. Because of the completeness of the chain A ~ , the matrix of the system is nonsingular. Now, we obtainmentioned functions { ω ~ k i (t)}, iI0, as linear combinations of basic functions ω j (t) of the space S 5 (X,φ); these representations are calibration relations indiscussed case [8]. The inclusion (4.4) is proved. □

Conclusions

Consequent deletion of the knots (one by one) generates the sequence of the embeddedspaces of B φ splines. Obtained results are successfully proved. They may be applied tospline-wavelet decompositions.

Author’s information

YKD is the Head of the Department of Parallel Algorithms. He is also a professor anda doctor of science.