arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.4768cs.SC
收藏

结构矩阵的近似最优计算

Nearly Optimal Computations with Structured Matrices

Victor Y. Pan, Elias Tsigaridas

摘要:

我们估计的布尔复杂性乘法的结构矩阵的向量和非奇异线性方程组的解决方案,这些矩阵。我们研究四个基本的最流行的类,即Toeplitz,汉克尔,柯西和范德蒙矩阵,其中引用的计算问题是等价的多项式乘法和除法和多项式和有理多点评估和插值的任务。布尔成本估计后一个问题已获得Kirrinnis在\cite{kirrinnis-joc-1998},除了有理插值,我们现在提供。所有已知的布尔成本估计这些问题依赖于使用克罗内克产品。这意味着第$d$阶输出的$d$精度增加了$d$倍,但是我们通过依赖于基于采用FFT的不同技术来避免这种增加。此外,我们简化了分析,使其更加透明,结合我们的任务和算法的结构化矩阵和多项式和有理函数的表示。这也使我们的估计,以涵盖Trummer的重要问题和计算的流行类结构矩阵,概括了四个引用的基本矩阵类。

英文摘要:

We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel, Cauchy and Van-der-monde matrices, for which the cited computational problems are equivalent to the task of polynomial multiplication and division and polynomial and rational multipoint evaluation and interpolation. The Boolean cost estimates for the latter problems have been obtained by Kirrinnis in \cite{kirrinnis-joc-1998}, except for rational interpolation, which we supply now. All known Boolean cost estimates for these problems rely on using Kronecker product. This implies the $d$-fold precision increase for the $d$-th degree output, but we avoid such an increase by relying on distinct techniques based on employing FFT. Furthermore we simplify the analysis and make it more transparent by combining the representation of our tasks and algorithms in terms of both structured matrices and polynomials and rational functions. This also enables further extensions of our estimates to cover Trummer's important problem and computations with the popular classes of structured matrices that generalize the four cited basic matrix classes.

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

↑