Partial algorithms for satellite unknowns determination
- 作者: Panferov A.A.1,2
-
隶属关系:
- Department of Computational Mathematics and Cybernetics
- Dorodnicyn Computing Center
- 期: 卷 43, 编号 2 (2017)
- 页面: 119-125
- 栏目: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176496
- DOI: https://doi.org/10.1134/S0361768817020098
- ID: 176496
如何引用文章
详细
The concept of satellite unknowns with respect to a set of selected unknowns in linear homogeneous differential systems was introduced earlier by the author of this paper, and an algorithm for satellite unknowns testing was proposed. On one of the stages of this algorithm, it is required to compare Picard–Vessiot extensions of two differential systems constructed in the course of the algorithm operation. The commonly accepted method of solving this problem, which is based on Hrushovski’s algorithm, has rather high algorithmic complexity, which hampers its use in practice. In the paper, some partial algorithms for satellite unknowns testing are described. These algorithms are not always applicable but have relatively low computational complexity and can be implemented in computer algebra systems.
作者简介
A. Panferov
Department of Computational Mathematics and Cybernetics; Dorodnicyn Computing Center
编辑信件的主要联系方式.
Email: ast.a_s@mail.ru
俄罗斯联邦, Moscow, 119991; ul. Vavilova 40, Moscow, 119333
补充文件
