Vandermonde Matrix

In linear algebra, a Vandermonde matrix, named after Alexandre-Thophile Vandermonde, is a matrix with a geometric progression in each row, i.e;
V=\begin{bmatrix}
1 & \alpha_1 & \alpha_1^2 & \dots & \alpha_1^{n-1}\\ 1 & \alpha_2 & \alpha_2^2 & \dots & \alpha_2^{n-1}\\ 1 & \alpha_3 & \alpha_3^2 & \dots & \alpha_3^{n-1}\\ \vdots & \vdots & \vdots & &\vdots \\ 1 & \alpha_m & \alpha_m^2 & \dots & \alpha_m^{n-1}\\ \end{bmatrix} or
V_{i,j} = \alpha_i^{j-1}
for all indices i and j. (Some authors use the transpose of the above matrix.) The determinant of an n\times n Vandermonde matrix can be expressed as:
\det(V) = \prod_{1\le i
=\sum_{\sigma \in S_n} \sgn (\sigma) \alpha_1^{\sigma(1)-1} ... \alpha_n^{\sigma(n)-1} This determinant is sometimes called the discriminant, although many authors, including Wikipedia, refer to the discriminant as the square of this determinant. If mn, then the matrix V has maximum rank (m) if and only if all αi are distinct. When two or more αi are equal, the corresponding polynomial interpolation problem is ill-posed. In that case one may use a generalization called confluent Vandermonde matrices, which makes the matrix positive definite while retaining most properties. If αi = αi+1 = ... = αi+k and αi ≠ αi-1, then the (i + k)th row is given by
V_{i+k,j} = \begin{cases} 0, & \mbox{if } j \le k; \\ \frac{(j-1)!}{(j-k-1)!} \alpha_i^{j-k-1}, & \mbox{if } j > k. \end{cases}
The above formula for confluent Vandermonde matrices can be readily derived by letting two parameters \alpha_i and \alpha_j go arbitrarily close to each other. The difference vector between the rows corresponding to \alpha_i and \alpha_j scaled to a constant yields the above equation (for k=1). Similarly, the cases k>1 are obtained by higher order differences. Consequently, the confluent rows are derivatives of the original Vandermonde row.

Applications

These matrices are useful in polynomial interpolation, since solving the system of linear equations Vu=y for u with V the n × n Vandermonde matrix is equivalent to finding the coefficients uj of the polynomial
P(x)=\sum_{j=0}^{n-1} u_j x^j
of degree ≤ n−1 which has the values yi at αi.
   
The Vandermonde determinant plays a central role in the Frobenius formula, which gives the character of conjugacy classes of representations of the symmetric group. When the values \alpha_k range over powers of a finite field, then the determinant is more commonly known as the Moore determinant, which has a number of interesting properties. Confluent Vandermonde matrices are used in Hermite interpolation.

See also

References

  • Roger A. Horn and Charles R. Johnson, Topics in matrix analysis, (1991) Cambridge University Press. See Section 6.1.
  • William Fulton and Joe Harris, Representation Theory, A First Course (1991) Springer Verlag New York, ISBN 0-387-974495-4 Chapter 4 reviews the representation theory of symmetric groups, including the role of the Vandermonde determinant.
  • David Goss, Basic Structures of Function Field Arithmetic (1996) Springer Verlag New York, ISBN 3-540-63541-6 Chapter 1 reviews the Moore determinant

 

<< PreviousWord BrowserNext >>
hong kong economic times
tricorder
ferrero rocher
list of people on the stamps of bosnia and herzegovina
geirr tveitt
morse theory
list of television stations in utah
magic theory
the love song of j. alfred prufrock
thoth tarot
ray sherwin
pokmon crystal
legendary bird pokmon
lugia
elizabeth peters
magnum opus
vbx
friheten
list of order topics
e. f. schumacher
bob greene
matt ruff
close encounter
acronyms in the philippines
knickers
goldfield, nevada
thong
g string
henry northcote, 1st baron northcote
mandelbrot
york guardian
scarborough mirror
harambee
tony capstick
unity of the proposition
austin healey sprite
grand prix motor racing
kubrat
document warehouse
st katharine docks
ryosuke cohen
air carabes
eigenface
philip hardwick