Pages that link to "Item:Q3168789"

The following pages link to Blendenpik: Supercharging LAPACK's Least-Squares Solver (Q3168789):

Displaying 32 items.

• Simple backward error bounds for linear least-squares problems (Q389595) (← links)
• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Faster least squares approximation (Q623334) (← links)
• Randomized LU decomposition (Q1690696) (← links)
• Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm (Q1738154) (← links)
• Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
• Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms (Q2029823) (← links)
• Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems (Q2068645) (← links)
• Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
• On spectral and numerical properties of random butterfly matrices (Q2274705) (← links)
• Randomized core reduction for discrete ill-posed problem (Q2309262) (← links)
• Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches (Q2310028) (← links)
• Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
• Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
• Incremental Regularized Least Squares for Dimensionality Reduction of Large-Scale Data (Q2810327) (← links)
• The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
• Tikhonov Regularization and Randomized GSVD (Q2813331) (← links)
• Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations (Q2831075) (← links)
• Compressed and Penalized Linear Regression (Q3391428) (← links)
• Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
• Relations Among Some Low-Rank Subspace Recovery Models (Q5380321) (← links)
• Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
• Model constraints independent optimal subsampling probabilities for softmax regression (Q6101697) (← links)
• Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)
• Fast randomized numerical rank estimation for numerically low-rank matrices (Q6154411) (← links)
• Subsampling in longitudinal models (Q6164867) (← links)
• Randomized Nyström Preconditioning (Q6166051) (← links)
• XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation (Q6180350) (← links)
• Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization (Q6195017) (← links)