Square-root ellipsoidal state bounding and its parallel computation

Chai, W. and Sun, Xianfang ORCID: https://orcid.org/0000-0002-6114-0766 2008. Square-root ellipsoidal state bounding and its parallel computation. Systems Engineering and Electronics 30 (7) , pp. 1339-1342.

Full text not available from this repository.

Abstract

A square-root ellipsoidal state bounding algorithm for parallel computation using systolic arrays is proposed.For high numerically stability,the Cholesky decomposition is used in the propagation of the shape-defining matrix of the ellipsoid.Since the square-root algorithm is in the form of matrix-matrix and matrix-vector operations,it is suitable for parallel computers.For parallel computation,systolic arrays for the algorithm are developed.Computational complexity analysis reveals that if the system has a state dimension of n,the serial computation is of at least O(n3) complexity per data sample,while the parallel computation is of O(n) complexity.Simulation results show the effectiveness of the proposed approaches.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Language other than English:	Chinese
Publisher:	Tsinghua Tongfang Knowledge Network Technology
ISSN:	1001-506X
Last Modified:	19 Oct 2022 09:55
URI:	https://orca.cardiff.ac.uk/id/eprint/22667

Citation Data

Actions (repository staff only)

Edit Item