COMPUTATION OF GAUSS-TYPE QUADRATURE RULES∗

被引:2
作者
Borges, Carlos F. [1 ]
Reichel, Lothar [2 ]
机构
[1] Naval Postgrad Sch, Dept Math, Monterey, CA 93943 USA
[2] Kent State Univ, Dept Math Sci, Kent, OH 44242 USA
来源
ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS | 2024年 / 61卷
关键词
quadrature; Gauss rule; Gauss-Radau rule; Gauss-Lobatto rule; averaged Gauss rule; optimal averaged Gauss rule quadrature; divide-and-conquer method; Golub-Welsch algorithm; TIKHONOV REGULARIZATION; ALGORITHM; LEGENDRE; NODES;
D O I
10.1553/etna_vol61s121
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Many problems in scientific computing require the evaluation of Gauss quadrature rules. It is important to be able to estimate the quadrature error in these rules. Error estimates or error bounds often can be computed by evaluating an additional related Gauss-type formula such as a Gauss-Radau, Gauss-Lobatto, anti-Gauss, averaged Gauss, or optimal averaged Gauss rule. This paper presents software for both the evaluation of a single Gauss quadrature rule and the calculation of a pair of a Gauss rule and a related Gauss-type rule. The software is based on a divide-and-conquer method. This method is compared to both an available and a new implementation of the Golub-Welsch algorithm, which is the classical approach to evaluate a single Gauss quadrature rule. Timings on a laptop computer show the divide-and-conquer method to be competitive except for the computation of a single quadrature rule with very few nodes.
引用
收藏
页码:121 / 136
页数:16
相关论文
共 40 条
[1]   Simplified anti-Gauss quadrature rules with applications in linear algebra [J].
Alqahtani, Hessah ;
Reichel, Lothar .
NUMERICAL ALGORITHMS, 2018, 77 (02) :577-602
[2]  
Ammar GS., 1999, ELECTRON T NUMER ANA, V9, P26
[3]  
[Anonymous], 2021, PREPRINT
[4]   A global Lanczos method for image restoration [J].
Bentbib, A. H. ;
El Guide, M. ;
Jbilou, K. ;
Reichel, L. .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2016, 300 :233-244
[5]   ITERATION-FREE COMPUTATION OF GAUSS-LEGENDRE QUADRATURE NODES AND WEIGHTS [J].
Bogaert, I. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2014, 36 (03) :A1008-A1026
[6]   Algorithm 1014: An Improved Algorithm for hypot(x,y) [J].
Borges, Carlos F. .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2021, 47 (01)
[7]  
BORGES CF, 1993, NUMERICAL LINEAR ALGEBRA, P11
[8]   Tikhonov regularization of large linear problems [J].
Calvetti, D ;
Reichel, L .
BIT NUMERICAL MATHEMATICS, 2003, 43 (02) :263-283
[9]   Computation of Gauss-Kronrod quadrature rules [J].
Calvetti, D ;
Golub, GH ;
Gragg, WB ;
Reichel, L .
MATHEMATICS OF COMPUTATION, 2000, 69 (231) :1035-1052
[10]  
Calvetti D, 1999, INT S NUM M, V131, P41