Computation of the resonance set of a polynomial under constraints on its coefficients
From MaRDI portal
Publication:2216907
DOI10.1134/S0361768819020038zbMath1457.13052WikidataQ127820972 ScholiaQ127820972MaRDI QIDQ2216907
Publication date: 18 December 2020
Published in: Programming and Computer Software (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability sets of multiparameter Hamiltonian systems
- Subresultants revisited.
- Hamiltonian normalization in the restricted many-body problem by computer algebra methods
- Polynomials. Translated from the second Russian edition by Dimitry Leites.
- Parameterization of a set determined by the generalized discriminant of a polynomial
- Parameterization of the discriminant set of a polynomial
- Understanding Maple
- Resonance Set of a Polynomial and Problem of Formal Stability
- Computation of generalized discriminant of a real polynomial
- Über Orthogonalpolynome, die q‐Differenzengleichungen genügen
This page was built for publication: Computation of the resonance set of a polynomial under constraints on its coefficients