Radical computations of zero-dimensional ideals and real root counting-Reference-Cited by-同舟云学术

Radical computations of zero-dimensional ideals and real root counting

Published:1996-11 Issue:4-6 Volume:42 Page:561-569
ISSN:0378-4754
Container-title:Mathematics and Computers in Simulation
language:en
Short-container-title:Mathematics and Computers in Simulation

Author:

Becker E.,Wörmann T.

Publisher

Elsevier BV

Subject

Applied Mathematics,Modeling and Simulation,Numerical Analysis,General Computer Science,Theoretical Computer Science

Reference22 articles.

1. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations;Auzinger;Internat. Ser. Numer. Math.,1988

2. On the trace formula for quadratic forms;Becker,1992

3. Dualité et algorithmes itératifs pour la résolution de systémes polynomiaux;Cardinal;Thesis Rennes I,1993

4. A Jacobian method for finding the radical of an ideal;Eisenbud,1989

5. Efficient computation of zero-dimensional Gröbner-bases by change of orderings;Faugére,1989

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

1. Block-Krylov techniques in the context of sparse-FGLM algorithms;Journal of Symbolic Computation;2020-05

2. An FGLM-like algorithm for computing the radical of a zero-dimensional ideal;Journal of Algebra and Its Applications;2018-01

3. Validating the Completeness of the Real Solution Set of a System of Polynomial Equations;Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation;2016-07-20

4. A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals;Journal of Symbolic Computation;2016-01

5. A generic position based method for real root isolation of zero-dimensional polynomial systems;Journal of Symbolic Computation;2015-05