Cross-correlation neural network models for the smallest singular component of general matrix

Abstract

Abstract In this paper, we provide the theoretical foundation for a novel neural model to solve the smallest singular component of general matrix, on the basis of an extension of the Hebbian rule and a modification of cross-coupled Hebbian rule. This model can efficiently extract the singular-value component of the cross-correlation matrix of two stochastic signals. By Lasalle’s invariance principle and Lyapunov’s indirect method, we study the global asymptotic convergence of the networks to the first singular vectors of the cross-correlation matrix or non-squares matrix. A comparative study on the related neural networks shows that this neural network is efficient for computing the smallest singular component of general matrix. The novel model may have useful applications in solving the total least-squares problems in adaptive signal processing and image compressing.