Pages that link to "Item:Q1963915"

The following pages link to Bounds on singular values revealed by QR factorizations (Q1963915):

Displaying 12 items.

• Column subset selection via sparse approximation of SVD (Q764372) (← links)
• On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
• On the existence and computation of rank-revealing LU factorizations (Q1587285) (← links)
• Optimal column subset selection for image classification by genetic algorithms (Q1621645) (← links)
• Strong rank revealing LU factorizations (Q1873693) (← links)
• Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
• Column subset selection is NP-complete (Q2228097) (← links)
• Linear-time CUR approximation of BEM matrices (Q2292005) (← links)
• ALORA: affine low-rank approximations (Q2312001) (← links)
• Column subset selection problem is UG-hard (Q2637653) (← links)
• Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)