Computation of Gauss-type quadrature formulas with some preassigned nodes

• A. Bultheel ^[2] ; R. Cruz-Barroso ^[1] ; P. González-Vera ^[1] ; F. Perdomo-Pío ^[1]
  1. [1] Universidad de La Laguna

     Universidad de La Laguna

     San Cristóbal de La Laguna, España

     
  2. [2] K.U.Leuven
• Localización: Jaen journal on approximation, ISSN 1889-3066, ISSN-e 1989-7251, Vol. 2, Nº. 2, 2010, págs. 163-191
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • When dealing with the approximate calculation of weighted integrals over a finite interval [a, b], Gauss-type quadrature rules with one or two prescribed nodes at the end points {a, b} are well known and commonly referred as Gauss-Radau and Gauss-Lobatto formulas respectively. In this regard, efficient algorithms involving the solution of an eigenvalue problem for certain tri-diagonal (Jacobi) matrices are available for their computation. In this work a further step will be given by adding to the above quadratures an extra fixed node in (a, b) and providing similar efficient algorithms for their computation. This will be done by passing to the unit circle and taking advantage of the so-called Szeg˝o-Lobatto quadrature rules recently introduced in [27] and [6].