Subset selection for matrices in spectral norm

DOI10.1007/S10543-026-01138-4MaRDI QIDQ7290763zbMATH OpenFDO

Authors Ivan Kozyrev, Alexander I. Osinsky

Publication date 7 July 2026

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10543-026-01138-4

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical computation of matrix exponential and similar matrix functions (65F60)

Cites work

• A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
• A note on sparse least-squares regression
• A note on subset selection for matrices
• A theory of pseudoskeleton approximations
• Algorithm 853
• Close to optimal column approximation using a single SVD
• Deterministic Feature Selection for K-Means Clustering
• Discrete Signal Processing on Graphs: Sampling Theory
• Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
• Faster subset selection for matrices and applications
• How to generate random matrices from the classical compact groups
• scientific article; zbMATH DE number 3970003 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Lower bounds for column matrix approximations
• Near-optimal column-based matrix reconstruction
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• Optimal CUR matrix decompositions
• Optimal experimental design: formulations and computations
• Preconditioning linear least-squares problems by identifying a basis matrix
• Proportional volume sampling and approximation algorithms for \(A\)-optimal design
• Pseudo-skeleton approximations with better accuracy estimates
• Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
• Rank-deficient nonlinear least squares problems and subset selection
• Rank-one modification of the symmetric eigenproblem
• Sampling algorithms for l₂ regression and applications
• Signals on Graphs: Uncertainty Principle and Sampling
• Subset selection for matrices
• Subset selection for matrices with fixed blocks
• Twice-Ramanujan sparsifiers
• Volume‐based subset selection

This page was built for publication: Subset selection for matrices in spectral norm

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