34 views

Uploaded by rim_zakhama

Properties

- linear lec8
- 50gWorking With Matrices
- Sample Mathematicia XII
- Uddin Hybrid 2004
- aqafp4m1q
- 04 CHITRA
- SARAWAKZONASPM2008MATHSTRIALP2
- Chap2
- Lesson Plan
- A General Algorithm for Determining State-space Representations
- Vector field operations
- O'Connor -- Boolean Matrix Inverses
- S2-18-ET ZC413-L7.pptx
- ila5sol_02
- jerri-2-1
- Linealizaciòn
- ap354e00
- c Bo 9780511624117 a 006
- fbb1a1e32fc2e13c6b05c3c5a6ef2f1b52a6
- Non Stationary Markov Chain With Constant Casuative Matrices

You are on page 1of 9

Volume 2013, Article ID 296185, 8 pages

http://dx.doi.org/10.1155/2013/296185

Research Article

On the Kronecker Products and Their Applications

Huamin Zhang1,2 and Feng Ding1

1

Key Laboratory of Advanced Process Control for Light Industry of Ministry of Education, Jiangnan University,

Wuxi 214122, China

2

Department of Mathematics and Physics, Bengbu College, Bengbu 233030, China

Correspondence should be addressed to Feng Ding; fding@jiangnan.edu.cn

Received 10 March 2013; Accepted 6 June 2013

Academic Editor: Song Cen

Copyright 2013 H. Zhang and F. Ding. This is an open access article distributed under the Creative Commons Attribution

License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly

cited.

This paper studies the properties of the Kronecker product related to the mixed matrix products, the vector operator, and the vecpermutation matrix and gives several theorems and their proofs. In addition, we establish the relations between the singular values

of two matrices and their Kronecker product and the relations between the determinant, the trace, the rank, and the polynomial

matrix of the Kronecker products.

1. Introduction

The Kronecker product, named after German mathematician

Leopold Kronecker (December 7, 1823December 29, 1891), is

very important in the areas of linear algebra and signal processing. In fact, the Kronecker product should be called the

Zehfuss product because Johann Georg Zehfuss published a

paper in 1858 which contained the well-known determinant

conclusion |A B| = |A| |B| , for square matrices A and B

with order and [1].

The Kronecker product has wide applications in system

theory [25], matrix calculus [69], matrix equations [10, 11],

system identification [1215], and other special fields [16

19]. Steeba and Wilhelm extended the exponential functions

formulas and the trace formulas of the exponential functions

of the Kronecker products [20]. For estimating the upper and

lower dimensions of the ranges of the two well-known linear

transformations T1 (X) = X AXB and T2 (X) = AX

XB, Chuai and Tian established some rank equalities and

inequalities for the Kronecker products [21]. Corresponding

to two different kinds of matrix partition, Koning, Neudecker,

and Wansbeek developed two generalizations of the Kronecker product and two related generalizations of the vector

operator [22]. The Kronecker product has an important role

in the linear matrix equation theory. The solution of the

Sylvester and the Sylvester-like equations is a hotspot research

area. Recently, the innovational and computationally efficient

principle for the generalized Sylvester matrix equations [23

25] and coupled matrix equations [10, 26] were proposed by

Ding and Chen. On the other hand, the iterative algorithms

for the extended Sylvester-conjugate matrix equations were

discussed in [2729]. Other related work is included in [30

32].

This paper establishes a new result about the singular

value of the Kronecker product and gives a definition of the

vec-permutation matrix. In addition, we prove the mixed

products theorem and the conclusions on the vector operator

in a different method.

This paper is organized as follows. Section 2 gives the definition of the Kronecker product. Section 3 lists some properties based on the the mixed products theorem. Section 4

presents some interesting results about the vector operator

and the vec-permutation matrices. Section 5 discusses the

determinant, trace, and rank properties and the properties of

polynomial matrices.

the Kronecker Product

Let F be a field, such as R or C. For any matrices A =

[ ] F and B F , their Kronecker product

is defined by

11 B 12 B 1 B

[ 21 B 22 B 2 B ]

]

