分数次幂解的高斯-拉盖尔方法

IF 0.8 4区数学 Q3 MATHEMATICS, APPLIED

Electronic Transactions on Numerical Analysis Pub Date : 2023-01-01 DOI:10.1553/etna_vol58s517

Eleonora Denich, Laura Grazia Dolce, Paolo Novati

{"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":null,"pages":null},"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\":null,\"pages\":null},\"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}

引用次数: 0

摘要

本文介绍了一种计算算子分数次幂解的快速方法。该分析是在Hilbert空间中(可能无界的)自伴随正算子的连续集合中进行的。该方法是基于高斯-拉盖尔规则，利用特定的积分表示的解决方案。我们提供了精确的误差估计，可用于先验地选择节点数量以达到规定的公差。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 数学-应用数学

CiteScore

2.10

自引率

7.70%

发文量

审稿时长

6 months

期刊介绍： 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).