arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1874math.NAcs.NAcs.SC
收藏

快速求解准分离的Vandermonde-like矩阵的算法

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

Sirani M. Perera, Grigory Bonik, Vadim Olshevsky

AI总结:

本文提出快速高斯消去算法,用于求解多项式Vandermonde-like矩阵,并进一步推导出准分离、半分离和well-free矩阵的快速求逆算法,复杂度为O(n²)。

摘要:

Vandermonde-like矩阵的结果被介绍为多项式Vandermonde矩阵的推广,利用这些矩阵的位移结构推导出求逆公式。本文首先提出一种快速高斯消去算法用于多项式Vandermonde-like矩阵。随后,利用该算法推导出准分离、半分离和well-free Vandermonde-like矩阵的快速求逆算法,复杂度为O(n²)。为此,我们识别了位移运算符的生成器以及准分离、半分离和well-free多项式基变换矩阵列之间的递推关系(2项和3项)。最后,我们提出一个O(n²)的算法来计算准分离Vandermonde-like矩阵的逆。

英文摘要:

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 $\mathcal{O}(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 $\mathcal{O}(n^2)$ algorithm to compute the inversion of quasiseparable Vandermonde-like matrices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