Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be generally faster than previous methods and without practical restrictions on the range of the parameters. The evaluation of the nodes and weights of the quadrature is exclusively based on convergent processes which, together with the fourth order convergence of the fixed point method for computing the nodes, makes this an ideal approach for high accuracy computations, so much so that computations of quadrature rules with even millions of nodes and thousands of digits are possible in a typical laptop.
A theory of spline quadrature rules for arbitrary continuity class in a closed interval $[a, b]$ with arbitrary nonuniform subintervals based on semi-classical orthogonal Jacobi polynomials is proposed. For continuity class $c \ge 2$ this theory depends on a conjecture.
An error estimate for the Gauss-Lobatto quadrature formula for integration over the interval $[-1, 1]$, relative to the Jacobi weight function $w^{α,β}(t)=(1-t)^α(1+t)^β$, $α,β>-1$, is obtained. This estimate holds true for functions belonging to some Sobolev-type subspaces of the weighted space $L_{w^{α,β}}^1([-1,1])$.
We consider the numerical integration $${\rm INT}_d(f)=\int_{\mathbb{B}^{d}}f(x)w_μ(x)dx $$ for the weighted Sobolev classes $BW^{r}_{p,μ}$ and the weighted Besov classes $BB_τ^r(L_{p,μ})$ in the randomized case setting, where $w_μ, \,μ\ge0,$ is the classical Jacobi weight on the ball $\Bbb B^d$, $1\le p\le \infty$, $r>(d+2μ)/p$, and $0<τ\le\infty$. For the above two classes, we obtain the orders of the optimal quadrature errors in the randomized case setting are $n^{-r/d-1/2+(1/p-1/2)_+}$. Compared to the orders $n^{-r/d}$ of the optimal quadrature errors in the deterministic case setting, ra…
On Fast Implementation of Clenshaw-Curtis and Fejér-type Quadrature Rules
School of Mathematics and Statistics, Central South University（中南大学数学与统计学院）；School of Mathematics and Statistics, Huazhong University of Science and Technology（华中科技大学数学与统计学院）
Complex generalized Gauss-Radau quadrature rules for Hankel transforms of integer order
School of Mathematics and Statistics, Huazhong University of Science and Technology（华中科技大学数学与统计学院）；Hubei Key Laboratory of Engineering Modeling and Scientific Computing, Huazhong University of Science and Technology（华中科技大学工程建模与科学计算湖北省重点实验室）
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and they are fast due to their fourth-order convergence and its asymptotic exactness for an appropriate selection of the variables. For Gauss--Hermite and Gauss--Laguerre quadratures, local Taylor series can be used for computing efficiently the orthogonal polynomials involved, with exact initial values for the Hermite case and first values computed with a conti…
The concept of Gauss quadrature can be generalized to approximate linear functionals with complex moments. Following the existing literature, this survey will revisit such generalization. It is well known that the (classical) Gauss quadrature for positive definite linear functionals is connected with orthogonal polynomials, and with the (Hermitian) Lanczos algorithm. Analogously, the Gauss quadrature for linear functionals is connected with formal orthogonal polynomials, and with the non-Hermitian Lanczos algorithm with look-ahead strategy; moreover, it is related to the minimal partial realiz…
The sub-optimality of Gauss--Hermite quadrature and the optimality of the trapezoidal rule are proved in the weighted Sobolev spaces of square integrable functions of order $α$, where the optimality is in the sense of worst-case error. For Gauss--Hermite quadrature, we obtain matching lower and upper bounds, which turn out to be merely of the order $n^{-α/2}$ with $n$ function evaluations, although the optimal rate for the best possible linear quadrature is known to be $n^{-α}$. Our proof of the lower bound exploits the structure of the Gauss--Hermite nodes; the bound is independent of the qua…
We study Gauss quadrature for Freud weights and derive worst case error estimates for functions in a family of associated Sobolev spaces. For the Gaussian weight $e^{-πx^2}$ these spaces coincide with a class of modulation spaces which are well-known in (time-frequency) analysis and also appear under the name of Hermite spaces. Extensions are given to more general sets of nodes that are derived from Marcinkiewicz-Zygmund inequalities. This generalization can be interpreted as a stability result for Gauss quadrature.
We consider polynomial approximation over the interval $[-1,1]$ by regularized weighted discrete least squares methods with $\ell_2-$ or $\ell_1-$regularization, respectively. As the set of nodes we use Gauss quadrature points (which are zeros of orthogonal polynomials). The number of Gauss quadrature points is $N+1$. For $2L\leq2N+1$, with the aid of Gauss quadrature, we obtain approximation polynomials of degree $L$ in closed form without solving linear algebra or optimization problems. In fact, these approximation polynomials can be expressed in the form of the barycentric interpolation for…
The standard design principle for quadrature formulas is that they should be exact for integrands of a given class, such as polynomials of a fixed degree. We show how this principle fails to predict the actual behavior in four cases: Newton-Cotes, Clenshaw-Curtis, Gauss-Legendre, and Gauss-Hermite quadrature. Three further examples are mentioned more briefly.
We propose a spectral collocation method, based on the generalized Jacobi wavelets along with the Gauss-Jacobi quadrature formula, for solving a class of third-kind Volterra integral equations. To do this, the interval of integration is first transformed into the interval [-1,1], by considering a suitable change of variable. Then, by introducing special Jacobi parameters, the integral part is approximated using the Gauss-Jacobi quadrature rule. An approximation of the unknown function is considered in terms of Jacobi wavelets functions with unknown coefficients, which must be determined. By su…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian quadrature rules for three general classes of positive weight functions: analytic functions on a bounded interval with algebraic singularities at the endpoints, analytic weight functions on the halfline with exponential decay at infinity and an algebraic singularity at the finite endpoint, and analytic functions on the real line with exponential decay in both d…
An error analysis of Runge-Kutta convolution quadrature based on Gauss methods applied to hyperbolic operators is given. The order of convergence relies heavily on the parity of the number of stages, a more favourable situation arising for the odd cases than the even ones. Moreover, for particular situations the order of convergence is higher than for Radau IIA or Lobatto IIIC methods when using the same number of stages. We further investigate an application to transient acoustic scattering where, for certain scattering obstacles, the favourable situation occurs in the important case of the e…
On the error bounds of the Gauss-type quadrature formulae associated with spaces of parabolic and cubic spline functions with double equidistant knots
Faculty of Mathematics and Informatics, Sofia University ”St. Kliment Ohridski”（索非亚大学圣克利门特奥赫里斯基数学与信息学院）；Faculty of Pharmacy, Medical University of Sofia（索非亚医科大学药学院）
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1, 1}$, i.e. even and odd degree are presented. Also rules for the 2 missing spline classes $S_{2N-1, 0}$ and $S_{2N, 1}$ (the so called 1/2-rules), i.e. odd and even degree are presented. These quadrature rules are explicit in the sense, that they compute the nodes and their weights in the first/last boundary subinterval and, via a recursion the other nodes/weigh…
Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions
University of Tromsø（特罗姆瑟大学）；Universität Konstanz（康斯坦茨大学）
Generalized eigenvalue methods for Gaussian quadrature rules
Georgia Institute of Technology（佐治亚理工学院）；Technische Universität Berlin（柏林工业大学）；Uit – The Arctic University of Norway（挪威北极大学）；Universität Konstanz（康斯坦茨大学）；North Carolina State University（北卡罗来纳州立大学）
This paper is concerned with the introduction of Tikhonov regularization into least squares approximation scheme on $[-1,1]$ by orthonormal polynomials, in order to handle noisy data. This scheme includes interpolation and hyperinterpolation as special cases. With Gauss quadrature points employed as nodes, coefficients of the approximation polynomial with respect to given basis are derived in an entry-wise closed form. Under interpolatory conditions, the solution to the regularized approximation problem is rewritten in forms of two kinds of barycentric interpolation formulae, by introducing on…
This paper considers efficient spectral solutions for weakly singular nonlocal diffusion equations with Dirichlet-type volume constraints. The equation we consider contains an integral operator that typically has a singularity at the midpoint of the integral domain, and the approximation of the integral operator is one of the essential difficulties in solving nonlocal equations. To overcome this problem, two-sided Jacobi spectral quadrature rules are proposed to develop a Jacobi spectral collocation method for nonlocal diffusion equations. A rigorous convergence analysis of the proposed method…
