Bounds on absolute positiveness of multivariate polynomials-Reference-Cited by-同舟云学术

Bounds on absolute positiveness of multivariate polynomials

Published:2010-06 Issue:6 Volume:45 Page:617-628
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Batra Prashant,Sharma Vikram

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference18 articles.

1. Abbott, John, 2006. Quadratic interval refinement. Presented as a poster in ISSAC’06. Available athttp://www.dima.unige.it/~abbott.

2. Akritas, A.G., 1978. Vincent’s theorem in algebraic manipulation. Ph.D. Thesis, Operations Research Program, North Carolina State University, Raleigh, North Carolina.

3. The Theory of Partitions;Andrews,1984

4. Implementations of a new theorem for computing bounds for positive roots of polynomials;Akritas;Computing,2006

5. Improving the performance of the continued fractions method using new bounds of positive roots;Akritas;Nonlinear Analysis: Modelling and Control,2008

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved bounds on absolute positiveness of multivariate polynomials;Journal of Symbolic Computation;2020-11

2. Improved Bounds on Absolute Positiveness of Multivariate Polynomials;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23

3. Quality of positive root bounds;Journal of Symbolic Computation;2016-05

4. A Lower Bound for Computing Lagrange’s Real Root Bound;Computer Algebra in Scientific Computing;2016

5. On the Quality of Some Root-Bounds;Mathematical Aspects of Computer and Information Sciences;2016