Radical computations of zero-dimensional ideals and real root counting

E. Becker and T. Wörmann

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 561-569

Abstract: The computation of the radical of a zero-dimensional ideal plays an important role in various areas of computer algebra. A bunch of different methods have been published to meet this task (see e.g. [4,8,11,13–17]). The method presented in this paper is strongly connected to a recent approach to the real root counting problem as described in [2,18]. It provides a lot of information for real root counting already in the process of calculating the radical. In this sense this approach is well-suited for real root counting problems.

Keywords: Trace form; Radical of an ideal; Decomposition of algebras (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037847549600033X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:561-569

DOI: 10.1016/S0378-4754(96)00033-X

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().