The complexity of indefinite elliptic problems with noisy data

DOI10.7916/D8FX7JB4zbMath0894.65056OpenAlexW4251027226MaRDI QIDQ1383441

Arthur G. Werschulz

Publication date: 7 September 1998

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1997.0456

zbMATH Keywords

complexitynoisy datamultigrid techniquesminimal error algorithmnoisy finite element method with quadraturesecond-order indefinite elliptic problems

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Optimal pointwise approximation of SDE's from inexact information ⋮ Euler scheme for approximation of solution of nonlinear ODEs under inexact information ⋮ Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information ⋮ Where does smoothness count the most for two-point boundary-value problems? ⋮ Optimal approximation of stochastic integrals in analytic noise model ⋮ The worst case complexity of the fredholm equation with periodic free term and noisy information^∗ ⋮ Randomized Runge-Kutta method -- stability and convergence under inexact information ⋮ On the randomized Euler schemes for ODEs under inexact information ⋮ On the optimal robust solution of IVPs with noisy information

Cites Work

• Worst case complexity of problems with random information noise
• The complexity of definite elliptic problems with noisy data
• Interpolation theory over curved elements, with applications to finite element methods
• On a Class of Integral Equations of the First Kind in Inverse Scattering Theory
• Uniform Convergence of Multigrid V-Cycle Iterations for Indefinite and Nonsymmetric Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of indefinite elliptic problems with noisy data