New algorithm computes certificates for non-negative univariate polynomials in saturated Archimedean quadratic modules by converting to natural generators and applying the Basic Lemma, with a Maple implementation that succeeds on examples where RealCertify does not.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing Certificates in Archimedean Univariate Saturated Quadratic Modules
New algorithm computes certificates for non-negative univariate polynomials in saturated Archimedean quadratic modules by converting to natural generators and applying the Basic Lemma, with a Maple implementation that succeeds on examples where RealCertify does not.