Grigoriy Blekherman, Mario Kummer, C. Riener, M. Schweighofer, C. Vinzant
{"title":"高斯正交规则的广义特征值方法","authors":"Grigoriy Blekherman, Mario Kummer, C. Riener, M. Schweighofer, C. Vinzant","doi":"10.5802/ahl.62","DOIUrl":null,"url":null,"abstract":"A quadrature rule of a measure $\\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\\mu$ for all polynomials up to some fixed degree. In this paper, we present a bivariate polynomial whose roots parametrize the nodes of minimal quadrature rules for measures on the real line. We give two symmetric determinantal formulas for this polynomial, which translate the problem of finding the nodes to solving a generalized eigenvalue problem.","PeriodicalId":192307,"journal":{"name":"Annales Henri Lebesgue","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized eigenvalue methods for Gaussian quadrature rules\",\"authors\":\"Grigoriy Blekherman, Mario Kummer, C. Riener, M. Schweighofer, C. Vinzant\",\"doi\":\"10.5802/ahl.62\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A quadrature rule of a measure $\\\\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\\\\mu$ for all polynomials up to some fixed degree. In this paper, we present a bivariate polynomial whose roots parametrize the nodes of minimal quadrature rules for measures on the real line. We give two symmetric determinantal formulas for this polynomial, which translate the problem of finding the nodes to solving a generalized eigenvalue problem.\",\"PeriodicalId\":192307,\"journal\":{\"name\":\"Annales Henri Lebesgue\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Henri Lebesgue\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5802/ahl.62\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Henri Lebesgue","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5802/ahl.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized eigenvalue methods for Gaussian quadrature rules
A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this paper, we present a bivariate polynomial whose roots parametrize the nodes of minimal quadrature rules for measures on the real line. We give two symmetric determinantal formulas for this polynomial, which translate the problem of finding the nodes to solving a generalized eigenvalue problem.