By Topic

Recursive methods for matrix inversion in pattern recognition environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
David Naccarato ; University of New Haven, New Haven, CT ; Y. T. Chien

Simple recursive methods for inverting an n ?? n matrix A + E in terms of A-1 and E are presented, where E represents a matrix of modifications of the matrix A. Algorithms for rank one and rank r matrix modifications are given. In addition, simple methods for determining if A + E is invertible are developed. Applications of these methods to pattern recognition problems where the inversion of a matrix (e.g. covariance matrix, scatter matrix, etc.) must be computed and frequently updated as changes in data occur are illustrated.

Published in:

Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, 1977 IEEE Conference on

Date of Conference:

7-9 Dec. 1977