Skip to main content
Log in

Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The polynomial interpolation problem with distinct interpolation points and the polynomial represented in the power basis gives rise to a linear system of equations with a Vandermonde matrix. This system can be solved efficiently by exploiting the structure of the Vandermonde matrix with the aid of the Björck–Peyrera algorithm. We are concerned with polynomial least-squares approximation at the zeros of Chebyshev polynomials. This gives rise to a rectangular Vandermonde matrix. We describe fast algorithms for the factorization of these matrices. Both QR and QR-like factorizations are discussed. The situations when the nodes are extreme points of Chebyshev polynomials or zeros of some classical orthogonal polynomial also are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bogaert, I.: Iteration-free computation of Gauss-Legendre quadrature nodes and weights. SIAM J. Sci. Comput. 36, A1008–A1026 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cody, W.J.: A survey of practical rational and polynomial approximation of functions. SIAM Rev. 12, 400–423 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eisinberg, A., Franzé, G., Salerno, N.: Rectangular Vandermonde matrices on Chebyshev nodes. Linear Algebra Appl. 338, 27–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gautschi, W.: Optimally scaled and optimally conditioned Vandermonde and Vandermonde-like matrices. BIT Numer. Math. 51, 103–125 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gautschi, W.: Norm estimates for inverses of Vandermonde matrices. Numer. Math. 23, 337–347 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gautschi, W.: The interplay between classical analysis and (numerical) linear algebra - a tribute to Gene H. Golub. Electron. Trans. Numer. Anal. 13, 119–147 (2002)

    MathSciNet  MATH  Google Scholar 

  7. Golub, G.H., Welsch, J.H.: Calculation of Gauss quadrature rules. Math. Comp. 23, 221–230 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  8. Laurie, D.P.: Computation of Gauss-type quadrature formulas. J. Comput. Appl. Math. 127, 201–217 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Li, R.C.: Vandermonde matrices with Chebyshev nodes. Linear Algebra Appl. 428, 1803–1832 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. CRC Press, Boca Raton (2003)

    MATH  Google Scholar 

  11. Szegő, G.: Orthogonal Polynomials, 4th ed. American Mathematical Society, Providence (1975)

    Google Scholar 

  12. Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)

    Book  MATH  Google Scholar 

Download references

Funding

This research was supported in part by NSF grants DMS-1729509 and DMS-1720259.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lothar Reichel.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kuian, M., Reichel, L. & Shiyanovskii, S.V. Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes. Numer Algor 81, 547–559 (2019). https://doi.org/10.1007/s11075-018-0560-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-018-0560-9

Keywords

Navigation