Answers are grounded in this paper and cite their sources.
Block updating and downdating algorithms for regularised least squares problems with multiple right-hand sides based on the economical $QR$ decomposition are proposed. They exploit the initial coefficient matrix structure and use existing solution to establish a solution of the amended problem. Such an approach demonstrates its efficiency in terms of the memory required and the computational cost. Applications to linear discriminant analysis are considered and numerical experiments involving real-world databases show the efficiency of the methods.
No takes yet. Share an insight, caveat, or question.
Wei et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: