A power-based adaptive method for eigenanalysis without square-root operations
Digital Signal Processing
An efficient algorithm for rank and subspace tracking
Mathematical and Computer Modelling: An International Journal
Updating the Lambda modes of a nuclear power reactor
Mathematical and Computer Modelling: An International Journal
| Hi-index | 35.68 |
In certain signal processing applications it is required to compute the null space of a matrix whose rows are samples of a signal with p components. The usual tool for doing this is the singular value decomposition. However, the singular value decomposition has the drawback that it requires O(p3) operations to recompute when a new sample arrives. It is shown that a different decomposition, called the URV decomposition, is equally effective in exhibiting the null space and can be updated in O( p2) time. The updating technique can be run on a linear array of p processors in O(p) time