Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 6 Feb 2020 in math.NA and cs.NA

Abstract: In this paper, we present and study $C1$ Petrov-Galerkin and Gauss collocation methods with arbitrary polynomial degree $k$ ($\ge 3$) for one-dimensional elliptic equations. We prove that, the solution and its derivative approximations converge with rate $2k-2$ at all grid points; and the solution approximation is superconvergent at all interior roots of a special Jacobi polynomial of degree $k+1$ in each element, the first-order derivative approximation is superconvergent at all interior $k-2$ Lobatto points, and the second-order derivative approximation is superconvergent at $k-1$ Gauss points, with an order of $k+2$, $k+1$, and $k$, 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 $H2$, $H1$, and $L2$ norms. All theoretical findings are confirmed by numerical experiments.

Citations (5)

Summary

We haven't generated a summary for this paper yet.