IEEE Transactions on Computers - Fault-Tolerant Computing
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Fault-tolerant database using distributed associative memories
Information Sciences: an International Journal
A simple algorithm for computing the generalized inverse of a matrix
Communications of the ACM
Journal of Computational and Applied Mathematics
Key nodes mining in transport networks based on PageRank algorithm
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
| Hi-index | 0.00 |
The generalized inverse of a matrix is an extension of the ordinary square matrix inverse which applies to any matrix (e.g., singular, rectangular). The generalized inverse has numerous important applications such as regression analysis, filtering, optimization and, more recently, linear associative memories. In this latter application known as Distributed Associative Memory, stimulus vectors are associated with response vectors and the result of many associations is spread over the entire memory matrix, which is calculated as the generalized inverse. Addition/deletion of new associations requires recalculation of the generalized inverse, which becomes computationally costly for large systems. A better solution is to calculate the generalized inverse recursively. The proposed algorithm is a modification of the well known algorithm due to Rust et al. [2], originally introduced for nonrecursive computation. We compare our algorithm with Greville's recursive algorithm and conclude that our algorithm provides better numerical stability at the expense of little extra computation time and additional storage.