Research Article | Open Access
A New Derivation and Recursive Algorithm Based on Wronskian Matrix for Vandermonde Inverse Matrix
For an analytical expression of Vandermonde inverse matrix, a new derivation process based on Wronskian matrix and Lagrange interpolation polynomial basis is presented. Recursive formula and implementation cases for the direct formula of Vandermonde inverse matrix are given based on deriving the unified formula of Wronskian inverse matrix. For the calculation of symbol-type Vandermonde inverse matrix, the direct formula and recursive method are verified to be more efficient than Mathematica which is good at symbolic computation by comparing the computing time in Mathematica. The process and steps of recursive algorithm are relatively simple. The derivation process and idea both have very important values in theory and practice of Vandermonde and generalized Vandermonde inverse matrix.
Vandermonde matrix and generalized Vandermonde matrix and their inverses are always widely concerned in many research fields, such as numerical analysis, data and signal processing, and control theory [1–8]. There are many effective ways to calculate the Vandermonde inverse matrix. Fox example, Tou  and Reis  obtained the matrix formula from the coefficients of polynomial terms. Neagoe  deduced an analytic formula of complex-type Vandermonde inverse matrix based on symmetric polynomials. Eisinberg and Fedele  presented a general explicit formula for the elements of inverse matrix and two different algorithms were deduced. In this paper, based on results in [1, 2], a new derivation process of an analytical expression of Vandermonde inverse matrix is presented based on Wronskian matrix and Lagrange interpolation polynomial basis, and recursive formula and implementation cases for the direct formula of Vandermonde inverse matrix are presented based on deducing the unified formula of Wronskian inverse matrix.
The rest of this paper is arranged as follows. Firstly, we summarize the main idea and analytical formulas presented in  and give a new derivation process for the formula in Section 2. In Section 3, a recursive formula of Vandermonde inverse matrix is deduced. In Section 4, numerical simulations are presented with some cases in Mathematica and conclusion and prospect are given by comparing and analyzing the numerical results in the last section.
2. A New Derivation of Vandermonde Inverse Matrix
If are different numbers, that is to say, they are not equal to each other, then we define the -order matrixwhere as a Vandermonde matrix. For the inverse of this matrix, Neagoe  obtained the calculation formula (2) according to relations between the determinant of the matrix (1) and the determinant of the matrix which was obtained by adding a row whose elements were and a column whose elements were to (1) and based on the calculation formula of inverse matrix by using the matrix determinant:where are column subscripts and are row subscripts and
For a group of linearly independent functions , where has the ()th derivative, Wronskian matrix is defined asIf there is another group of functions which satisfythen the inverse matrix of (4) can be obtained  aswhere and .
If we set , then we can verify that the Lagrange interpolation polynomial basiswhere satisfy (5); that is to say,For Wronskian matrix ,From (6), the inverse matrix of iswhere are row subscripts and are column subscripts in the above two matrices.
Let ; then (12) changes toIts inverse matrix isFor the values of in (2), we specify them by the following case. For example, taking , from (3), we can getThen we havewhere are row subscripts and are column subscripts, and from (17) and (19), we can getThus, according to the corresponding relations of elements between and and and , we can obtain (2); that is, where are row subscripts and are column subscripts.
3. Recursive Algorithm of Vandermonde Inverse Matrix
By the above method of function matrix, we denote asAccording to the property of Vandermonde determinant, we have
For the convenience of description, we introduce the following notations.
denotes the algebraic complement of the element of whose row subscript is and column subscript is . denotes th derivative on of and
Let in (32); the recursion formula of elements of Vandermonde inverse matrix can be obtained.
For simplicity, denote . Because , all elements do not contain , so we denote -order Vandermonde matrix composed of asThus, each element of Vandermonde inverse matrix can be determined by the following recursive formula:where and set when , , , , and
When , and .
When , .
4. Application Case and Simulation
We will take the 3-order Vandermonde inverse matrix as an example to illustrate the recursive steps of (34) in detail.
LetFrom (34), we have
Taking and as the initial values to calculate each element of , then we can getSince , thenFrom (34) again, we can getSince , thenSubstituting to (40), we haveAs in , so from (36), this leads toMeanwhile, we can also obtain
The other elements of , , , can be obtained by a similar process. Finally, we can getMeanwhile, we can getSo, the 3-order Vandermonde inverse matrix of (35) isand the 2-order Vandermonde inverse matrix is
We choose different order Vandermonde matrices to compare the computing time spent on calculating their inverse matrices in mathematical software Mathematica 10. We divide the calculations into two types: symbolic inverse matrix and numerical inverse matrix. For the limitation of computing time, we take only the order as and the total time of each calculation is the time spent by doing 100 repeated calculations; its unit is second. When we calculate the numerical Vandermonde inverse matrix, we take . We obtain the results as Tables 1 and 2.
In Tables 1 and 2, is the order of Vandermonde inverse matrix. MMA denotes the time which Mathematica spends on calculation by using its inner function “Inverse” to calculate the inverse matrix. Equations (2) and (34) denote the times which Mathematica spends on calculations by (2) and (34) separately.
Remark 1. Here we only take Mathematica as the execution environment, mainly because Mathematica has the superiority of symbolic computation compared with other types of commonly used mathematical software. For example, when we calculate the 6-order symbolic Vandermonde inverse matrix by the inner functions of Mathematica, Maple, and MATLAB, the computing times are 0.187, 0.281, and 22.013 seconds separately.
5. Conclusion and Prospect
From Table 1, we can see that the total time spent by Mathematica on calculating the symbolic Vandermonde inverse matrix by using inner function “Inverse” is far more than that by (2) and (34). With the increase of dimensions, the time grows dramatically. For the 10-order matrix, it almost spends nearly 7 hours. From Table 2, we can see that the total time spent by Mathematica (0 in Table 2 means that the total time is less than 0.001 seconds) on calculating the numerical Vandermonde inverse matrix by using inner function “Inverse” is far less than that by (2) and (34). For numerical inverse matrix, Mathematica’s inner function has greater advantage than (2) and (34), and the time spent by (2) is less than that by (34). This is because our algorithms are not optimized in terms of numerical calculation. We do these calculations only by a few functions written by us in Mathematica. Therefore, the total computing times are much more. But for symbolic inverse matrix, (2) and (34) are better than Mathematica inner function.
In this paper we use the different methods from [2–5] to deduce (2) based on Wronskian function matrix and propose a recursive algorithm for Vandermonde inverse matrix. The process has a certain universality and some values for calculating inverse matrices of other special matrices. From Tables 1 and 2, we can see that two methods in this paper are more efficient than Mathematica inner function for symbolic Vandermonde inverse matrix. For numerical Vandermonde inverse matrix, how to optimize and design the effective algorithms to carry out our methods will be our future research.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors thank the unknown reviewers for their careful reading and helpful comments. This work is supported by Science Research Project of Hunan Province Education Office (14C0650) and Research Project of National University of Defense Technology (JC12-02-01).
- J. T. Tou, “Determination of the inverse Vandermonde matrix,” IEEE Transactions on Automatic Control, vol. 9, no. 3, p. 314, 1964.
- G. C. Reis, A Matrix Formulation for the Inverse Vandermonde Matrix, 1967.
- V.-E. Neagoe, “Inversion of the Van der Monde matrix,” IEEE Signal Processing Letters, vol. 3, no. 4, pp. 119–120, 1996.
- A. Eisinberg and G. Fedele, “On the inversion of the Vandermonde matrix,” Applied Mathematics and Computation, vol. 174, no. 2, pp. 1384–1397, 2006.
- X. F. Lu, Z. Xu, Q. Lu et al., “A fast algorithm of the inverse of Vandermonde-type matrix,” in Proceedings of the 7th International Conference on Matrix Theory and Its Application, vol. 17, pp. 246–249, Chengdu, China, 2006.
- Z. Xu, Fast Algorithm of Vandermonde Matrix Class, Northwestern Polytechnic University Press, Xi'an, China, 1997.
- L. Zhao, Z. Xu, and Q. Lu, “An efficient and fast algorithm for the inverse of generalized Vandermonde matrix,” Numerical Mathematics: A Journal of Chinese Universities, vol. 33, no. 4, pp. 312–318, 2011.
- P. R. Mane, S. G. Adiga, and M. Sathish Kumar, “Performance evaluation of random linear network coding using a Vandermonde matrix,” Physical Communication, vol. 10, pp. 24–30, 2014.
- X. Zhang, Theory and Application of Reproducing Kernel, Science Press, Beijing, China, 2010.
Copyright © 2015 Qun Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.