The complexity of indefinite elliptic problems with noisy data

DOI10.7916/D8FX7JB4zbMATH Open0894.65056OpenAlexW4251027226MaRDI QIDQ1383441FDOQ1383441

Authors: A. 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

Recommendations

• The complexity of definite elliptic problems with noisy data
• Complexity of Indefinite Elliptic Problems
• The complexity of Fredholm equations of the second kind: noisy information about everything
• Where does smoothness count the most for two-point boundary-value problems?

zbMATH Keywords

complexityminimal error algorithmnoisy datamultigrid techniquesnoisy finite element method with quadraturesecond-order indefinite elliptic problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• On the optimal robust solution of IVPs with noisy information
• Optimal pointwise approximation of SDE's from inexact information
• Where does smoothness count the most for two-point boundary-value problems?
• Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
• Optimal approximation of stochastic integrals in analytic noise model
• Complexity of Indefinite Elliptic Problems
• Euler scheme for approximation of solution of nonlinear ODEs under inexact information
• 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
• The randomized information complexity of elliptic PDE

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

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