Pages that link to "Item:Q4301270"

The following pages link to Low‐rank revealing QR factorizations (Q4301270):

Displaying 18 items.

• Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection (Q333589) (← links)
• Rang revealing QR factorizations (Q578845) (← links)
• RankRev: a Matlab package for computing the numerical rank and updating/downdating (Q684191) (← links)
• Column subset selection via sparse approximation of SVD (Q764372) (← links)
• Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations (Q1092611) (← links)
• A block algorithm for computing rank-revealing QR factorizations (Q1200543) (← links)
• Deflated Krylov subspace methods for nearly singular linear systems (Q1336066) (← links)
• Low-rank revealing \(UTV\) decompositions (Q1370338) (← links)
• Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
• Rank revealing Gaussian elimination by the maximum volume concept (Q1987003) (← links)
• Deviation maximization for rank-revealing QR factorizations (Q2084250) (← links)
• Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting (Q2231598) (← links)
• Column subset selection problem is UG-hard (Q2637653) (← links)
• Rank-Revealing QR Factorizations and the Singular Value Decomposition (Q3987930) (← links)
• Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation (Q4814584) (← links)
• (Q5005143) (← links)
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)