{"title":"关于被积函数外零的高斯型正交规则","authors":"Jelena Tomanović","doi":"10.1553/etna_vol59s230","DOIUrl":null,"url":null,"abstract":"In the present paper, we propose a Gauss-type quadrature rule into which the external zeros of the integrand (the zeros of the integrand outside the integration interval) are incorporated. This new formula with $n$ nodes, denoted by $\\mathcal G_n$, proves to be exact for certain polynomials of degree greater than $2n-1$ (while the Gauss quadrature formula with the same number of nodes is exact for all polynomials of degree less than or equal to $2n-1$). It turns out that $\\mathcal G_n$ has several good properties: all its nodes are pairwise distinct and belong to the interior of the integration interval, all its weights are positive, it converges, and it is applicable both when the external zeros of the integrand are known exactly and when they are known approximately. In order to economically estimate the error of $\\mathcal G_n$, we construct its extensions that inherit the $n$ nodes of $\\mathcal G_n$ and that are analogous to the Gauss-Kronrod, averaged Gauss, and generalized averaged Gauss quadrature rules. Further, we show that $\\mathcal G_n$ with respect to the pairwise distinct external zeros of the integrand represents a special case of the (slightly modified) Gauss quadrature formula with preassigned nodes. The accuracy of $\\mathcal G_n$ and its extensions is confirmed by numerical experiments.","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\":\"Gauss-type quadrature rules with respect to external zeros of the integrand\",\"authors\":\"Jelena Tomanović\",\"doi\":\"10.1553/etna_vol59s230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present paper, we propose a Gauss-type quadrature rule into which the external zeros of the integrand (the zeros of the integrand outside the integration interval) are incorporated. This new formula with $n$ nodes, denoted by $\\\\mathcal G_n$, proves to be exact for certain polynomials of degree greater than $2n-1$ (while the Gauss quadrature formula with the same number of nodes is exact for all polynomials of degree less than or equal to $2n-1$). It turns out that $\\\\mathcal G_n$ has several good properties: all its nodes are pairwise distinct and belong to the interior of the integration interval, all its weights are positive, it converges, and it is applicable both when the external zeros of the integrand are known exactly and when they are known approximately. In order to economically estimate the error of $\\\\mathcal G_n$, we construct its extensions that inherit the $n$ nodes of $\\\\mathcal G_n$ and that are analogous to the Gauss-Kronrod, averaged Gauss, and generalized averaged Gauss quadrature rules. Further, we show that $\\\\mathcal G_n$ with respect to the pairwise distinct external zeros of the integrand represents a special case of the (slightly modified) Gauss quadrature formula with preassigned nodes. The accuracy of $\\\\mathcal G_n$ and its extensions is confirmed by numerical experiments.\",\"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_vol59s230\",\"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_vol59s230","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Gauss-type quadrature rules with respect to external zeros of the integrand
In the present paper, we propose a Gauss-type quadrature rule into which the external zeros of the integrand (the zeros of the integrand outside the integration interval) are incorporated. This new formula with $n$ nodes, denoted by $\mathcal G_n$, proves to be exact for certain polynomials of degree greater than $2n-1$ (while the Gauss quadrature formula with the same number of nodes is exact for all polynomials of degree less than or equal to $2n-1$). It turns out that $\mathcal G_n$ has several good properties: all its nodes are pairwise distinct and belong to the interior of the integration interval, all its weights are positive, it converges, and it is applicable both when the external zeros of the integrand are known exactly and when they are known approximately. In order to economically estimate the error of $\mathcal G_n$, we construct its extensions that inherit the $n$ nodes of $\mathcal G_n$ and that are analogous to the Gauss-Kronrod, averaged Gauss, and generalized averaged Gauss quadrature rules. Further, we show that $\mathcal G_n$ with respect to the pairwise distinct external zeros of the integrand represents a special case of the (slightly modified) Gauss quadrature formula with preassigned nodes. The accuracy of $\mathcal G_n$ and its extensions is confirmed by numerical experiments.
期刊介绍:
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).