The complexity of two-point boundary-value problems with analytic data

DOI10.1006/JCOM.1993.1011MaRDI QIDQ2365848zbMATH OpenOpenAlexFDO

Authors A. G. Werschulz

Publication date 29 June 1993

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

\(h\)-version\(p\)-versioncomplexityerror boundserror estimatefinite elementtwo-point boundary value problem

Mathematics Subject Classification ID

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

Review text

The author considers the \(\varepsilon\)-complexity of a model two-point boundary value problem \(-u+u = f\) in \(I=(-1,1)\) with natural boundary conditions \(u'(-1)=u'(1)=0\), and the class \(F\) consists of analytic functions \(f\) bounded by 1 on a disk of radius \(\rho\geq 1\) centered at the origin. The \(\varepsilon\)-complexity means the infimum of the cost of the solution which attains the error estimate less than or equal to \(\varepsilon\) under appropriate norm for any \(f\), information of \(f\) and algorithm. Assuming that the evaluation of any function in \(F\) at any point in \(I\) has cost \(c\), he finds that if \(\rho>1\), then the \(\varepsilon\)- complexity is of order \(\log(\varepsilon^{-1})\) as \(\varepsilon\to 0\), and there is a finite element \(p\)-method whose cost is optimal to within a constant factor. If \(\rho=1\), then the \(\varepsilon\)-complexity is found to be of order \(\log^ 2(\varepsilon^{-1})\) as \(\varepsilon\to 0\), and there is a finite element \((h,p)\)-method whose cost is optimal to within a constant factor. The proofs are supported by some error bounds in the approximation and interpolation theories.

Recommendations

• The complexity of two-point boundary-value problems with piecewise analytic data
• The complexity of multivariate elliptic problems with analytic data
• Where does smoothness count the most for two-point boundary-value problems?
• scientific article; zbMATH DE number 1850928
• Complexity of nonlinear two-point boundary-value problems

Cited in

(6)

• The complexity of two-point boundary-value problems with piecewise analytic data
• The complexity of multivariate elliptic problems with analytic data
• Complexity of nonlinear two-point boundary-value problems
• Where does smoothness count the most for two-point boundary-value problems?
• Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
• The use of integral information in the solution of a two-point boundary value problem

This page was built for publication: The complexity of two-point boundary-value problems with analytic data

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