The complexity of multivariate elliptic problems with analytic data
From MaRDI portal
The author computes \(H^m\)-norm \(\varepsilon\)-approximations to solutions of \(2m\)th-order elliptic boundary value problems \(Lu = f\) for a fixed \(L\) and for \(f \in F\), where \(F\) is a class of functions defined on a \(d\)-dimensional domain, by assuming that the only information we can compute about \(f \in F\) is the value of a finite number of continuous linear functionals of \(f\), each evaluation having cost \(c(d)\).
Recommendations
Cited in
(4)- The complexity of two-point boundary-value problems with piecewise analytic data
- \(\varepsilon\)-dimension in infinite dimensional hyperbolic cross approximation and application to parametric elliptic PDEs
- The complexity of two-point boundary-value problems with analytic data
- The randomized information complexity of elliptic PDE
This page was built for publication: The complexity of multivariate elliptic problems with analytic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346598)