Radical computations of zero-dimensional ideals and real root counting.

DOI10.1016/S0378-4754(96)00033-XzbMath1037.68540OpenAlexW2054722690WikidataQ127472368 ScholiaQ127472368MaRDI QIDQ1565838

Eberhard Becker, Thorsten Wörmann

Publication date: 27 May 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(96)00033-x

zbMATH Keywords

computer algebratrace formradical of an idealdecomposition of algebras

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (12)

An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Parallelization of modular algorithms ⋮ A generalization of Stickelberger's theorem ⋮ On the computation of matrices of traces and radicals of ideals ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ A moment approach to analyze zeros of triangular polynomial sets ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Simultaneous elimination by using several tools from real algebraic geometry ⋮ Semidefinite characterization and computation of zero-dimensional real radical ideals ⋮ Computer algebra and algebraic geometry -- achievements and perspectives ⋮ Interpolation of ideals

Cites Work

• Algebraic methods for Toeplitz-like matrices and operators
• Gröbner bases and primary decomposition of polynomial ideals
• Quasi-Frobenius-Algebren und lokal vollständige Durchschnitte
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Radical computations of zero-dimensional ideals and real root counting.