The FastICA algorithm is a popular procedure for independent component analysis and blind source separation. Recently, several of its convergence properties have been elucidated, including its average convergence performance and its finite-sample behavior. In this paper, we examine the kurtosis-based algorithm version for two-source mixtures with equal-kurtosis sources, proving that the single-unit FastICA algorithm has dynamical behavior that is identical to the Newton-based Rayleigh Quotient Iteration for finding an eigenvector of a symmetric matrix. We also derive a bound on the average inter-channel interference indicating that the initial convergence rate of FastICA is linear with a rate of (1/3). A simulation indicates its convergence performance. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Douglas, S. C. (2006). Relationships between the fastICA algorithm and the rayleigh quotient iteration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 781–789). https://doi.org/10.1007/11679363_97
Mendeley helps you to discover research relevant for your work.