A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Global convergence analysis for the NIC flow
2001
IEEE Transactions on Signal Processing
Preserved Fulltext
Recently, 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 will be 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, will be investigated. In addition, the
doi:10.1109/78.950796
fatcat:edylywbdurftfbopdygoe3a37a