Kolmogorov width and approximate rank

DOI10.1134/S0081543818080126zbMATH Open1426.41016OpenAlexW2919133567WikidataQ128284591 ScholiaQ128284591MaRDI QIDQ2423217FDOQ2423217

Authors: K. S. Ryutin, B. S. Kashin, Yuri V. Malykhin 

Publication date: 21 June 2019

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543818080126

Recommendations

• Nonlinear Kolmogorov widths
• The information Kolmogorov width and some exact inequalities between widths
• scientific article; zbMATH DE number 3877692
• Publication:4727618
• Kolmogorov widths of weighted Sobolev classes on closed intervals

zbMATH Keywords

Kolmogorov widthapproximate rank

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25)

Cites Work

• Title not available (Why is that?)
• Classical Fourier analysis
• Title not available (Why is that?)
• Upper and lower bounds for stochastic processes. Modern methods and classical problems
• Title not available (Why is that?)
• Nonlinear approximation by trigonometric sums
• NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Estimating the optimal margins of embeddings in Euclidean half spaces
• Complexity Lower Bounds using Linear Algebra
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• Complexity measures of sign matrices
• Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
• Constructive sparse trigonometric approximation for functions with small mixed smoothness
• DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
• Title not available (Why is that?)
• Lower bounds in communication complexity based on factorization norms
• Title not available (Why is that?)
• The octahedron is badly approximated by random subspaces
• Title not available (Why is that?)
• The approximate rank of a matrix and its algorithmic applications
• Lower bounds for agnostic learning via approximate rank
• Remark on estimates of orthomassivity
• On a norm and approximate characteristics of classes of multivariable functions
• Title not available (Why is that?)
• On the diameters of a class of functions of bounded variation in the spaceL^q(0,1), 2 <q< ∞
• Lower bounds for \(n\)-term approximations of plane convex sets and related topics
• Dyadic analogues of Hilbert matrices

Cited In (6)

• Kolmogorov widths of the Besov classes \(B^1_{1,\theta}\) and products of octahedra
• Estimates for the Kolmogorov widths of sets associated with the domain of a nonlinear equation of mixed type
• Matrix and tensor rigidity and \(L_p\)-approximation
• Widths and rigidity
• Computing rank-width exactly
• Infinite-dimensional generalization of Kolmogorov widths

This page was built for publication: Kolmogorov width and approximate rank

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