Pages that link to "Item:Q706787"
From MaRDI portal
The following pages link to Linear vs. nonlinear algorithms for linear problems (Q706787):
Displaying 15 items.
- Are linear algorithms always good for linear problems? (Q1082778) (← links)
- Linear problems (with extended range) have linear optimal algorithms (Q1099022) (← links)
- Uniform recovery of high-dimensional \(C^r\)-functions (Q1633630) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- Some nonlinear problems are as easy as the approximation problem (Q2266192) (← links)
- Approximation numbers of Sobolev embeddings-sharp constants and tractability (Q2442810) (← links)
- Computing a quantity of interest from observational data (Q2631950) (← links)
- Exponential tractability of \(L_2\)-approximation with function values (Q2692804) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- Random sections of ellipsoids and the power of random information (Q5047902) (← links)
- Sampling numbers of smoothness classes via \(\ell^1\)-minimization (Q6062173) (← links)
- Homogeneous algorithms and solvable problems on cones (Q6540037) (← links)
- Tractability of sampling recovery on unweighted function classes (Q6550282) (← links)
- Randomized approximation of summable sequences -- adaptive and non-adaptive (Q6632941) (← links)
- Sparse-grid sampling recovery and numerical integration of functions having mixed smoothness (Q6650705) (← links)
