Pages that link to "Item:Q2266192"
From MaRDI portal
The following pages link to Some nonlinear problems are as easy as the approximation problem (Q2266192):
Displaying 21 items.
- Product rules are optimal for numerical integration in classical smoothness spaces (Q346296) (← links)
- On the information-based complexity of optimal reconstruction for nonlinear systems (Q584132) (← links)
- Linear vs. nonlinear algorithms for linear problems (Q706787) (← links)
- The average a posteriori error of numerical methods (Q1071476) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Probabilistic setting of information-based complexity (Q1092660) (← links)
- Approximation with one (or few) parameters nonlinear (Q1099577) (← links)
- Optimal algorithms for a problem of optimal control (Q1123393) (← links)
- Uniform recovery of high-dimensional \(C^r\)-functions (Q1633630) (← links)
- On the complexity of computing the \(L_q\) norm (Q1791678) (← links)
- On discretization errors in nonlinear approximation problems (Q1819301) (← links)
- Information of varying cardinality (Q1821084) (← links)
- On average case errors in numerical analysis (Q1822459) (← links)
- How powerful is continuous nonlinear information for linear problems? (Q1822461) (← links)
- Tractability for Volterra problems of the second kind with convolution kernels (Q2034562) (← links)
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace (Q2059812) (← links)
- Sampling discretization and related problems (Q2136857) (← links)
- Sampling discretization error of integral norms for function classes (Q2274411) (← links)
- Local approximation of operators (Q2689140) (← links)
- On best-approximation problems for nonlinear operators (Q2778297) (← links)
- The power of standard information for multivariate approximation in the randomized setting (Q3426031) (← links)
