num::update_inverse_rows

Defined in header <linear/factorization/woodbury.hpp>

template <factorization F>
void update_inverse_rows(const woodbury_solver<F> &correction, mat<real> &first,
                         mat<real> &second, inverse_rows_workspace &work);

Carry selected rows of \(A^{-1}\) and \(A^{-2}\) across a low-rank change.

With \(U_b = EA_{base}^{-1}\) and \(V_b = EA_{base}^{-2}\) on entry, this leaves the corresponding rows of the corrected inverse and its square in first and second. Both updates are rank-p, so the cost does not grow with the number of rows carried.