Operational Matrix in Block-Pulse Series
Operational Matrix in Block-Pulse Series
To cite this article: WEN-LIANG CHEN & CHING-YEI CHUNG (1987) New integral operational matrix in block-pulse series
analysis, International Journal of Systems Science, 18:3, 403-408, DOI: 10.1080/00207728708963975
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the
publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations
or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any
opinions and views expressed in this publication are the opinions and views of the authors, and are not the
views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be
independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses,
actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever
caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
This article may be used for research, teaching, and private study purposes. Any substantial or systematic
reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any
form to anyone is expressly forbidden. Terms & Conditions of access and use can be found at http://
www.tandfonline.com/page/terms-and-conditions
INT. J. SYSTEMS SCI., 1987, VOL. 18, No.3, 403-408
The error of the block-pulse series expansion of an integral function employing the
usual integral operational matrix is evaluated and a new integral operational matrix
is obtained from the three-point interpolating polynomial in Lagrange form. It is
shown that this new matrix reduces the error.
Downloaded by [McGill University Library] at 12:06 06 February 2015
1. Introduction
In the block-pulse series analysis of linear systems derived by Sannuti (1977). Rao
and Srinivasan (1978) and Chen and Jeng (1981). one important property used
repeatedly is the evaluation of block-pulse series coefficients of an integral operational
matrix. However, using this matrix, the values of the coefficients will deviate from their
exact values and will introduce error in the block-pulse series analysis of linear
systems.
In this paper. the error due to the use of the usual integral operational matrix is
calculated and a new integral operational matrix obtained from the three-point
interpolating polynomial in Lagrange form is presented. This reduces the error of
block-pulse series coefficient of an integral function and also reduces the error of the
block-pulse series solution in the analysis of linear systems. Two numerical examples
are given at the last section to compare the results obtained from the usual integral
operational matrix and the new operational matrix.
where
m Iii/mIT
I. = - f(t) dt, i = 1, 2, .... m (2)
T Hi-1 l/m)T
Define
l
F(t) = If(t')dt (3)
T 0
P=-
t (5)
m
0 0 0 1.
2
Downloaded by [McGill University Library] at 12:06 06 February 2015
I TTl T
F(l) ~ [ 2;-11 ;;/1 + 2;;/2
~[Fl F2 ••• Fm]l/J(m)(t) (6)
where
(7)
Equation (8) means that r, is the average area of F(t) in the time interval
2
with area obtained by the trapezoidal rule. Now, let the direct block-pulse series
T
e: I T, ~ T]
expansion of F(t) be
(9)
where
- m l(i/mlT
F, = T F(t) dt, i = I, 2, ,m (10)
(i-l/mlT
Equation (10) means that the coefficient F j is the average area of F(t) in the time
i -1 i ]
interval [ ---;;;- T,;;; T .
In the block-pulse series analysis, the coefficients Fi , i = 1,2, ... , m, in (8) are used
r,
to represent the exact coefficients in (10). It is thus easy to see that the error is due to
the calculation of area inaccurately. Hence, in the following section, a new integral
operational matrix is derived and through using this matrix, the error is reduced.
A new matrix in block-pulse series analysis 405
-( ) = F(i - 2
Ft m
r) {t - «i- l)/m)T}(t - (i/m)T)
2(T/m)2
[i- ~ T),
Downloaded by [McGill University Library] at 12:06 06 February 2015
If F(t) is approximated by (11), that is, by F(t) over the time interval 1 T,
m m
then
.: I(i/m)T
F(t)dt ~ F(t)dt
(i-l/m)T (i-limIT
=!.[_~F(i-2T)
m 12 m
+ ~F(~T)
12 m
+ 2.F(~T)J
12 m
(12)
Fi~-/2FC:2T)+ 12 F
8
C: 1T
) + :2F(~T)£Fi (13)
i-
F( - T =
2) J
O 2/
- m )T T[m i(l/m)T
/(t)dt = - -T f(t)dt +-
m i(2 /m l T
/(t)dt + '0'
mom 0 T (1/m)T
+-
m i(i- 2/mlT
f(t)dt
]
(14)
T (i-3/m)T
Fe:
2
T) = ~(l1 + /2 + ... + ];-2) (15)
Similarly
i- l ) T
F ( ----;;-T = ;(11 + /2 + '" + ];-d (16)
and
F -T T
i ) = -(11 + /2 + ... +];) (17)
(m m .
(18)
406 W-L. Chen and c.- Y. Chung
_ IT _
F I ~--fl =F I (2] )
2m
Substituting (18), (19) and (21) into (9), we get
F(t) = [PI F2 ••• PmJljI(m)(t)
1 13
2 12
5 13
0 - -
12 12
T
~[fl f2 ... fmJ- 5 13
m 0 0 - -]2
12
5
o 0 0 0
12
(22)
Comparing (4) with (22), P is a new integral operational matrix and is modified
slightly from P.
4. Error analysis
In this section the error of the block-pulse series coefficients of F(t) calculated from
P and j5 are estimated. From (8) and (10), the error between the exact block-pulse
series coefficient Pj and the coefficient F, obtained from P is
(24)
A new matrix in block-pulse series analysis 407
Next, from Atkinson (1978), the error of F(t) and F(t) in (II) is
Dividing (27) by Tim and using (10) and (12) or (13), we have
_ _
F, - F, = - 24 ;
1 (T)3 r'(~) (28)
Equations (25) and (28) are, respectively, the errors between the exact block-pulse
series coefficient F i and the coefficient F, obtained from the integral operational
matrix P and the coefficient Fi obtained from the new integral operational matrix P. If
the function F(t) is smooth enough, then for large m, the error r, - Fi is less than
Pi - F;, that is, the use of the new integral operational matrix P is better than the use
of the usual operational matrix P_
Example 1
Let f(t) = exp 2t. Then
F(t) =
'I
0
f(t')dt =
1
-(exp (2t) - I)
2 .
The eight-term block-pulse series expansion of f(t) and F(t) on t E [0, I) are
f(t) = [1-1361 1·4589 1·8732 2·4051 3·0882 3·9656 5·0916 6'5378Jt/t(Sl(t)
(29)
and
F(t) = [0-0681 0·2294 0'4364 0-7024 1·0439 1·4836 2-0460 2'7685Jt/t(s)(t)
(30)
The block-pulse series expansion of F(t) obtained by the integral operational matrix P,
that is, by (4) is
F(t) ~ [0-0710 0·2332 0·4415 0-7089 1·0522 1·4931 2·0592 2'7860Jt/t(s)(t)
(31)
and the block-pulse series expansion of F(t) obtained by the new integral operational
matrix P, that is, by (22) is
F(t) ~ [0,0710 0·2298 0-4372 0·7034 1·0451 1·4839 2·0474 2'7709]t/t(s)(t)
(32)
408 A new matrix in block-pulse series analysis
Comparing (30), (31) and (32), shows that using the new integral operational matrix P
gives better results than using P.
Example 2
Consider the simple differential equation
f(t) - f(t) = 0, f(O) = 1 (33)
The solution is f(t) = exp t. The to-term block-pulse series of f(t) can be calculated as
f(t)= [1'0517 }'1623 1·2846 1·4197 1·5690 1·7340 /·9163
2'1179 2·3406 2'5868]"'(lo)(t) (34)
By block-pulse series analysis, it is well known that (33) can be changed into algebraic
Downloaded by [McGill University Library] at 12:06 06 February 2015
form as
(35)
where F, is the ith coefficient of the block-pulse series solution of f(t) and P is the
integral operational matrix. If P in (5) is used, the block-pulse series solution is
f(t) ~ []'0526 1·]634 ],2859 ]·4213 1'5709 1·7362 ]·9190
2·1210 2·3442 2'59IOJ"'(l0)(t) (36)
If the new integral operational matrix Pin (22) is used, the block-pulse series solution
is
f(t)~[I'0526 1·1625 1·2847 1·4198 1·5692 1·7342 1·9166
2·1182 2·3410 2'5890J"'(lo)(t) (37)
Comparing (34), (36) and (37), we can conclude that using the new integral operational
matrix gives a better block-pulse series solution.
5. Conclusions
In this paper, the geometric meaning of using the integral operational matrix to
calculate the block-pulse series coefficients of an integral function is obtained and it is
found that the error of the coefficients due to the use of the integral operational matrix
depends on the accuracy of the area to be calculated. Therefore any numerical method
which can evaluate the area accurately may be introduced to find a new integral
operational matrix and obtain a better result in the block-pulse series analysis. In this
paper, the three-point interpolating polynomial in Lagrange form is used.
REFERENCES
ATKINSON, K. E., 1978, An Introduction to Numerical Analysis (New York: Wiley).
CHEN, W. L., and JENG, B. S., 1981, Int. J. Systems Sci., 12,625.
RAO, G. P., and SRINIVASAN, T., 1978, Proc. lnstn elect. Engrs, 125, 1064.
SANNUTI, P., J 977, Proc. lnstn elect. Engrs, 124, 569.