Complexity of multilinear problems in the average case setting
From MaRDI portal
Publication:1174451
DOI10.1016/0885-064X(91)90047-2zbMath0788.65063OpenAlexW4250338989MaRDI QIDQ1174451
Publication date: 25 June 1992
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(91)90047-2
algorithmBanach spacesHilbert spaceworst case settingaverage case settingaverage performancemultilinear problemsspline algorithms
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication, information (94A99) Numerical solutions to equations with linear operators (65J10) Information theory (general) (94A15) Complexity and performance of numerical algorithms (65Y20) Communication theory (94A05) Numerical linear algebra (65F99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of multilinear problems in the worst case setting
- On the average complexity of multivariate problems
- Can adaption help on the average?
- Orthogonally invariant measures and best approximation of linear operators
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Elliptically contoured measures on infinite-dimensional Banach spaces