Show simple item record

dc.contributor.authorLiu, Wanquan
dc.contributor.authorYan, Wei-Yong
dc.contributor.authorSreeram, V.
dc.contributor.authorTeo, Kok
dc.identifier.citationLiu, Wan-Quan and Yan, W. and Sreeram, V. and Teo, Kok Lay. 2001. Global convergence analysis for the NIC flow. IEEE Transactions on Signal Processing. 49 (10): pp. 2422-2430.

Previously, a family of fast subspace tracking algorithms based on a novel information criterion (NIC) has been proposed and investigated. It is known that these new algorithms are associated with a new kind of flow, which is called the NIC flow in this paper as in the case of the conventional Oja subspace algorithms with the Oja flow. In this paper, some fundamental questions about this new NIC flow such as its solution existence and convergence, are investigated. In addition, the convergence domain is characterized. Some important results on these issues are obtained via manifold theory

dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectnovel information criterion
dc.subjectGlobal convergence
dc.subjectOja flow
dc.subjectmatrix differential equation
dc.titleGlobal convergence analysis for the NIC flow
dc.typeJournal Article
dcterms.source.titleIEEE Transactions on Signal Processing

Copyright © 2001 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

curtin.accessStatusOpen access
curtin.facultySchool of Electrical Engineering and Computing
curtin.facultyDepartment of Computing
curtin.facultyFaculty of Science and Engineering

Files in this item


This item appears in the following Collection(s)

Show simple item record