Conditioning of leverage scores and computation by QR decomposition

From MaRDI portal
Publication:5502147

DOI10.1137/140988541zbMATH Open1321.65070arXiv1402.0957OpenAlexW2887082150WikidataQ57439437 ScholiaQ57439437MaRDI QIDQ5502147FDOQ5502147

Thomas Wentworth, John T. Holodnak, Ilse C. F. Ipsen

Publication date: 17 August 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: The leverage scores of a full-column rank matrix A are the squared row norms of any orthonormal basis for range(A). We show that corresponding leverage scores of two matrices A and A + Delta A are close in the relative sense, if they have large magnitude and if all principal angles between the column spaces of A and A + Delta A are small. We also show three classes of bounds that are based on perturbation results of QR decompositions. They demonstrate that relative differences between individual leverage scores strongly depend on the particular type of perturbation Delta A. The bounds imply that the relative accuracy of an individual leverage score depends on: its magnitude and the two-norm condition of A, if Delta A is a general perturbation; the two-norm condition number of A, if Delta A is a perturbation with the same norm-wise row-scaling as A; (to first order) neither condition number nor leverage score magnitude, if Delta A is a component-wise row-scaled perturbation. Numerical experiments confirm the qualitative and quantitative accuracy of our bounds.


Full work available at URL: https://arxiv.org/abs/1402.0957




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: Conditioning of leverage scores and computation by QR decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502147)