[

A B = [ ..

..

.. ]

[ .

.

. ]

[1 B 2 B B]

A B = [ B]

11 B 12 B 1 B

[ 21 B 22 B 2 B ]

[

]

()()

= [ ..

.

..

.. ] F

[ .

]

.

.

[1 B 2 B B]

and the matrix multiplication, we have

(1)

matrices is a diagonal matrix and the Kronecker product of

two upper (lower) triangular matrices is an upper (lower)

triangular matrix. Let A and A denote the transpose and

the Hermitian transpose of matrix A, respectively. I is

an identity matrix with order . The following basic

properties are obvious.

Basic properties as follows:

(1) I A = diag[A, A, . . . , A],

(2) if = [1 , 2 , . . . , ] and = [1 , 2 , . . . , ] , then,

= = F ,

11 I 12 I 1 I

B 0

[ 21 I 22 I 2 I ] [ 0 B

][

[

=[ .

..

.. ] [ .. ..

[ ..

.

. ][. .

[1 I 2 I I ] [ 0 0

0

0]

]

.. ]

d .]

B]

= (A I ) (I B) ,

11 B 12 B 1 B

[ 21 B 22 B 2 B ]

[

]

A B = [ ..

..

.. ]

[ .

.

. ]

[1 B 2 B B]

B

[0

[

= [ ..

[.

[0

0

B

..

. d

0

11 I 12 I 1 I

0

[ 21 I 22 I 2 I ]

0]

]

][

.. ] [ ..

..

.. ]

]

[

.

.

.

. ]

B] [1 I 2 I I ]

= (I B) (A I ) .

A B = [A B].

(3)

From Theorem 1, we have the following corollary.

(5) (A + B) C = A C + B C,

A B = (A I ) (I B) = (I B) (A I ) .

(6) A (B + C) = A B + A C,

(4)

matrices A and B.

(7) A (B C) = (A B) C = A B C,

(8) (A B) = A B ,

products theorem.

(9) (A B) = A B.

Theorem 3. Let A = [ ] F , C = [ ] F , B F ,

and D F . Then

Property 7 shows that A B C is unambiguous.

(A B) (C D) = (AC) (BD) .

Proof. According to Theorem 1, we have

(A B) (C D)

This section discusses the properties based on the mixed

products theorem [6, 33, 34].

Theorem 1. Let A F and B F ; then

= (A I ) (I B) (C I ) (I D)

= (A I ) [(I B) (C I )] (I D)

= (A I ) (C B) (I D)

A B = (A I ) (I B) = (I B) (A I ) .

(2)

= (A I ) [(C I ) (I B)] (I D)

(5)

According to Corollary 4, we have

= [ (AC) I )] [I (BD)]

= (AC) (BD) .

(6)

= 1, 2, . . . .

(7)

= (U W)

Corollary 4. If the following matrix products exist, then one

has

(1) (A1 B1 )(A2 B2 ) (A B ) = (A1 A2 A )

(B1 B2 B ),

(2) (A1 A2 A )(B1 B2 B ) = (A1 B1 )

(A2 B2 ) (A B ),

(3) [AB][] = A[] B[] .

A square matrix A is said to be a normal matrix if and only

if AA = AA. A square matrix A is said to be a unitary

matrix if and only if AA = AA = I. Straightforward

calculation gives the following conclusions [6, 7, 33, 34].

Theorem 5. For any square matrices A and B,

(1) if A1 and B1 exist, then (A B)1 = A1 B1 ,

(2) if A and B are normal matrices, then A B is a normal

matrix,

(3) if A and B are unitary (orthogonal) matrices, then A

B is a unitary (orthogonal) matrix,

Let [A] := { 1 , 2 , . . . , } denote the eigenvalues of A

and let [A] := {1 , 2 , . . . , } denote the nonzero singular

values of A. According to the definition of the eigenvalue and

Theorem 3, we have the following conclusions [34].

Theorem 6. Let A F and B F ; and are positive

integers. Then [A B ] = { | = 1, 2, . . . , , =

[B] = {1 , 2 , . . . , }.

Theorem 3, for any matrices A and B, we have the next

theorem.

Theorem 7. Let A F and B F . If rank[A] = ,

[A] = {1 , 2 , . . . , }, rank[B] = , and [B] =

{1 , 2 , . . . , }, then [A B] = { | = 1, 2, . . . , , =

1, 2, . . . , } = [B A].

Proof. According to the singular value decomposition theorem, there exist the unitary matrices U, V and W, Q which

satisfy

A = U[

0

] V,

0 0

B=[

0

] Q,

0 0

0

0

] V} {W [

] Q}

0 0

0 0

= (U W) {[

A[+1] := A[] A = A A[] ,

A B = {U [

(8)

0

0

][

]} (V Q)

0 0

0 0

(9)

0

] 0]

0 0

(V Q)

0

0]

[ [

[

= (U W) [

0

] (V Q) .

0 0

diag[1 1 , 1 2 , . . . , 1 , . . . , ], this proves the theorem.

According to Theorem 7, we have the next corollary.

Corollary 8. For any matrices A, B, and C, one has [A B

C] = [C B A].

the Vec-Permutation Matrix

In this section, we introduce a vector-valued operator and a

vec-permutation matrix.

Let A = [a1 , a2 , . . . , a ] F , where a F , =

1, 2, . . . , ; then the vector col[A] is defined by

a1

[ a2 ]

[ ]

col [A] := [ .. ] F .

[.]

[ a ]

(10)

(1) (I A)col[B] = col[AB],

(2) (A I )col[C] = col[CAT ].

Proof. Let (B) denote the th column of matrix B; we have

A

[0

[

(I A) col [B] = [ ..

[.

[0

0

A

..

. d

0

(B)1

0

[ (B)2 ]

0]

]

][

.. ] [ .. ]

]

[

. ]

.

A] [(B) ]

A(B)1

(AB)1

[ A(B)2 ] [ (AB)2 ]

] [

]

[

= [ .. ] = [ .. ] = col [AB] .

[ . ] [ . ]

[A(B) ]

[(AB) ]

(11)

Similarly, we have

equivalent; that is,

(A I ) col [C]

11 I 12 I 1 I

(C)1

[ 21 I 22 I 2 I ] [(C)2 ]

][

]

[

=[ .

..

.. ] [ .. ]

]

[ ..

[

. ]

.

.

[1 I 2 I I ] [(C) ]

[

[

=[

[

21 (C)1 + 22 (C)2 + + 2 (C)

..

.

=1 =1

]

]

]

]

(e e ) (e e )

=1 =1

C(A )1

(CA )1

[ C(A ) ] [ (CA ) ]

[

[

2]

2]

]=[

] = col [CA ] .

=[

..

..

] [

]

[

] [

]

[

.

.

C(A

(CA

)

)

[

[

]

]

=1 =1

(12)

(13)

=1 =1

=1 =1

=1 =1

= (C I ) col [AB]

(19)

= [e (e e ) e ]

=1

=1

[

]

= (C I ) (I A) col [B]

= [(C I ) (I A)] col [B]

= [e I e ]

= (C A) col [B] .

=1

(14)

Theorem 10 plays an important role in solving the matrix

equations [25, 3537], system identification [3854], and

control theory [5558].

Let e denote an -dimensional column vector which has

1 in the th position and 0s elsewhere; that is,

e := [0, 0, . . . , 0, 1, 0, . . . , 0] .

e1

]

e2 ]

]

I

