Skip to main content
SpringerLink
Log in

The block decomposition of a vandermonde matrix and its applications

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper presents a new algorithm for the solution of linear equations with a Vandermonde coefficient matrix. The algorithm can also be used to solve the dual problem. Since the algorithm uses a block decomposition of the matrix, it is especially suitable for parallel computation. A variation of the block decomposition leads to the efficient solution of the interpolation problem with complex-conjugate interpolation points where the coefficients of the interpolating polynomial are real. In addition the algorithm can be used to solve some kinds of confluent Vandermonde systems.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Å. Björck and V. Pereyra,Solution of Vandermonde systems of equations, Math. Comp. 24 (1970), 893–904.

    Google Scholar 

  2. Å. Björck and T. Elfving,Algorithms for confluent Vandermonde systems of equations, Numer. Math. 21 (1973), 130–137.

    Article  Google Scholar 

  3. G. Galimberti and V. Pereyra,Solving confluent Vandermonde systems of Hermite type, Numer. Math. 18 (1971), 44–60.

    Article  Google Scholar 

  4. W. Gautschi,On the inverse of Vandermonde and confluent Vandermonde matrix I, II, Numer. Math., v.4, 1962, pp. 117–123; ibid., v. 5, 1963, pp. 425–430.

    Article  Google Scholar 

  5. S. Å. Gustafson,Rapid computation of general interpolation formulae and mechanical quadrature rules, Comm. ACM, 14 (1971), 797–801.

    Article  Google Scholar 

  6. R. D. Skeel,Iterative refinement implies numerical stability for Gaussian elimination, Math. Comp. 34 (1980), 817–832.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, 94305, Stanford, California, USA

    W. P. Tang

Authors
  1. W. P. Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. H. Golub
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

W. P. Tang is a graduate student in the Computer Science Department at Stanford University, on leave from the Institute of Computing Technology of the Chinese Academy of Science in Peking.

The work of Professor Golub was in part supported by NSF Grant No. MCS78-11985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, W.P., Golub, G.H. The block decomposition of a vandermonde matrix and its applications. BIT 21, 505–517 (1981). https://doi.org/10.1007/BF01932847

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation