Related Experiment Video
Updated: Jul 18, 2026

Optical Coherence Tomography Based Biomechanical Fluid-Structure Interaction Analysis of Coronary Atherosclerosis Progression
Published on: January 15, 2022
The fastICA algorithm revisited: convergence analysis
1Adaptive Informatics Research Centre, Helsinki University of Technology, 02015 HUT, Finland. erkki.oja@hut.fi
Abstract:
The fast independent component analysis (FastICA) algorithm is one of the most popular methods to solve problems in ICA and blind source separation. It has been shown experimentally that it outperforms most of the commonly used ICA algorithms in convergence speed. A rigorous local convergence analysis has been presented only for the so-called one-unit case, in which just one of the rows of the separating matrix is considered. However, in the FastICA algorithm, there is also an explicit normalization step, and it may be questioned whether the extra rotation caused by the normalization will affect the convergence speed. The purpose of this paper is to show that this is not the case and the good convergence properties of the one-unit case are also shared by the full algorithm with symmetrical normalization. A local convergence analysis is given for the general case, and the global behavior is illustrated numerically for two sources and two mixtures in several typical cases.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Fast Decoupled and DC Powerflow
Convergence of Fourier Series
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Convergence of Taylor Series
Alternating Series and Absolute Convergence
Convergence of Sequences