Skip to main content

On the Computation of the Determinant of a Generalized Vandermonde Matrix

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8660))

Included in the following conference series:

Abstract

“Vandermonde” matrix is a matrix whose (i,j)th entry is in the form of \(x_i^j\). The matrix has a lot of applications in many fields such as signal processing and polynomial interpolations. This paper generalizes the matrix, and let its (i,j) entry be f j (x i ) where f j (x) is a polynomial of x. We present an efficient algorithm to compute the determinant of the generalized Vandermonde matrix. The algorithm is composed of two sub-algorithms: the one that depends on given polynomials f j (x) and the one that does not. The latter algorithm (the one does not depend on f j (x)) can be performed beforehand, and the former (the one that depends on f j (x)) is mainly composed of the computation of determinants of numerical matrices. Determinants of the generalized Vandermonde matrices can be used, for example, to compute the optimal H  ∞  and H 2 norm of a system achievable by a static feedback controller (for details, see [18],[19]).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Golub, G.H., Loan, C.F.V.: Matrix Computations. Johns Hopkins Univ. Johns Hopkins Univ. Press (1986)

    Google Scholar 

  2. Hoffman, K.M., Kunze, R.: Linear Algebra, 2nd edn. Prentice Hall, Englewood Cliffs (1971)

    MATH  Google Scholar 

  3. Vinberg, E.B.: Frobenius formula. Encyclopaedia of Mathematics (2014), http://eom.springer.de/f/f041780.htm (accessed April 12, 2014)

  4. Rowland, T.: Generalized vandermonde matrix. Wolfram MathWorld, http://mathworld.wolfram.com/GeneralizedVandermondeMatrix.html (accessed April 12, 2014)

  5. Kalman, D.: The generalized Vandermonde matrix. Mathematics Magazine 57(1), 15–21 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gohberg, I., Kaashoek, M.A., Lerer, L., Rodman, L.: Common multiples and common divisors of matrix polynomials, II. Vandermonde and resultant matrices. Linear and Multilinear Algebra 12(3), 159–203 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kaltofen, E., Villard, G.: On the complexity of computing determinants. In: Proc. of Fifth Asian Symposium on Computer Mathematics, ASCM 2001, Matsuyama, Japan, pp. 13–27 (2001)

    Google Scholar 

  8. Kaltofen, E., Villard, G.: On the complexity of computing determinants. Computational Complexity 30(3-4), 91–130 (2004)

    MathSciNet  Google Scholar 

  9. Krattenthaler, C.: Advanced determinant calculus, Séminaire Lotharingien Combin. 42, B42q (1999)

    Google Scholar 

  10. Krattenthaler, C.: Advanced determinant calculus: a complement. Linear Algebra Appl. 411, 68–166 (2005)

    Google Scholar 

  11. Gentleman, W.M., Johnson, S.C.: Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries. Journal ACM Transactions on Mathematical Software 2(3), 232–241 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  12. Horrowitz, E., Sahni, S.: On Computing the Exact Determinant of Matrices with Polynomial Entries. Journal of the ACM 22(1), 33–50 (1975)

    Article  Google Scholar 

  13. Sasaki, T., Murao, H.: Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems. Journal ACM Transactions on Mathematical Software 8(3), 277–289 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  14. Michael, T.: McClellan. A Comparison of Algorithms for the Exact Solution of Linear Equations. Journal ACM Transactions on Mathematical Software 3(2), 147–158 (1977)

    Article  MATH  Google Scholar 

  15. Martin, L.: Griss. An efficient sparse minor expansion algorithm. In: Proc. of ACM 1976, pp. 429–434 (1976)

    Google Scholar 

  16. Marco, A., Martinez, J.: Parallel computation of determinants of matrices with polynomial entries. Journal of Symbolic Computation 37(6), 749–760 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Timothy, S., Freeman, G.M.: Imirzian, Erich Kaltofen and Lakshman Yagati. Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Transactions on Mathematical Software 14(3), 218–240 (1988)

    Article  MATH  Google Scholar 

  18. Kitamoto, T., Yamaguchi, T.: The optimal H  ∞  norm of a parametric system achievable using a static feedback controller. The IEICE Trans. Funda. E90-A(11), 2496–2509 (2007)

    Google Scholar 

  19. Kitamoto, T., Yamaguchi, T.: On the parametric LQ control problem. The IEICE Trans. Funda. J91-A(3), 349–359 (2008)

    Google Scholar 

  20. Neagoe, V.: Inversion of the van der monde matrix. IEEE Signal Processing Letters 3(4), 119–120 (1996)

    Article  Google Scholar 

  21. MATHEMATICA TUTORIAL, Some Notes on Internal Implementation, Exact Numerical Linear Algebra, http://reference.wolfram.com/mathematica/tutorial/SomeNotesOnInternalImplementation.en.html (accessed May 31, 2014)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kitamoto, T. (2014). On the Computation of the Determinant of a Generalized Vandermonde Matrix. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2014. Lecture Notes in Computer Science, vol 8660. Springer, Cham. https://doi.org/10.1007/978-3-319-10515-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10515-4_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10514-7

  • Online ISBN: 978-3-319-10515-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics