Email this article Computation of the Resonance Set of a Polynomial under Constraints on Its Coefficients
- Authors: Batkhin A.B.1,2
-
Affiliations:
- Keldysh Institute of Applied Mathematics, Russian Academy of Sciences
- Moscow Institute of Physics and Technology
- Issue: Vol 45, No 2 (2019)
- Pages: 27-36
- Section: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176753
- DOI: https://doi.org/10.1134/S0361768819020038
- ID: 176753
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. B. Batkhin
Keldysh Institute of Applied Mathematics, Russian Academy of Sciences; Moscow Institute of Physics and Technology
Author for correspondence.
Email: batkhin@gmail.com
Russian Federation, Moscow, 125047; Dolgoprudnyi, Moscow oblast, 141700
Supplementary files
