Recursive computational algorithms for a set of block pulse operational matrices

A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of time-varying linear systems via block pulse functions, can be calculated efficiently by the new recursive computational algorithms which are proposed...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science Vol. 23; no. 11; pp. 1921 - 1935
Main Authors: JIANG, Z. H., SCHAUFELBERGER, W.
Format: Journal Article
Language:English
Published: London Taylor & Francis Group 01.11.1992
Taylor & Francis
Subjects:
Applied sciences
Computer science; control theory; systems
Control theory. Systems
Exact sciences and technology
Modelling and identification
Block pulse function
Linear system
Time- varying system
Matrix method
System identification
Recursive algorithm
Computing complexity
ISSN:0020-7721, 1464-5319
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of time-varying linear systems via block pulse functions, can be calculated efficiently by the new recursive computational algorithms which are proposed in this paper. As the basis of these algorithms, the constant difference properties of entries of the set of operational matrices are proved. And as the advantage of these algorithms, the reduction of their computational size is discussed. The proposed algorithms are especially useful when the number of block pulses is large in realistic applications of the block pulse function method.
ISSN:0020-7721
1464-5319
DOI:10.1080/00207729208949430