Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method
Theoretical Computer Science
A stable MCA learning algorithm
Computers & Mathematics with Applications
Adaptive multiple minor directions extraction in parallel using a PCA neural network
Theoretical Computer Science
On the discrete time dynamics of a self-stabilizing MCA learning algorithm
Mathematical and Computer Modelling: An International Journal
| Hi-index | 35.69 |
Pisarenko's harmonic retrieval (PHR) method is perhaps the first eigenstructure based spectral estimation technique. The basic step in this method is the computation of eigenvector corresponding to the minimum eigenvalue of the autocorrelation matrix of the underlying data. The authors recast a known constrained minimization formulation for obtaining this eigenvector into the neural network (NN) framework. Using the penalty function approach, they develop an appropriate energy function for the NN. This NN is of feedback type with the neurons having sigmoidal activation function. Analysis of the proposed approach shows that the required eigenvector is a minimizer (with a given norm) of this energy function. Further, all its minimizers are global minimizers. Bounds on the integration time step that is required to numerically solve the system of nonlinear differential equations, which define the network dynamics, have been derived. Results of computer simulations are presented to support their analysis