Skip to main content
Log in

Complexity reduction of least squares problems involving special vandermonde matrices

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

This paper presents a new QRD factorization of a rectangular Vandermonde matrix for a special point distribution, including the symmetric case, based on ak-dimensional block decomposition of the matrix and some properties of the Kronecker product. The computational reduction factor with respect to any QR method isk 2, in the general case, and 4 in the symmetric one. By the resulting matrix factorization, new formulas are devised for the least squares system solution, whose implementation produces an algorithm of reduced computational cost and computer storage. Finally the perturbation bounds of this new factorization are devised.

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. J. G. Clunie and J. C. Mason, Norms of analytic interpolation projections on general domains, J. Approx. Theory 41 (1984) 149–158.

    Article  Google Scholar 

  2. C. J. Demeure, Fast QR factorization of Vandermonde matrices, Linear Algebra Appl. 122/123/124 (1989) 165–194.

    Article  Google Scholar 

  3. L. Jòdar and H. Abou-Kandil, Kronecker products and coupled matrix Riccati differential systems, Linear Algebra Appl. 121 (1989) 39–51.

    Article  Google Scholar 

  4. L. Reichel, Fast QR decomposition of Vandermonde-like matrices and polynomial least squares approximation, SIAM J. Matrix Anal. Appl. 12 (1991) 552–564.

    Article  Google Scholar 

  5. L. Reichel, G. S. Ammar and W. B. Gragg, Discrete least squares approximation by trigonometric polynomials, Math. Comp. 57(195) (1991) 273–289.

    Google Scholar 

  6. J.-G. Sun, Perturbation bounds for the Cholesky and QR factorizations, BIT 31 (1991) 341–352.

    Article  Google Scholar 

  7. W. P. Tang and G. H. Golub, The block decomposition of a Vandermonde matrix and its applications, BIT 21 (1981) 505–517.

    Article  Google Scholar 

  8. T. Tommasini, A new algorithm for special Vandermonde systems, Numer. Algorithms 2 (1992) 299–306.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by L. Reichel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tommasini, T. Complexity reduction of least squares problems involving special vandermonde matrices. Adv Comput Math 6, 77–86 (1996). https://doi.org/10.1007/BF02127697

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02127697

AMS subject classification

Navigation