Complexity of Indefinite Elliptic Problems

DOI10.2307/2007987MaRDI QIDQ3030179zbMATH OpenOpenAlexFDO

Authors A. G. Werschulz

Publication date 1986

Full work available at URL https://doi.org/10.2307/2007987

zbMATH Keywords

complexityError estimatesminimal error

Mathematics Subject Classification ID

Boundary value problems for higher-order elliptic equations (35J40) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Where does smoothness count the most for two-point boundary-value problems?
• What is the complexity of elliptic systems?
• The complexity of indefinite elliptic problems with noisy data
• scientific article; zbMATH DE number 169153
• The complexity of definite elliptic problems with noisy data

Cited in

(9)

• What is the complexity of elliptic systems?
• Galerkin method and optimal error algorithms in Hilbert spaces
• Optimal algorithms for a problem of optimal control
• Average case complexity of elliptic partial differential equations
• The complexity of multivariate elliptic problems with analytic data
• The complexity of indefinite elliptic problems with noisy data
• A remark on the \(L^{\infty}\) bounds of the Ritz operator associated with a finite element approximation
• Where does smoothness count the most for two-point boundary-value problems?
• The complexity of definite elliptic problems with noisy data

This page was built for publication: Complexity of Indefinite Elliptic Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030179)