{"title":"高斯正交规则的计算","authors":"G. Golub, John H. Welsch","doi":"10.1090/S0025-5718-69-99647-1","DOIUrl":null,"url":null,"abstract":"Most numerical integration techniques consist of approximating the integrand by a polynomial in a region or regions and then integrating the polynomial exactly. Often a complicated integrand can be factored into a non-negative ''weight'' function and another function better approximated by a polynomial, thus $\\int_{a}^{b} g(t)dt = \\int_{a}^{b} \\omega (t)f(t)dt \\approx \\sum_{i=1}^{N} w_i f(t_i)$. Hopefully, the quadrature rule ${\\{w_j, t_j\\}}_{j=1}^{N}$ corresponding to the weight function $\\omega$(t) is available in tabulated form, but more likely it is not. We present here two algorithms for generating the Gaussian quadrature rule defined by the weight function when: a) the three term recurrence relation is known for the orthogonal polynomials generated by $\\omega$(t), and b) the moments of the weight function are known or can be calculated.","PeriodicalId":250823,"journal":{"name":"Milestones in Matrix Computation","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1967-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1203","resultStr":"{\"title\":\"Calculation of Gauss quadrature rules\",\"authors\":\"G. Golub, John H. Welsch\",\"doi\":\"10.1090/S0025-5718-69-99647-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most numerical integration techniques consist of approximating the integrand by a polynomial in a region or regions and then integrating the polynomial exactly. Often a complicated integrand can be factored into a non-negative ''weight'' function and another function better approximated by a polynomial, thus $\\\\int_{a}^{b} g(t)dt = \\\\int_{a}^{b} \\\\omega (t)f(t)dt \\\\approx \\\\sum_{i=1}^{N} w_i f(t_i)$. Hopefully, the quadrature rule ${\\\\{w_j, t_j\\\\}}_{j=1}^{N}$ corresponding to the weight function $\\\\omega$(t) is available in tabulated form, but more likely it is not. We present here two algorithms for generating the Gaussian quadrature rule defined by the weight function when: a) the three term recurrence relation is known for the orthogonal polynomials generated by $\\\\omega$(t), and b) the moments of the weight function are known or can be calculated.\",\"PeriodicalId\":250823,\"journal\":{\"name\":\"Milestones in Matrix Computation\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1967-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1203\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Milestones in Matrix Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/S0025-5718-69-99647-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Milestones in Matrix Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/S0025-5718-69-99647-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Most numerical integration techniques consist of approximating the integrand by a polynomial in a region or regions and then integrating the polynomial exactly. Often a complicated integrand can be factored into a non-negative ''weight'' function and another function better approximated by a polynomial, thus $\int_{a}^{b} g(t)dt = \int_{a}^{b} \omega (t)f(t)dt \approx \sum_{i=1}^{N} w_i f(t_i)$. Hopefully, the quadrature rule ${\{w_j, t_j\}}_{j=1}^{N}$ corresponding to the weight function $\omega$(t) is available in tabulated form, but more likely it is not. We present here two algorithms for generating the Gaussian quadrature rule defined by the weight function when: a) the three term recurrence relation is known for the orthogonal polynomials generated by $\omega$(t), and b) the moments of the weight function are known or can be calculated.