Where does smoothness count the most for two-point boundary-value problems?

DOI10.1006/jcom.1999.0510zbMath0945.65087OpenAlexW2055945455MaRDI QIDQ1961052

Arthur G. Werschulz

Publication date: 5 October 2000

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

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

zbMATH Keywords

finite element methodpartial informationlinear informationepsilon-complexityelliptic two-point boundary value problems

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Error bounds for numerical methods for ordinary differential equations (65L70) Complexity and performance of numerical algorithms (65Y20) Linear boundary value problems for ordinary differential equations (34B05)

Related Items

Complexity of nonlinear two-point boundary-value problems, Where does smoothness count the most for Fredholm equations of the second kind with noisy information?

Cites Work

• The complexity of indefinite elliptic problems with noisy data
• The complexity of definite elliptic problems with noisy data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item