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


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

A. Batkhin

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

Autor responsável pela correspondência
Email: batkhin@gmail.com
Rússia, Moscow, 125047; Dolgoprudnyi, Moscow oblast, 141700

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2019