On the Closed Form Expression of Elementary Symmetric Polynomials and the Inverse of Vandermonde Matrix

by   Mahdi S. Hosseini, et al.

Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system Vc=b where the rows of a square matrix V are constructed by progression of the power polynomials. It has many applications in scientific computing including interpolation, super-resolution, and construction of special matrices applied in cryptography. Despite its numerous applications, the matrix is highly ill-conditioned where specialized treatments are considered for approximation such as conversion to Cauchy matrix, spectral decomposition, and algorithmic tailoring of the numerical solutions. In this paper, we propose a generalized algorithm that takes arbitrary pairwise (non-repetitive) sample nodes for solving inverse Vandermonde matrix. This is done in two steps: first, a highly balanced recursive algorithm is introduced with O(N) complexity to solve the combinatorics summation of the elementary symmetric polynomials; and second, a closed-form solution is tailored for inverse Vandermonde where the matrix' elements utilize this recursive summation for the inverse calculations. The numerical stability and accuracy of the proposed inverse method is analyzed through the spectral decomposition of the Frobenius companion matrix that associates with the corresponding Vandermonde matrix. The results show significant improvement over the state-of-the-art solutions using specific nodes such as Nth roots of unity defined on the complex plane. A basic application in one dimensional interpolation problem is considered to demonstrate the utility of the proposed method for super-resolved signals.



There are no comments yet.


page 14


Structured inversion of the Bernstein-Vandermonde Matrix

Bernstein polynomials, long a staple of approximation theory and computa...

Inverse of a Special Matrix and Application

The matrix inversion is an interesting topic in algebra mathematics. How...

A new approach to find an approximate solution of linear initial value problems

This work investigates a new approach to find closed form analytical app...

Structured inversion of the Bernstein mass matrix

Bernstein polynomials, long a staple of approximation theory and computa...

Symbolic spectral decomposition of 3x3 matrices

Spectral decomposition of matrices is a recurring and important task in ...

A Generalized Matrix Inverse with Applications to Robotic Systems

It is well-understood that the robustness of mechanical and robotic cont...

Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization

We consider the design of an orthogonal symmetric/antisymmetric multiwav...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.