{"title":"分数次幂解的高斯-拉盖尔方法","authors":"Eleonora Denich, Laura Grazia Dolce, Paolo Novati","doi":"10.1553/etna_vol58s517","DOIUrl":null,"url":null,"abstract":"This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self-adjoint positive operators in Hilbert spaces. The method is based on the Gauss-Laguerre rule, exploiting a particular integral representation of the resolvent. We provide sharp error estimates that can be used to a priori select the number of nodes to achieve a prescribed tolerance.","PeriodicalId":50536,"journal":{"name":"Electronic Transactions on Numerical Analysis","volume":"49 1","pages":"0"},"PeriodicalIF":0.8000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Gauss-Laguerre approach for the resolvent of fractional powers\",\"authors\":\"Eleonora Denich, Laura Grazia Dolce, Paolo Novati\",\"doi\":\"10.1553/etna_vol58s517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self-adjoint positive operators in Hilbert spaces. The method is based on the Gauss-Laguerre rule, exploiting a particular integral representation of the resolvent. We provide sharp error estimates that can be used to a priori select the number of nodes to achieve a prescribed tolerance.\",\"PeriodicalId\":50536,\"journal\":{\"name\":\"Electronic Transactions on Numerical Analysis\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Transactions on Numerical Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1553/etna_vol58s517\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Transactions on Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1553/etna_vol58s517","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
A Gauss-Laguerre approach for the resolvent of fractional powers
This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self-adjoint positive operators in Hilbert spaces. The method is based on the Gauss-Laguerre rule, exploiting a particular integral representation of the resolvent. We provide sharp error estimates that can be used to a priori select the number of nodes to achieve a prescribed tolerance.
期刊介绍:
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM).