A fast algorithm for Gaussian type quadrature formulae with mixed boundary conditions and some lumped mass spectral approximations

After studying Gaussian type quadrature formulae with mixed boundary conditions, we suggest a fast algorithm for computing their nodes and weights. It is shown that the latter are computed in the same manner as in the theory of the classical Gauss quadrature formulae. In fact, all nodes and weights are again computed as eigenvalues and eigenvectors of a real symmetric tridiagonal matrix. Hence, we can adapt existing procedures for generating such quadrature formulae. Comparative results with various methods now in use are given. In the second part of this paper, new algorithms for spectral approximations for second-order elliptic problems are derived. The key to the efficiency of our algorithms is to find an appropriate spectral approximation by using the most accurate quadrature formula, which takes the boundary conditions into account in such a way that the resulting discrete system has a diagonal mass matrix. Hence, our algorithms can be used to introduce explicit resolutions for the time-dependent problems. This is the so-called lumped mass method. The performance of the approach is illustrated with several numerical examples in one and two space dimensions.

[1]  W. Gautschi.  A Survey of Gauss-Christoffel Quadrature Formulae , 1981 .

[2]  G. Szegő.  Zeros of orthogonal polynomials , 1939 .

[3]  Avraham A. Melkman,et al.  Interpolation by splines satisfying mixed boundary conditions , 1974 .

[4]  Walter Gautschi,et al.  Gauss-Radau and Gauss-Labatto quadratures with double end points , 1991 .

[5]  David S. Watkins,et al.  Some Perspectives on the Eigenvalue Problem , 1993, SIAM Rev..

[6]  G. Golub,et al.  Calculation of Gauss quadratures with multiple free and fixed knots , 1983 .

[7]  Erik A. van Doorn,et al.  Representations and bounds for zeros of Orthogonal polynomials and eigenvalues of sign-symmetric tri-diagonal matrices , 1987 .

[8]  George G. Lorentz,et al.  Birkhoff Interpolation: Introduction , 1984 .

[9]  D. Funaro.  Polynomial Approximation of Differential Equations , 1992 .

[10]  Yvon Maday,et al.  Some spectral approximations of two-dimensional fourth-order problems , 1989 .

[11]  T. J. Rivlin,et al.  Quadrature formulae and Hermite-Birkhoff interpolation , 1973 .

[12]  WALTER GAUTSCHI.  Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules , 1994, TOMS.

[13]  Charles A. Micchelli,et al.  Moment Theory for Weak Chebyshev Systems with Applications to Monosplines, Quadrature Formulae and Best One-Sided $L^1 $-Approximation by Spline Functions with Fixed Knots , 1977 .

[14]  Nira Dyn,et al.  Generalized Gaussian quadrature formulas , 1986 .

[15]  T. J. Rivlin.  Chebyshev polynomials : from approximation theory to algebra and number theory , 1990 .

[16]  Franz Peherstorfer.  Characterization of Quadrature Formula II , 1984 .

[17]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[18]  J. Z. Zhu,et al.  The finite element method , 1977 .

[19]  A note on positive quadrature rules , 1989 .

[20]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[21]  Q. I. Rahman,et al.  Quadrature Formulae and Polynomial Inequalities , 1997 .

[22]  T. J. Rivlin.  The Chebyshev polynomials , 1974 .

[23]  B. Bojanov,et al.  Comparison of Birkhoff type quadrature formulae , 1990 .

[24]  C. Canuto.  Spectral methods in fluid dynamics , 1991 .

[25]  K. Jetter.  A New Class of Gaussian Quadrature Formulas Based on Birkhoff Type Data , 1982 .

[26]  Franz Peherstorfer,et al.  Characterization of Positive Quadrature Formulas , 1981 .

[27]  W. J. Studden,et al.  Tchebycheff Systems: With Applications in Analysis and Statistics. , 1967 .

[28]  Yuan Xu.  Quasi-orthogonal Polynomials, Quadrature, and Interpolation , 1994 .

[29]  Numerical integration rules near gaussian quadrature , 1973 .

[30]  Petr Beckmann,et al.  Orthogonal polynomials for engineers and physicists , 1973 .