Fast method for updating robust pseudoinverse and Ho-Kashyap associative processors

A new approximate method is proposed for updating robust pseudoinverse and Ho-Kashyap associative processors. The method can both add and delete vectors. It is faster than existing methods for updating the standard pseudoinverse associative processor, in addition to operating on a preferable robust associative processor. The new method is based on the matrix inversion lemma. Update algorithms are also noted that are suitable for reduced accuracy (analog) processors and for pipelined array processors.<
>