An Algorithm for Transforming Regular Chain into Normal Chain

Authors:
Banghe Li;Dingkang Wang
Affiliations:
Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100080;Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100080
Venue:
Computer Mathematics
Year:
2008

Citing 6
Cited 2

A new method for solving algebraic systems of positive dimension

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Solving parametric algebraic systems

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties

Journal of Symbolic Computation
On the theories of triangular sets

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Unmixed-dimensional decomposition of a finitely generated perfect differential ideal

Journal of Symbolic Computation
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms

On the regularity property of differential polynomials modulo regular differential chains

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an improved algorithm to compute the normal chain from a given regular chain such that their saturation ideals are the same. Our algorithm is based on solving a system of linear equations and the original method computes the resultants of multivariate polynomials. From the experiments, for the random polynomials, our algorithm is much more efficient than the original one.