Trisha Shetty (Editor)

Carleman matrix

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, a Carleman matrix is a matrix used to convert function composition into matrix multiplication. It is often used in iteration theory to find the continuous iteration of functions which cannot be iterated by pattern recognition alone. Other uses of Carleman matrices occur in the theory of probability generating functions, and Markov chains.

Contents

Definition

The Carleman matrix of an infinitely differentiable function f ( x ) is defined as:

M [ f ] j k = 1 k ! [ d k d x k ( f ( x ) ) j ] x = 0   ,

so as to satisfy the (Taylor series) equation:

( f ( x ) ) j = ∑ k = 0 ∞ M [ f ] j k x k .

For instance, the computation of f ( x ) by

f ( x ) = ∑ k = 0 ∞ M [ f ] 1 , k x k .  

simply amounts to the dot-product of row 1 of M [ f ] with a column vector [ 1 , x , x 2 , x 3 , . . . ] τ .

The entries of M [ f ] in the next row give the 2nd power of f ( x ) :

f ( x ) 2 = ∑ k = 0 ∞ M [ f ] 2 , k x k   ,

and also, in order to have the zero'th power of f ( x ) in M [ f ] , we aadopt the row 0 containing zeros everywhere except the first position, such that

f ( x ) 0 = 1 = ∑ k = 0 ∞ M [ f ] 0 , k x k = 1 + ∑ k = 1 ∞ 0 ∗ x k   .

Thus, the dot product of M [ f ] with the column vector [ 1 , x , x 2 , . . . ] τ yields the column vector [ 1 , f ( x ) , f ( x ) 2 , . . . ] τ

M [ f ] ∗ [ 1 , x , x 2 , x 3 , . . . ] τ = [ 1 , f ( x ) , ( f ( x ) ) 2 , ( f ( x ) ) 3 , . . . ] τ .

Bell matrix

The Bell matrix of a function f ( x ) is defined as

B [ f ] j k = 1 j ! [ d j d x j ( f ( x ) ) k ] x = 0   ,

so as to satisfy the equation

( f ( x ) ) k = ∑ j = 0 ∞ B [ f ] j k x j   ,

so it is the transpose of the above Carleman matrix.

Jabotinsky matrix

Eri Jabotinsky developed that concept of matrices 1947 for the purpose of representation of convolutions of polynomials. In an article "Analytic Iteration" (1963) he introduces the term "representation matrix", and generalized that concept to two-way-infinite matrices. In that article only functions of the type f ( x ) = a 1 x + ∑ k = 2 ∞ a k x k are discussed, but considered for positive *and* negative powers of the function. Several authors refer to the Bell matrices as "Jabotinsky matrix" since (D. Knuth 1992, W.D. Lang 2000), and possibly this shall grow to a more canonical name.

Analytic Iteration Author(s): Eri Jabotinsky Source: Transactions of the American Mathematical Society, Vol. 108, No. 3 (Sep., 1963), pp. 457–477 Published by: American Mathematical Society Stable URL: http://www.jstor.org/stable/1993593 Accessed: 19/03/2009 15:57

Generalization

A generalization of the Carleman matrix of a function can be defined around any point, such as:

M [ f ] x 0 = M x [ x − x 0 ] M [ f ] M x [ x + x 0 ]

or M [ f ] x 0 = M [ g ] where g ( x ) = f ( x + x 0 ) − x 0 . This allows the matrix power to be related as:

( M [ f ] x 0 ) n = M x [ x − x 0 ] M [ f ] n M x [ x + x 0 ]

Matrix properties

