On the tractability of linear tensor product problems in the worst case
From MaRDI portal
Publication:731971
DOI10.1016/j.jco.2009.05.002zbMath1177.65064OpenAlexW2066523963MaRDI QIDQ731971
Iasonas Petras, Anargyros Papageorgiou
Publication date: 9 October 2009
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2009.05.002
complexityeigenvaluesweak tractabilityworst caseabsolute error criterionlinear tensor product problem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)
Related Items
(\(s, \ln^\kappa\))-weak tractability of linear problems ⋮ Liberating the dimension for function approximation ⋮ Tractability of linear problems defined over Hilbert spaces ⋮ Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity ⋮ Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals ⋮ Uniform weak tractability ⋮ Quasi-polynomial tractability ⋮ A new criterion for tractability of multivariate problems ⋮ EC-\((s, t)\)-weak tractability of multivariate linear problems in the average case setting
Cites Work
