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

拟可分矩阵的时空有效生成元

Time and space efficient generators for quasiseparable matrices

Clement Pernet, Arne Storjohann

摘要:

拟可分矩阵类的定义是任何完全在主对角线以下或以上的子矩阵都具有小秩,即低于称为拟可分阶的界。这些矩阵在用快速多极方法(FMM)求解粒子相互作用的偏微分方程或计算广义本征值时自然出现。从这些应用领域,结构化的表示和算法已被设计在数值线性代数计算与这些矩阵在时间上线性的矩阵维数和二次或三次的准可分性顺序。出于通用精确线性代数库LinBox的设计,并在代数计算中的算法应用,我们适应现有的技术引入新的使用准可分矩阵的精确线性代数,其中次立方矩阵算术是可用的。特别是,我们将展示拟可分性概念与秩轮廓矩阵不变量之间的联系,这是我们在2015年引入的。它的结果在两个新的结构化表示,一个是一个更简单的变化的分层半可分离的存储,第二个利用广义Bruhat分解。因此,大多数基本操作,例如计算准可分离阶数,应用向量,块向量,将两个准可分离矩阵相乘,求准可分离矩阵的逆,可以至少与以前的现有算法一样快,并且通常更快。

英文摘要:

The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in solving PDE's for particle interaction with the Fast Multi-pole Method (FMM), or computing generalized eigenvalues. From these application fields, structured representations and algorithms have been designed in numerical linear algebra to compute with these matrices in time linear in the matrix dimension and either quadratic or cubic in the quasiseparability order. Motivated by the design of the general purpose exact linear algebra library LinBox, and by algorithmic applications in algebraic computing, we adapt existing techniques introduce novel ones to use quasiseparable matrices in exact linear algebra, where sub-cubic matrix arithmetic is available. In particular, we will show, the connection between the notion of quasiseparability and the rank profile matrix invariant, that we have introduced in 2015. It results in two new structured representations, one being a simpler variation on the hierarchically semiseparable storage, and the second one exploiting the generalized Bruhat decomposition. As a consequence, most basic operations, such as computing the quasiseparability orders, applying a vector, a block vector, multiplying two quasiseparable matrices together, inverting a quasiseparable matrix, can be at least as fast and often faster than previous existing algorithms.

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

↑