{"title":"指数网格和h矩阵","authors":"Niklas Angleitner, M. Faustmann, J. Melenk","doi":"10.48550/arXiv.2203.09925","DOIUrl":null,"url":null,"abstract":". In [AFM21a], we proved that the inverse of the stiffness matrix of an h -version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block rank by H -matrices. Here, we improve on this result in multiple ways: (1) The class of meshes is significantly enlarged and includes certain exponentially graded meshes. (2) The dependence on the polynomial degree p of the discrete ansatz space is made explicit in our analysis. (3) The bound for the approximation error is sharpened, and (4) the proof is simplified.","PeriodicalId":10572,"journal":{"name":"Comput. Math. Appl.","volume":"5 1","pages":"21-40"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Exponential meshes and H-matrices\",\"authors\":\"Niklas Angleitner, M. Faustmann, J. Melenk\",\"doi\":\"10.48550/arXiv.2203.09925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". In [AFM21a], we proved that the inverse of the stiffness matrix of an h -version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block rank by H -matrices. Here, we improve on this result in multiple ways: (1) The class of meshes is significantly enlarged and includes certain exponentially graded meshes. (2) The dependence on the polynomial degree p of the discrete ansatz space is made explicit in our analysis. (3) The bound for the approximation error is sharpened, and (4) the proof is simplified.\",\"PeriodicalId\":10572,\"journal\":{\"name\":\"Comput. Math. Appl.\",\"volume\":\"5 1\",\"pages\":\"21-40\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Comput. Math. Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2203.09925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comput. Math. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2203.09925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
. In [AFM21a], we proved that the inverse of the stiffness matrix of an h -version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block rank by H -matrices. Here, we improve on this result in multiple ways: (1) The class of meshes is significantly enlarged and includes certain exponentially graded meshes. (2) The dependence on the polynomial degree p of the discrete ansatz space is made explicit in our analysis. (3) The bound for the approximation error is sharpened, and (4) the proof is simplified.