Optimal algorithms for diagonal operators on N-widths in different computational setting
From MaRDI portal
Publication:5435814
DOI10.1007/s10496-007-0180-zzbMath1165.41321OpenAlexW2002468808MaRDI QIDQ5435814
Publication date: 14 January 2008
Published in: Analysis in Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10496-007-0180-z
Linear operator approximation theory (47A58) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Probabilistic methods for one variable harmonic analysis (42A61)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
- Random approximation of Sobolev embeddings
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Average \(n\)-width of point set in Hilbert space
- Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting.
- Probabilistic and average linear widths of Sobolev space with Gaussian measure in \(L_\infty\)-norm
- Approximation characteristics for diagonal operators in different computational settings
- Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse
- A general principle on ordered sets and its applications to fixed point theory
This page was built for publication: Optimal algorithms for diagonal operators on N-widths in different computational setting