A Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices

MaRDI QIDQ6247944zbMATH OpenFDO

Authors Sirani M. Perera, Grigory Bonik, V. Olshevsky

Publication date 8 January 2014

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Toeplitz, Cauchy, and related matrices (15B05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Abstract: The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having $mathcalO(n^2)$ complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we present an $mathcalO(n^2)$ algorithm to compute the inversion of quasiseparable Vandermonde-like matrices.

This page was built for publication: A Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6247944)