...
首页> 外文期刊>Computational mathematics and mathematical physics >Fourier Method for Solving Two-Sided Convolution Equations on Finite Noncommutative Groups
【24h】

Fourier Method for Solving Two-Sided Convolution Equations on Finite Noncommutative Groups

机译:用于求解有限非态度群的双面卷积方程的傅立叶方法

获取原文
获取原文并翻译 | 示例
           

摘要

The Fourier method on commutative groups is used in many fields of mathematics, physics, and engineering. Nowadays, this method finds increasingly wide application to non-commutative groups. Along with the one-sided convolution operators and the corresponding convolution equations, two-sided convolution operators on noncommutative groups are studied. Two-sided convolution operators have a number of applications in complex analysis and are used in quantum mechanics. In this paper, two-sided convolutions on arbitrary finite noncommutative groups are considered. Acriterion for the inversibility of the two-sided convolution operator is obtained. An algorithm for solving the two-sided convolution equation on an arbitrary finite noncommutative group, using the Fourier transform, is developed. Estimates of the computational complexity of the algorithm developed are given. It is shown that the complexity of solving the two-sided convolution equation depends both on the type of the group representation and on the computational complexity of the Fourier transform. The algorithm is considered in detail on the example of the finite dihedral group over a simple Galois field, and the results of numerical experiments are presented.
机译:换向群体的傅立叶方法用于数学,物理和工程的许多领域。如今,这种方法发现非换向组越来越广泛。除了单面卷积运营商和相应的卷积方程外,还研究了非容性群体的双面卷积运营商。双面卷积运营商在复杂分析中具有许多应用,并用于量子力学。本文认为,考虑了双面综合综合。获得双面卷积运营商可逆性的ARERITION。开发了一种利用傅里叶变换求解任意有限的非传输组上的双面卷积方程的算法。给出了所开发的算法的计算复杂性的估计。结果表明,求解双面卷积方程的复杂性取决于组表示的类型和傅里叶变换的计算复杂性。在简单的Galois场上,在有限二面体组的实施例中详细考虑该算法,并提出了数值实验的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号