Efficient algorithms for the symbolic computation of matrices

矩阵符号计算的高效算法

• 批准号: RGPIN-2020-06746
• 负责人: Zhang, Yang
• 金额: $ 2.99万
• 依托单位: University of Manitoba
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2021
• 资助国家: 加拿大
• 起止时间: 2021-01-01 至 2022-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=740596
• 关键词: Efficient; algorithms; symbolic; computation; matrices

Symbolic computation (also called computer algebra) is a relatively recent research area in computer science and mathematics, which refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects, in particular, mathematical computations performed symbolically rather than numerically. Because of its lack of numerical errors, symbolic computation is widely used in mathematical research, engineering, and science. The overarching goal of this grant proposal is the design, analysis and implementation of efficient algorithms for matrices and tensors over a number of important algebraic structures in symbolic computation, such as computing various generalized inverses and normal forms, rank decomposition, simultaneous decomposition and solving matrix equations over various fields and polynomial rings. Their study is motivated by numerous applications in control theory, machine learning, data science, engineering, signal and color image processing, statistics, neural network, etc. For matrices over some fields, above questions have been explored in the past decades. Recently efficient symbolic algorithms for matrices over quaternion and generalized polynomials have attracted more and more attentions, in particular, these questions for tensors. We plan to employ some symbolic computation techniques such as Groebner bases to investigate these questions. We expect that this will lead to more efficient algorithms for computing generalized inverses and solving matrix (tensor) equations and systems of differential and difference equations. This should provide both theoretical and practical improvements over currently known algorithms. Finally, the algorithmic advances of this proposal will be implemented in computer algebra software such as Maple and SAGE. The projects all involve extensive training of highly qualified personnel (HQP) for their future positions in academia and industry.

符号计算（也称为计算机代数）是计算机科学和数学中一个相对较新的研究领域，它是指研究和开发用于操纵数学表达式和其他数学对象的算法和软件，特别是符号而不是数字执行的数学计算。由于其缺乏数值误差，符号计算被广泛用于数学研究，工程和科学。该拨款提案的总体目标是设计，分析和实现符号计算中许多重要代数结构上的矩阵和张量的有效算法，例如计算各种广义逆和范式，秩分解，同时分解和求解各种域和多项式环上的矩阵方程。他们的研究动机是在控制理论，机器学习，数据科学，工程，信号和彩色图像处理，统计，神经网络等许多应用，对于某些领域的矩阵，在过去的几十年中，上述问题已经被探索。近年来，四元数上矩阵和广义多项式上矩阵的有效符号算法引起了越来越多的关注，特别是张量的符号算法。我们计划采用一些符号计算技术，如Groebner基地调查这些问题。我们希望这将导致更有效的算法计算广义逆和解决矩阵（张量）方程和微分差分方程系统。这应该提供理论和实践上的改进，目前已知的算法。 最后，算法的进步，这一建议将在计算机代数软件，如Maple和SAGE。这些项目都涉及对高素质人员（HQP）的广泛培训，以适应他们未来在学术界和工业界的职位。