The Complexity of Indefinite Elliptic Problems with Noisy Data
Work
Year: 1997
Type: article
Abstract: We study the complexity of second-order indefinite elliptic problems −div(a∇u) +bu=f(with homogeneous Dirichlet boundary conditions) over ad-dimensional domain Ω, the error being measured in theH1(Ω)-... more
Source: Journal of Complexity
Author Arthur G. Werschulz
Institutions Fordham University, Columbia University
Cites: 13
Cited by: 10
Related to: 10
FWCI: 1.01
Citation percentile (by year/subfield): 71.93
Subfield: Computational Mechanics
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,200