Where does smoothness count the most for two-point boundary-value problems?
Publication:1961052
DOI10.7916/D8QC0BCD 10.1006/jcom.1999.0510; 10.7916/D8QC0BCDzbMath0945.65087MaRDI QIDQ1961052
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
finite element method; partial information; linear information; epsilon-complexity; elliptic two-point boundary value problems
65L60: Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations
65L10: Numerical solution of boundary value problems involving ordinary differential equations
65L70: Error bounds for numerical methods for ordinary differential equations
65Y20: Complexity and performance of numerical algorithms
34B05: Linear boundary value problems for ordinary differential equations
Related Items
Cites Work