The complexity of indefinite elliptic problems with noisy data
type: Item
instance of: scholarly article
title: The complexity of indefinite elliptic problems with noisy data
zbMATH Open document ID: 0894.65056
author: A. G. Werschulz
published in: Journal of Complexity
publication date: 1998-09-07T00:00:00Z
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 35J25
zbMATH DE Number: 1143913
zbMATH Keywords: noisy data
zbMATH Keywords: complexity
zbMATH Keywords: second-order indefinite elliptic problems
zbMATH Keywords: noisy finite element method with quadrature
zbMATH Keywords: minimal error algorithm
zbMATH Keywords: multigrid techniques
MaRDI profile type: Publication
full work available at URL: jcom.1997.0456
OpenAlex ID: W4251027226
cites work: Q3214109
cites work: Q4272015
cites work: Uniform Convergence of Multigrid V-Cycle Iterations for Indefinite and Nonsymmetric Problems
cites work: Q4300595
cites work: Q3890207
cites work: Interpolation theory over curved elements, with applications to finite element methods
cites work: On a Class of Integral Equations of the First Kind in Inverse Scattering Theory
cites work: Q4040640
cites work: Q3960078
cites work: Q4389411
cites work: Worst case complexity of problems with random information noise
cites work: Q3993279
cites work: Q4000361
cites work: The complexity of definite elliptic problems with noisy data
DOI: 10.7916/D8FX7JB4
DOI: 10.1006/JCOM.1997.0456
description: scientific article; zbMATH DE number 1143913