These matrices satisfy the fundamental relationships:

  • M [ f ∘ g ] = M [ f ] M [ g ]   ,
  • B [ f ∘ g ] = B [ g ] B [ f ]   ,

    • which makes the Carleman matrix M a (direct) representation of f ( x ) , and the Bell matrix B an anti-representation of f ( x ) . Here the term f ∘ g denotes the composition of functions f ( g ( x ) ) .

    Other properties include:

  • M [ f n ] = M [ f ] n , where f n is an iterated function and
  • M [ f − 1 ] = M [ f ] − 1 , where f − 1 is the inverse function (if the Carleman matrix is invertible).

    • Examples

    The Carleman matrix of a constant is:

    M [ a ] = ( 1 0 0 ⋯ a 0 0 ⋯ a 2 0 0 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of the identity function is:

    M x [ x ] = ( 1 0 0 ⋯ 0 1 0 ⋯ 0 0 1 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of a constant addition is:

    M x [ a + x ] = ( 1 0 0 ⋯ a 1 0 ⋯ a 2 2 a 1 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of the successor function is equivalent to the Binomial coefficient:

    M x [ 1 + x ] = ( 1 0 0 0 ⋯ 1 1 0 0 ⋯ 1 2 1 0 ⋯ 1 3 3 1 ⋯ ⋮ ⋮ ⋮ ⋮ ⋱ ) M x [ 1 + x ] j k = ( j k )

    The Carleman matrix of the logarithm is related to the (signed) Stirling numbers of the first kind scaled by factorials:

    M x [ log ⁡ ( 1 + x ) ] = ( 1 0 0 0 0 ⋯ 0 1 − 1 2 1 3 − 1 4 ⋯ 0 0 1 − 1 11 12 ⋯ 0 0 0 1 − 3 2 ⋯ 0 0 0 0 1 ⋯ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ ) M x [ log ⁡ ( 1 + x ) ] j k = s ( k , j ) j ! k !

    The Carleman matrix of the logarithm is related to the (unsigned) Stirling numbers of the first kind scaled by factorials:

    M x [ − log ⁡ ( 1 − x ) ] = ( 1 0 0 0 0 ⋯ 0 1 1 2 1 3 1 4 ⋯ 0 0 1 1 11 12 ⋯ 0 0 0 1 3 2 ⋯ 0 0 0 0 1 ⋯ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ ) M x [ − log ⁡ ( 1 − x ) ] j k = | s ( k , j ) | j ! k !

    The Carleman matrix of the exponential function is related to the Stirling numbers of the second kind scaled by factorials:

    M x [ exp ⁡ ( x ) − 1 ] = ( 1 0 0 0 0 ⋯ 0 1 1 2 1 6 1 24 ⋯ 0 0 1 1 7 12 ⋯ 0 0 0 1 3 2 ⋯ 0 0 0 0 1 ⋯ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ ) M x [ exp ⁡ ( x ) − 1 ] j k = S ( k , j ) j ! k !

    The Carleman matrix of exponential functions is:

    M x [ exp ⁡ ( a x ) ] = ( 1 0 0 0 ⋯ 1 a a 2 2 a 3 6 ⋯ 1 2 a 2 a 2 4 a 3 3 ⋯ 1 3 a 9 a 2 2 9 a 3 2 ⋯ ⋮ ⋮ ⋮ ⋮ ⋱ ) M x [ exp ⁡ ( a x ) ] j k = ( j a ) k k !

    The Carleman matrix of a constant multiple is:

    M x [ c x ] = ( 1 0 0 ⋯ 0 c 0 ⋯ 0 0 c 2 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of a linear function is:

    M x [ a + c x ] = ( 1 0 0 ⋯ a c 0 ⋯ a 2 2 a c c 2 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of a function f ( x ) = ∑ k = 1 ∞ f k x k is:

    M [ f ] = ( 1 0 0 ⋯ 0 f 1 f 2 ⋯ 0 0 f 1 2 ⋯ ⋮ ⋮ ⋮ ⋱ )

    The Carleman matrix of a function f ( x ) = ∑ k = 0 ∞ f k x k is:

    M [ f ] = ( 1 0 0 ⋯ f 0 f 1 f 2 ⋯ f 0 2 2 f 0 f 1 f 1 2 + 2 f 0 f 2 ⋯ ⋮ ⋮ ⋮ ⋱ )

    Carleman Approximation

    Consider the following autonomous nonlinear system:

    x ˙ = f ( x ) + ∑ j = 1 m g j ( x ) d j ( t )

    where x ∈ R n denotes the system state vector. Also, f and g i 's are known analytic vector functions, and d j is the j t h element of an unknown disturbance to the system.

    At the desired nominal point, the nonlinear functions in the above system can be approximated by Taylor expansion

    f ( x ) ≃ f ( x 0 ) + ∑ k = 1 η 1 k ! ∂ f [ k ] ∣ x = x 0 ( x − x 0 ) [ k ]

    where ∂ f [ k ] ∣ x = x 0 is the k t h partial derivative of f ( x ) with respect to x at x = x 0 and x [ k ] denotes the k t h Kronecker product.

    Without loss of generality, we assume that x 0 is at the origin.

    Applying Taylor approximation to the system, we obtain

    x ˙ ≃ ∑ k = 0 η A k x [ k ] + ∑ j = 1 m ∑ k = 0 η B j k x [ k ] d j

    where A k = 1 k ! ∂ f [ k ] ∣ x = 0 and B j k = 1 k ! ∂ g j [ k ] ∣ x = 0 .

    Consequently, the following linear system for higher orders of the original states are obtained:

    d ( x [ i ] ) d t ≃ ∑ k = 0 η − i + 1 A i , k x [ k + i − 1 ] + ∑ j = 1 m ∑ k = 0 η − i + 1 B j , i , k x [ k + i − 1 ] d j

    where A i , k = ∑ l = 0 i − 1 I n [ l ] ⊗ A k ⊗ I n [ i − 1 − l ] , and similarly B j , i , κ = ∑ l = 0 i − 1 I n [ l ] ⊗ B j , κ ⊗ I n [ i − 1 − l ] .

    Employing Kronecker product operator, the approximated system is presented in the following form

    x ˙ ⊗ ≃ A x ⊗ + ∑ j = 1 m [ B j x ⊗ d j + B j 0 d j ] + A r

    where x ⊗ = [ x T x [ 2 ] T . . . x [ η ] T ] T , and A , B j , A r and B j , 0 matrices are defined in (Hashemian and Armaou 2015).

    References

    Carleman matrix Wikipedia
    (Text) CC BY-SA