【24h】

On Unimodular Matrices of Difference Operators

机译:关于差分算子的单模矩阵

获取原文

摘要

We consider matrices L ∈ Mat_n(K[σ,σ~(-1)]) of scalar difference operators, where K is a difference field of characteristic 0 with an automorphism σ. We discuss approaches to compute the dimension of the space of those solutions of the system of equations L(y) = 0 that belong to an adequate extension of K. On the base of one of those approaches, we propose a new algorithm for computing L~(-l) ∈ Mat_n(K[(σ,σ~(-1)]) whenever it exists. We investigate the worst-case complexity of the new algorithm, counting both arithmetic operations in K and shifts of elements of K. This complexity turns out to be smaller than in the earlier proposed algorithms for inverting matrices of difference operators. Some experiments with our implementation in Maple of the algorithm are reported.
机译:我们考虑标量差分算子的矩阵L∈Mat_n(K [σ,σ〜(-1)]),其中K是特征0的自同构σ的差分场。我们讨论了计算方程组L(y)= 0的那些解的空间维度的方法,这些解属于K的充分扩展。在其中一种方法的基础上,我们提出了一种计算L的新算法〜(-l)∈Mat_n(K [(σ,σ〜(-1)])只要存在,我们就计算新算法的最坏情况复杂度,同时计算K中的算术运算和K元素的移位。事实证明,这种复杂性要比早期提出的差分算符矩阵求逆算法要小,据报道,我们在Maple中实现该算法的一些实验。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号