A rank-one matrix update changes a matrix by an outer product . For real vectors , its action on an input vector isThe dot product reads one scalar from the input, and the correction moves the output along . All correction outputs therefore lie in one linear span. If either vector is zero, the update is zero; otherwise the correction is a rank-one matrix. The full updated matrix need not have rank one.
For example, chooseThe update sends to the correction . Although all four entries change, there is only one direction of correction. Adding it to the identity matrix gives .
This special structure allows existing work to be reused. The matrix determinant lemma updates the determinant using one scalar, and the Sherman–Morrison formula updates the matrix inverse using an outer product. Such formulas are useful when a linear system changes slightly after a new observation or a parameter adjustment: the unchanged part can retain its LU decomposition. The term rank-one describes the rank of the correction, not the size of the entry changes. [ref]
https://ocw.mit.edu/courses/18-065-matrix-methods-in-data-analysis-signal-processing-and-machine-learning-spring-2018/988b4c05680f40a5a4b3be7004a32500_XhSk_Lw2X_U.pdf. Gilbert Strang, MIT 18.065, Lecture 14: Low Rank Changes in A and Its Inverse
. Articles by others on the same topic
There are currently no matching articles.