Does Increased Regularity Lower Complexity?

DOI10.2307/2007560MaRDI QIDQ3219026zbMATH OpenOpenAlexFDO

Authors A. G. Werschulz

Publication date 1984

Full work available at URL https://doi.org/10.2307/2007560

zbMATH Keywords

complexitylinear problemsregularityseminormSobolev norm

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Uniform weak tractability of multivariate problems with increasing smoothness
• Computational complexity in worst, stochastic and average case setting on functional approximation problem of multivariate
• Tractability through increasing smoothness
• Average case complexity of linear multivariate problems. I: Theory
• Tractability of multivariate approximation in Korobov spaces with increasing smoothness in the worst case setting

Cited in

(2)

• On detecting regularity of functions: A probabilistic analysis
• Is complexity a source of incompleteness?

This page was built for publication: Does Increased Regularity Lower Complexity?

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