Advertisement

Irreducible zero decomposition

  • Dongming Wang
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)

Abstract

Polynomial factorization is not required theoretically for the algorithms described in the previous two chapters. Nevertheless, available factoring programs have been efficient enough to be used to enhance the performance of elimination algorithms. It is a good strategy to incorporate polynomial factorization (even over algebraicextension fields) in the implementation of such algorithms. In this chapter, we elaborate how triangular systems can be further decomposed by making use of factorization in order to compute zero decompositions possessing better properties. For our exposition some of the material from Wu (1984; 1994, chap. 4) will be used without explicit mention.

Keywords

Simple System Extension Field Polynomial System otheE Hand Generic Zero 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Dongming Wang
    • 1
  1. 1.Laboratoire d’Informatique de Paris 6Universiré Pierre et Marie CurieParisFrance

Personalised recommendations