Local Convergence Analysis of FastICA
The FastICA algorithm can be considered as a selfmap on a manifold. It turns out that FastICA is a scalar shifted version of an algorithm recently proposed. We put these algorithms into a dynamical system framework. The local convergence properties are investigated subject to an ideal ICA model. The analysis is very similar to the well-known case in numerical linear algebra when studying power iterations versus Rayleigh quotient iteration.
|Collections||ANU Research Publications|
|Book Title:||Independent Component Analysis and Blind Signal Separation|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.