[

[I

:= [

,

]R

[ ..

]

[ .

[I e ]

I e1

]

[

]

[

[I e2 ]

=[

]

]

[ ..

]

[ .

[I e ]

= P .

(15)

have the following conclusions.

(16)

(1) P = P ,

(2) P P = P P = I .

(e e ) (e e ) .

=1 =1

= (e e ) (e e )

= [e (e e ) e ]

= (e e ) (e e )

= (e e ) (e e )

(18)

the Kronecker product, we have

(e e ) (e e ) = P .

(17)

5

I e1

basic properties of the Kronecker product, we have

I e1

P P

]

[

]

[

[I e2 ]

=[

]

]

[ ..

]

[ .

[I e ]

= I [e e ]

=1

= I I

= [I e1 , I e2 , . . . , I e ]

= I .

e1 e1 e1 e2 e1 e

(22)

]

[

]

[

[ e2 e1 e2 e2 e2 e ]

=[

]

]

[

..

..

..

]

[

.

.

.

[e e1 e e2 e e ]

Theorem 12. If A F and B F , then one has P (A

B)P = B A.

e1 e1 e2 e1 e e1

]

[

]

[

[ e1 e2 e2 e2 e e2 ]

=[

]

]

[

..

..

..

]

[

.

.

.

e

e

e

e

[ 1

2

B1

B2

..

[ B ]

1, 2, . . . , , and = 1, 2, . . . , . According to the definition of

P and the Kronecker product, we have

I e1

P (A B) P

]

[

]

[

[ I e2 ]

=[

]

]

[

..

]

[

.

[I e ]

= P ,

(20)

I e1

[

]

[

]

[ I e ]

=[

1

2

[

]

..

[

]

.

[

]

[I e ]

(A)1 B1 (A)2 B1 (A) B1

[ (A)1 B2 (A)2 B2 (A) B2 ]

]

[

=[

] P

..

..

..

]

[

.

.

.

P P

I e1

]

[

]

[

[I e2 ]

=[

] [I e1 , I e2 , . . . , I e ]

]

[ ..

]

[ .

e

I

[

]

I (e1 e1 ) I (e1 e2 ) I (e1 e )

[

]

[

]

[I (e e ) I (e e ) I (e e )]

2 1

2 2

2 ]

=[

[

]

..

..

..

[

]

.

.

.

[

]

(e

e

)

I

(e

e

)

(e

e

)

1

2

]

[

I 0

[ 0 I

[

= [ .. ..

[. . d

[ 0 0

[

]

[

]

[I e2 ]

= [I e1 , I e2 , . . . , I e ] [

]

[ ..

]

[ .

]

[I e ]

0

0]

]

.. ]

.]

A B1

[ A B2 ]

]

[

= [ . ] [I e1 , I e2 , . . . , I e ]

[ .. ]

[A B ]

A11 A12 A1

[ A21 A22 A2 ]

]

[

=[ .

..

.. ]

[ ..

.

. ]

[A1 A2 A ]

= B A.

(23)

I ]

= I ,

(21)

B A = P (A B) P = P [(A B) P2 ] P . (24)

That is, [B A] = [(A B)P2 ]. When A F and

B F , one has B A = P (A B)P . That is, if A and B

are square matrices, then A B is similar to B A.

Matrix of the Kronecker Product

In this section, we discuss the properties [6, 7, 34] of the

determinant, the trace, the rank, and the polynomial matrix

of the Kronecker product.

For A F and B F , we have |AB| = |A| |B| =

|B A|. If A and B are two square matrices, then we have

tr[A B] = tr[A] tr[B] = tr[B A]. For any matrices A and

B, we have rank[A B] = rank[A] rank[B] = rank[B A].

According to these scalar properties, we have the following

theorems.

Theorem 15. (1) Let A, C F

and B, D F

(25)

and :

(, ) = ,

,=1

(A, B) by the formula

(A, B) = A B .

(34)

{ 1 , 2 , . . . , } and [B] = {1 , 2 , . . . , }, then the matrix

(A, B) has the eigenvalues

= 1, 2, . . . , , = 1, 2, . . . , .

(35)

(I A) = I (A),

(A I ) = (A) I .

(27)

sum [7, 34]. The Kronecker sum of A F and B F ,

denoted as A B, is defined by

A B = A I + I B.

Theorem 19. Let A F , and B F . Then

exp[A B] = exp[A] exp[B],

(28)

cos(A B) = cos(A) cos(B) sin(A) sin(B).

6. Conclusions

(29)

rank [ (A, B)] = (rank [A] , rank [B]) .

(33)

function and (A) exists, then

. Then

, , F,

(26)

A[] B[] , where , are positive integers, one has the following

conclusions.

1

|B| .

(A, B) = |A|

(32)

,=1

rank [(A B) (C D)] = rank [(AC) (BD)]

= 1, 2, . . . , .

=1

= tr [CA] tr [DB] .

and B F

( ) = ,

( , ) = ,

(1) Let A F

are

[34].

= |AC| |BD| .

= tr [AC] tr [BD]

(31)

=1

. Then

(A) = A

,=1

If [A] = { 1 , 2 , . . . , } and () = =1 is a

polynomial, then the eigenvalues of

(30)

products and the vec-permutation matrix. A new presentation about the properties of the mixed products and the

vector operator is given. All these obtained conclusions make

the theory of the Kronecker product more complete.

Acknowledgments

This work was supported by the National Natural Science

Foundation of China (no. 61273194), the 111 Project (B12018),

and the PAPD of Jiangsu Higher Education Institutions.

References

[1] H. V. Jemderson, F. Pukelsheim, and S. R. Searle, On the history

of the Kronecker product, Linear and Multilinear Algebra, vol.

14, no. 2, pp. 113120, 1983.

[2] X. L. Xiong, W. Fan, and R. Ding, Least-squares parameter

estimation algorithm for a class of input nonlinear systems,

Journal of Applied Mathematics, vol. 2007, Article ID 684074,

14 pages, 2007.

[3] F. Ding, Transformations between some special matrices,

Computers & Mathematics with Applications, vol. 59, no. 8, pp.

26762695, 2010.

[4] Y. Shi and B. Yu, Output feedback stabilization of networked

control systems with random delays modeled by Markov

chains, IEEE Transactions on Automatic Control, vol. 54, no. 7,

pp. 16681674, 2009.

[5] Y. Shi, H. Fang, and M. Yan, Kalman filter-based adaptive

control for networked systems with unknown parameters and

randomly missing outputs, International Journal of Robust and

Nonlinear Control, vol. 19, no. 18, pp. 19761992, 2009.

[6] A. Graham, Kronecker Products and Matrix Calculus: With

Applications, John Wiley & Sons, New York, NY, USA, 1982.

[7] W.-H. Steeb and Y. Hardy, Matrix Calculus and Kronecker

Product: A Practical Approach to Linear and Multilinear Algebra,

World Scientific, River Edge, NJ, USA, 2011.

[8] P. M. Bentler and S. Y. Lee, Matrix derivatives with chain

rule and rules for simple, Hadamard, and Kronecker products,

Journal of Mathematical Psychology, vol. 17, no. 3, pp. 255262,

1978.

[9] J. R. Magnus and H. Neudecker, Matrix differential calculus

with applications to simple, Hadamard, and Kronecker products, Journal of Mathematical Psychology, vol. 29, no. 4, pp. 474

492, 1985.

[10] F. Ding and T. Chen, Iterative least-squares solutions of

coupled Sylvester matrix equations, Systems & Control Letters,

vol. 54, no. 2, pp. 95107, 2005.

[11] F. Ding and T. Chen, On iterative solutions of general coupled

matrix equations, SIAM Journal on Control and Optimization,

vol. 44, no. 6, pp. 22692284, 2006.

[12] L. Jodar and H. Abou-Kandil, Kronecker products and coupled

matrix Riccati differential systems, Linear Algebra and its

Applications, vol. 121, no. 2-3, pp. 3951, 1989.

[13] D. Bahuguna, A. Ujlayan, and D. N. Pandey, Advanced type

coupled matrix Riccati differential equation systems with Kronecker product, Applied Mathematics and Computation, vol.

194, no. 1, pp. 4653, 2007.

[14] M. Dehghan and M. Hajarian, An iterative algorithm for

solving a pair of matrix equations = , =

over generalized centro-symmetric matrices, Computers &

Mathematics with Applications, vol. 56, no. 12, pp. 32463260,

2008.

[15] M. Dehghan and M. Hajarian, An iterative algorithm for the

reflexive solutions of the generalized coupled Sylvester matrix

equations and its optimal approximation, Applied Mathematics

and Computation, vol. 202, no. 2, pp. 571588, 2008.

7

[16] C. F. van Loan, The ubiquitous Kronecker product, Journal of

Computational and Applied Mathematics, vol. 123, no. 1-2, pp.

85100, 2000.

[17] M. Huhtanen, Real linear Kronecker product operations,

Linear Algebra and its Applications, vol. 418, no. 1, pp. 347361,

2006.

[18] S. Delvaux and M. van Barel, Rank-deficient submatrices of

Kronecker products of Fourier matrices, Linear Algebra and its

Applications, vol. 426, no. 2-3, pp. 349367, 2007.

[19] S. G. Deo, K. N. Murty, and J. Turner, Qualitative properties of

adjoint Kronecker product boundary value problems, Applied

Mathematics and Computation, vol. 133, no. 2-3, pp. 287295,

2002.

[20] W.-H. Steeb and F. Wilhelm, Exponential functions of Kronecker products and trace calculation, Linear and Multilinear

Algebra, vol. 9, no. 4, pp. 345346, 1981.

[21] J. Chuai and Y. Tian, Rank equalities and inequalities for

Kronecker products of matrices with applications, Applied

Mathematics and Computation, vol. 150, no. 1, pp. 129137, 2004.

[22] R. H. Koning, H. Neudecker, and T. Wansbeek, Block Kronecker products and the vecb operator, Linear Algebra and its

Applications, vol. 149, pp. 165184, 1991.

[23] F. Ding, P. X. Liu, and J. Ding, Iterative solutions of the

generalized Sylvester matrix equations by using the hierarchical

identification principle, Applied Mathematics and Computation, vol. 197, no. 1, pp. 4150, 2008.

[24] L. Xie, Y. Liu, and H. Yang, Gradient based and least squares

based iterative algorithms for matrix equations + T =

, Applied Mathematics and Computation, vol. 217, no. 5, pp.

21912199, 2010.

[25] F. Ding and T. Chen, Gradient based iterative algorithms

for solving a class of matrix equations, IEEE Transactions on

Automatic Control, vol. 50, no. 8, pp. 12161221, 2005.

[26] J. Ding, Y. Liu, and F. Ding, Iterative solutions to matrix

equations of the form = , Computers & Mathematics

with Applications, vol. 59, no. 11, pp. 35003507, 2010.

[27] A.-G. Wu, L. Lv, and G.-R. Duan, Iterative algorithms for

solving a class of complex conjugate and transpose matrix

equations, Applied Mathematics and Computation, vol. 217, no.

21, pp. 83438353, 2011.

[28] A.-G. Wu, X. Zeng, G.-R. Duan, and W.-J. Wu, Iterative solutions to the extended Sylvester-conjugate matrix equations,

Applied Mathematics and Computation, vol. 217, no. 1, pp. 130

142, 2010.

[29] F. Zhang, Y. Li, W. Guo, and J. Zhao, Least squares solutions

with special structure to the linear matrix equation =

, Applied Mathematics and Computation, vol. 217, no. 24, pp.

1004910057, 2011.

[30] M. Dehghan and M. Hajarian, SSHI methods for solving general linear matrix equations, Engineering Computations, vol. 28,

no. 8, pp. 10281043, 2011.

[31] E. Erkmen and M. A. Bradford, Coupling of finite element

and meshfree methods be for locking-free analysis of sheardeformable beams and plates, Engineering Computations, vol.

28, no. 8, pp. 10031027, 2011.

[32] A. Kaveh and B. Alinejad, Eigensolution of Laplacian matrices

for graph partitioning and domain decomposition approximate

algebraic method, Engineering Computations, vol. 26, no. 7, pp.

828842, 2009.

[33] X. Z. Zhan, The Theory of Matrces, Higher Education Press, Beijing, China, 2008 (Chinese).

8

[34] P. Lancaster and M. Tismenetsky, The Theory of Matrices: with

Applications, Academic Press, New York, NY, USA, 1985.

[35] M. Dehghan and M. Hajarian, An iterative method for solving

the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices, Applied Mathematical Modelling,

vol. 34, no. 3, pp. 639654, 2010.

[36] M. Dehghan and M. Hajarian, An efficient algorithm for solving general coupled matrix equations and its application,

Mathematical and Computer Modelling, vol. 51, no. 9-10, pp.

11181134, 2010.

[37] N. J. Higham, Accuracy and Stability of Numerical Algorithms,

Society for Industrial and Applied Mathematics, Philadelphia,

Pa, USA, 1996.

[38] F. Ding, Decomposition based fast least squares algorithm for

output error systems, Signal Processing, vol. 93, no. 5, pp. 1235

1242, 2013.

[39] F. Ding, Coupled-least-squares identification for multivariable

systems, IET Control Theory and Applications, vol. 7, no. 1, pp.

6879, 2013.

[40] F. Ding, X. G. Liu, and J. Chu, Gradient-based and leastsquares-based iterative algorithms for Hammerstein systems

using the hierarchical identification principle, IET Control

Theory and Applications, vol. 7, pp. 176184, 2013.

[41] F. Ding, Hierarchical multi-innovation stochastic gradient

algorithm for Hammerstein nonlinear system modeling,

Applied Mathematical Modelling, vol. 37, no. 4, pp. 16941704,

2013.

[42] F. Ding, Two-stage least squares based iterative estimation algorithm for CARARMA system modeling, Applied

Mathemat- Ical Modelling, vol. 37, no. 7, pp. 47984808, 2013.

[43] Y. J. Liu, Y. S. Xiao, and X. L. Zhao, Multi-innovation stochastic

gradient algorithm for multiple-input single-output systems

using the auxiliary model, Applied Mathematics and Computation, vol. 215, no. 4, pp. 14771483, 2009.

[44] Y. J. Liu, J. Sheng, and R. F. Ding, Convergence of stochastic

gradient estimation algorithm for multivariable ARX-like systems, Computers & Mathematics with Applications, vol. 59, no.

8, pp. 26152627, 2010.

[45] J. H. Li, Parameter estimation for Hammerstein CARARMA

systems based on the Newton iteration, Applied Mathematics

Letters, vol. 26, no. 1, pp. 9196, 2013.

[46] J. H. Li, R. F. Ding, and Y. Yang, Iterative parameter identification methods for nonlinear functions, Applied Mathematical

Modelling, vol. 36, no. 6, pp. 27392750, 2012.

[47] J. Ding, F. Ding, X. P. Liu, and G. Liu, Hierarchical least squares

identification for linear SISO systems with dual-rate sampleddata, IEEE Transactions on Automatic Control, vol. 56, no. 11,

pp. 26772683, 2011.

[48] J. Ding and F. Ding, Bias compensation-based parameter estimation for output error moving average systems, International

Journal of Adaptive Control and Signal Processing, vol. 25, no. 12,

pp. 11001111, 2011.

[49] J. Ding, L. L. Han, and X. M. Chen, Time series AR modeling

with missing observations based on the polynomial transformation, Mathematical and Computer Modelling, vol. 51, no. 5-6, pp.

527536, 2010.

[50] F. Ding, Y. J. Liu, and B. Bao, Gradient-based and least-squaresbased iterative estimation algorithms for multi-input multioutput systems, Proceedings of the Institution of Mechanical

Engineers I, vol. 226, no. 1, pp. 4355, 2012.

[51] F. Ding and Y. Gu, Performance analysis of the auxiliary modelbased least-squares identification algorithm for one-step statedelay systems, International Journal of Computer Mathematics,

vol. 89, no. 15, pp. 20192028, 2012.

[52] F. Ding and Y. Gu, Performance analysis of the auxiliary modelbased stochastic gradient parameter estimation algorithm for

state space systems with one-step state delay, Circuits, Systems

and Signal Processing, vol. 32, no. 2, pp. 585599, 2013.

[53] F. Ding and H. H. Duan, Two-stage parameter estimation algorithms for Box-Jenkins systems, IET Signal Processing, 2013.

[54] P. P. Hu and F. Ding, Multistage least squares based iterative

estimation for feedback nonlinear systems with moving average

noises using the hierarchical identification principle, Nonlinear

Dynamics, 2013.

[55] H. G. Zhang and X. P. Xie, Relaxed stability conditions for

continuous-time TS fuzzy-control systems via augmented

multi-indexed matrix approach, IEEE Transactions on Fuzzy

Systems, vol. 19, no. 3, pp. 478492, 2011.

[56] H. G. Zhang, D. W. Gong, B. Chen, and Z. W. Liu, Synchronization for coupled neural networks with interval delay:

a novel augmented Lyapunov-Krasovskii functional method,

IEEE Transactions on Neural Networks and Learning Systems,

vol. 24, no. 1, pp. 5870, 2013.

[57] H. W. Yu and Y. F. Zheng, Dynamic behavior of multi-agent

systems with distributed sampled control, Acta Automatica

Sinica, vol. 38, no. 3, pp. 357363, 2012.

[58] Q. Z. Huang, Consensus analysis of multi-agent discrete-time

systems, Acta Automatica Sinica, vol. 38, no. 7, pp. 11271133,

2012.

Advances in

Operations Research

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

Advances in

Decision Sciences

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

Mathematical Problems

in Engineering

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

Journal of

Algebra

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

The Scientific

World Journal

Hindawi Publishing Corporation

http://www.hindawi.com

http://www.hindawi.com

Volume 2014

International Journal of

Differential Equations

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

Volume 2014

http://www.hindawi.com

International Journal of

Advances in

Combinatorics

Hindawi Publishing Corporation

http://www.hindawi.com

Mathematical Physics

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

Journal of

Complex Analysis

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

International

Journal of

Mathematics and

Mathematical

Sciences

Journal of

http://www.hindawi.com

Stochastic Analysis

Abstract and

Applied Analysis

http://www.hindawi.com

http://www.hindawi.com

International Journal of

Mathematics

Volume 2014

Volume 2014

Discrete Dynamics in

Nature and Society

Volume 2014

Volume 2014

Journal of

Journal of

Discrete Mathematics

Journal of

Volume 2014

http://www.hindawi.com

Applied Mathematics

Journal of

Function Spaces

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

http://www.hindawi.com

Volume 2014

http://www.hindawi.com

Volume 2014

Optimization

Hindawi Publishing Corporation

http://www.hindawi.com

Volume 2014

http://www.hindawi.com

Volume 2014

- linear lec8Uploaded byapi-318836863
- 50gWorking With MatricesUploaded byCarlos CR
- Sample Mathematicia XIIUploaded byMd Rizwan Ahmad
- Uddin Hybrid 2004Uploaded byJayakumar Thangavel
- aqafp4m1qUploaded byPham Viet Anh
- 04 CHITRAUploaded byrajesaravind
- SARAWAKZONASPM2008MATHSTRIALP2Uploaded bySean Gomez
- Chap2Uploaded byIlman Faiq
- Lesson PlanUploaded byfaridatul syila
- A General Algorithm for Determining State-space RepresentationsUploaded bythgnguyen
- Vector field operationsUploaded byPeddiraju Bhargava
- O'Connor -- Boolean Matrix InversesUploaded byDerek O'Connor
- S2-18-ET ZC413-L7.pptxUploaded byAasheesh Chander Agrawal
- ila5sol_02Uploaded byTochukwupa Preize
- jerri-2-1Uploaded byChristopher Slotterback
- LinealizaciònUploaded byfernando tipan
- ap354e00Uploaded byAduda Ruiz Benah
- c Bo 9780511624117 a 006Uploaded bystefan
- fbb1a1e32fc2e13c6b05c3c5a6ef2f1b52a6Uploaded byfcord
- Non Stationary Markov Chain With Constant Casuative MatricesUploaded bySungsoo Kim
- 008_ALDEEN_AUPEC01paperUploaded byRudanek
- 03-05-2018-2170901-ICPSUploaded byHImanshu Joshi
- Improve your Examination Temperament.txtUploaded byShubham Jain
- A STUDY ON THE PROBLEMS FACED BY RURAL TAMIL MEDIUM STUDENTS IN PROFESSIONAL ENGINEERING COLLEGE USING CETD MATRIXUploaded byIntegrated Intelligent Research
- 303433.pdfUploaded byYoussry Elsayed Mohamed
- Dev Ahl DavisUploaded byMukesh Bohra
- users7&Uploaded bypavika
- Math for EcoUploaded byBabarKalam
- If the Marks Obtained by a Student in Five Different Subjects Are Input Through the KeyboardUploaded byimtishal_ali3263
- IJET-V4I3P93.pdfUploaded byInternational Journal of Engineering and Techniques

- Mannual McUploaded byUtkarsh Verma
- FriggUploaded byMike Blackmore
- Models.heat.Cold Water GlassUploaded byShawonChowdhury
- Exposed Linear EncoderUploaded byJeran Cloete
- Office Clerk - Job DescriptionUploaded bybidroyd
- Data Structure Note by Bhupendra SaudUploaded byNa V IN
- Timeline of Mathematics and Theoritical PhysicsUploaded bynewtonfogg123
- MHA+Specifications+Template_v2Uploaded byAnonymous 4AsL7cc
- 20121 Calc DeI Gilda.ftorresg.tarea1P1Uploaded byFlor Conejo
- A New Bottleneck Detecting Approach to Productivity Improvement of Knowleadgeable Manufacturing SystemUploaded byIrina Adriana Vieriu
- ex3.pdfUploaded byHakan Kaya
- PROCESS OPTIMIZATION IN DRY TURNING OF STEEL, CAST IRON AND BAKELITE USING LOW COST TOOL MATERIALUploaded byIAEME Publication
- Splines AlternateUploaded byharris
- 2 OHM'S LAWUploaded byOnkar Rai
- Internal Control- Preliminary AnalysisUploaded byYanna Bacosa
- Computer Knowledge for IPBS ExamsUploaded byBhaskar Kothari
- Non Verbal Reasoning Complete Reference Guide - Guide4BankExamsUploaded byShiv Ram Krishna
- Particle Size Analyzer-Analysette22MicroTecXTUploaded byXue Han
- Java Programming BeginnersUploaded byMisty Lambert
- Complete Design Report of Bridge Using CSiBridgeUploaded byKS Lee
- MTech CSIT SyllabusUploaded byashut911
- Boys Will Be Boys_ Gender, Overconfidence, And Common Stock InvestmentUploaded byalexander_koo_3
- TWI Ultrasonic Inspection Coursework 4Uploaded byHassanSoboh
- Galaxy 1954 02 TextUploaded bymoenobody
- Ma Mcom FinalUploaded byPoonam Kaur
- LCR Hi Tester 3522-50Uploaded byDany Rassam
- Analyzing and Visualizing Data With Excel 2016Uploaded bytahsin çetinkaya
- Valuing IPOsUploaded bySajjad Ahmad
- Kumar, K. (Mandaya, India) 521Uploaded byPierluigi Romano
- 5the Awesome OscillatorUploaded bysmarttrader1