Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab

@article{Meurant2013FastVO,
  title={Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab},
  author={G{\'e}rard Meurant and Alvise Sommariva},
  journal={Numerical Algorithms},
  year={2013},
  volume={67},
  pages={491-506}
}
In this paper, we investigate variants of the well-known Golub and Welsch algorithm for computing nodes and weights of Gaussian quadrature rules for symmetric weights w in intervals (−a, a) (not necessarily bounded). The purpose is to reduce the complexity of the Jacobi eigenvalue problem stemming from Wilf’s theorem and show the effectiveness of Matlab implementations of our variants for reducing the computer times compared to some other methods. Numerical examples on three test problems show… 

Construction of Gaussian quadrature formulas for even weight functions

Instead of a quadrature rule of Gaussian type with respect to an even weight function on (−a, a) with n nodes, we construct the corresponding Gaussian formula on (0, a) with only [(n+1)/2] nodes.

Computing Gaussian quadrature rules with high relative accuracy

It is shown that the nodes and the weights of the Gaussian quadrature rule can be retrieved from the singular value decomposition of a bidiagonal matrix of size n/2.

Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems

Product Gaussian quadrature on circular lunes

Resorting to recent results on subperiodic trigonometric quadrature, we provide three product Gaussian quadrature formulas exact on algebraic polynomials of degree n on circular lunes. The first

Semidefinite Approximations of the Matrix Logarithm

This paper shows how to approximate the matrix logarithm with functions that preserve operator concavity and can be described using the feasible regions of semidefinite optimization problems of fairly small size, which will allow us to use off-the-shelf semideFinite optimization solvers for convex optimization problems involving the matrixlogarithms and related functions.

Polynomial approximation and quadrature on geographic rectangles

AN EFFICIENT COMPUTATION OF PARAMETERS IN THE RYS QUADRATURE FORMULA

AMS Mathematics Subject Classification (2000): 41A55, 65D30, 65D32, 33C45.

References

SHOWING 1-10 OF 45 REFERENCES

NOTE ON A CONSTRUCTION OF WEIGHTS IN GAUSS-TYPE QUADRATURE RULE

The accuracy of a standard numerical construction of Gaussian quadrature rule is analyzed and examples when such a construction gives inaccurate results for constructed weights are given.

Chebfun and numerical quadrature

Chebfun is a Matlab-based software system that overloads Matlab’s discrete operations for vectors and matrices to analogous continuous operations for functions and operators. We begin by describing

THE INTERPLAY BETWEEN CLASSICAL ANALYSIS AND (NUMERICAL) LINEAR ALGEBRA — A TRIBUTE TO GENE H. GOLUB

Much of the work of Golub and his collaborators uses techniques of linear algebra to deal with problems in analysis, or employs tools from analysis to solve problems arising in linear algebra.

A Fast Algorithm for the Calculation of the Roots of Special Functions

We describe a procedure for the determination of the roots of functions satisfying second-order ordinary differential equations, including the classical special functions. The scheme is based on a

Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules

A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The

Fast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights

An efficient algorithm for the accurate computation of Gauss--Legendre and Gauss--Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton's root-finding method with initial

Matrices, Moments and Quadrature with Applications

This computationally oriented book describes and explains the mathematical relationships among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and conjugate gradient

Milestones in Matrix Computation - Selected Works of Gene H. Golub, with Commentaries

Numerical methods for solving linear least squares problems Singular value decomposition and least squares solutions, and the differentiation of pseudo-inverses and non-linear least square problems whose variables separate.

O(1) Computation of Legendre Polynomials and Gauss-Legendre Nodes and Weights for Parallel Computing

A self-contained set of algorithms is proposed for the fast evaluation of Legendre polynomials of arbitrary degree and argument and immediately yields an $\mathcal{O}(1)$ algorithm for computing an arbitrary Gauss--Legendre quadrature node.

Interpolation Processes: Basic Theory and Applications

The classical books on interpolation address numerous negative results, i.e., results on divergent interpolation processes, usually constructed over some equidistant systems of nodes. The authors