Improved convergence rates for some discrete Galerkin methods
Making use of an argument analogous to that of \textit{S. Joe} [IMA J. Numer. Anal. 7, 149-164 (1987; Zbl 0628.65132)] for spline approximations, the estimate of the convergence rate is improved from \(O(n^{-r+1})\) to \(O(n^{-r +{1 \over 2}})\) where \(n\) is the degree of the polynomial approximation.
scientific article; zbMATH DE number 1005456
scientific article