We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral...We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence theory for the the so-called local multigrid correction scheme with hybrid smoothing. We establish that its convergence rate is uniform with respect to the number of refinement steps. The proof relies on corresponding results for local multigrid in a H^1 (Ω)-context along with local discrete Helmholtz-type decompositions of the edge element space.展开更多
In this paper, we apply the symmetric Galerkin methods to the numerical solutions of a kind of singular linear two-point boundary value problems. We estimate the error in the maximum norm. For the sake of obtaining fu...In this paper, we apply the symmetric Galerkin methods to the numerical solutions of a kind of singular linear two-point boundary value problems. We estimate the error in the maximum norm. For the sake of obtaining full superconvergence uniformly at all nodal points, we introduce local mesh refinements. Then we extend these results to a class of nonlinear problems. Finally, we present some numerical results which confirm our theoretical conclusions.展开更多
基金supported in part by China NSF under the grant 60873177by the National Basic Research Project under the grant 2005CB321702
文摘We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence theory for the the so-called local multigrid correction scheme with hybrid smoothing. We establish that its convergence rate is uniform with respect to the number of refinement steps. The proof relies on corresponding results for local multigrid in a H^1 (Ω)-context along with local discrete Helmholtz-type decompositions of the edge element space.
基金Supported by the Scientific Research Foundation for the Doctor,Nanjing University of Aeronautics and Astronautics(No.1008-907359)
文摘In this paper, we apply the symmetric Galerkin methods to the numerical solutions of a kind of singular linear two-point boundary value problems. We estimate the error in the maximum norm. For the sake of obtaining full superconvergence uniformly at all nodal points, we introduce local mesh refinements. Then we extend these results to a class of nonlinear problems. Finally, we present some numerical results which confirm our theoretical conclusions.