The fastICA algorithm revisited: convergence analysis

Erkki Oja1, Zhijian Yuan

  • 1Adaptive Informatics Research Centre, Helsinki University of Technology, 02015 HUT, Finland. erkki.oja@hut.fi

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Convergence of Taylor Series01:30

Convergence of Taylor Series

The Taylor series provides a systematic method for approximating a smooth function by a polynomial that closely matches the function near a chosen point. This approach is particularly valuable in scientific and engineering contexts where functions may be difficult to evaluate directly, such as oscillatory voltages in alternating current (AC) circuits. Replacing complex functions with polynomial expressions simplifies computation while preserving essential local behavior. Taylor’s Theorem...
Alternating Series and Absolute Convergence01:28

Alternating Series and Absolute Convergence

A mass attached to a vertical spring can exhibit oscillatory motion as it moves above and below a central equilibrium point. In an ideal spring, the oscillations would continue indefinitely with constant amplitude. In a damped spring, however, resistive forces such as air resistance or internal friction gradually reduce the size of each swing. This behavior is often modeled by combining a sinusoidal function, which represents the repeated motion, with an exponential decay factor, which reduces...
Convergence of Sequences01:26

Convergence of Sequences

A sequence is a function defined on the natural numbers that assigns a value to each index. It can be understood as an ordered list of terms generated one after another. In mathematical analysis, an important question is whether the terms of a sequence approach a single real number as the index becomes very large. When this happens, the sequence is said to converge, and the value approached is called the limit. From a graphical perspective, convergence means that the plotted terms approach a...