English

A $C^1$ Petrov-Galerkin method and Gauss collocation method for 1D general elliptic problems and superconvergence

Numerical Analysis 2020-02-07 v1 Numerical Analysis

Abstract

In this paper, we present and study C1C^1 Petrov-Galerkin and Gauss collocation methods with arbitrary polynomial degree kk (3\ge 3) for one-dimensional elliptic equations. We prove that, the solution and its derivative approximations converge with rate 2k22k-2 at all grid points; and the solution approximation is superconvergent at all interior roots of a special Jacobi polynomial of degree k+1k+1 in each element, the first-order derivative approximation is superconvergent at all interior k2k-2 Lobatto points, and the second-order derivative approximation is superconvergent at k1k-1 Gauss points, with an order of k+2k+2, k+1k+1, and kk, respectively. As a by-product, we prove that both the Petrov-Galerkin solution and the Gauss collocation solution are superconvergent towards a particular Jacobi projection of the exact solution in H2H^2, H1H^1, and L2L^2 norms. All theoretical findings are confirmed by numerical experiments.

Keywords

Cite

@article{arxiv.2002.02266,
  title  = {A $C^1$ Petrov-Galerkin method and Gauss collocation method for 1D general elliptic problems and superconvergence},
  author = {Waixiang Cao and Lueling Jia and Zhimin Zhang},
  journal= {arXiv preprint arXiv:2002.02266},
  year   = {2020}
}
R2 v1 2026-06-23T13:33:02.773Z