检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Li Feng Zhongyi Huang
机构地区:[1]Department of Mathematical Sciences,Tsinghua University,Beijing 100084,China
出 处:《Journal of Computational Mathematics》2024年第5期1356-1379,共24页计算数学(英文)
基 金:supported by the NSFC(Grant No.12025104).
摘 要:In this paper,we propose a numerical method for turning point problems in one dimension based on Petrov-Galerkin finite element method(PGFEM).We first give a priori estimate for the turning point problem with a single boundary turning point.Then we use PGFEM to solve it,where test functions are the solutions to piecewise approximate dual problems.We prove that our method has a first-order convergence rate in both L∞h norm and a discrete energy norm when we select the exact solutions to dual problems as test functions.Numerical results show that our scheme is efficient for turning point problems with different types of singularities,and the convergency coincides with our theoretical results.
关 键 词:Turning point problem Petrov-Galerkin finite element method Uniform convergency
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.67