{"title":"网元法的基本收敛理论","authors":"J. Coatléven","doi":"10.1051/m2an/2021062","DOIUrl":null,"url":null,"abstract":"A recent paper introduced the network element method (NEM) where the usual mesh was replaced by a discretization network. Using the associated network geometric coefficients and following the virtual element framework, a consistent and stable numerical scheme was proposed. The aim of the present paper is to derive a convergence theory for the NEM under mild assumptions on the exact problem. We also derive basic error estimates, which are sub-optimal in the sense that we have to assume more regularity than usual.","PeriodicalId":50499,"journal":{"name":"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique","volume":"1 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Basic convergence theory for the network element method\",\"authors\":\"J. Coatléven\",\"doi\":\"10.1051/m2an/2021062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A recent paper introduced the network element method (NEM) where the usual mesh was replaced by a discretization network. Using the associated network geometric coefficients and following the virtual element framework, a consistent and stable numerical scheme was proposed. The aim of the present paper is to derive a convergence theory for the NEM under mild assumptions on the exact problem. We also derive basic error estimates, which are sub-optimal in the sense that we have to assume more regularity than usual.\",\"PeriodicalId\":50499,\"journal\":{\"name\":\"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2021-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1051/m2an/2021062\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1051/m2an/2021062","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
Basic convergence theory for the network element method
A recent paper introduced the network element method (NEM) where the usual mesh was replaced by a discretization network. Using the associated network geometric coefficients and following the virtual element framework, a consistent and stable numerical scheme was proposed. The aim of the present paper is to derive a convergence theory for the NEM under mild assumptions on the exact problem. We also derive basic error estimates, which are sub-optimal in the sense that we have to assume more regularity than usual.
期刊介绍:
M2AN publishes original research papers of high scientific quality in two areas: Mathematical Modelling, and Numerical Analysis. Mathematical Modelling comprises the development and study of a mathematical formulation of a problem. Numerical Analysis comprises the formulation and study of a numerical approximation or solution approach to a mathematically formulated problem.
Papers should be of interest to researchers and practitioners that value both rigorous theoretical analysis and solid evidence of computational relevance.