Computation of the Resonance Set of a Polynomial under Constraints on Its Coefficients


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Methods for computing the generalized discriminant set of a polynomial the roots of which satisfy a linear relation are considered. Using a q-analog of the classical elimination theory and computer algebra algorithms, methods for computing the parametric representation of this set are described, and these methods are implemented in a Maple library. The operation of these methods is demonstrated by an example.

作者简介

A. Batkhin

Keldysh Institute of Applied Mathematics, Russian Academy of Sciences; Moscow Institute of Physics and Technology

编辑信件的主要联系方式.
Email: batkhin@gmail.com
俄罗斯联邦, Moscow, 125047; Dolgoprudnyi, Moscow oblast, 141700

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019