Decomposing Systems of Polynomial Equations

Rainer Steinwandt
Additional contact information
Rainer Steinwandt: Universität Kärlsruhe, Institut für Algorithmen und Kognitive Systeme, Professor Dr. Th. Beth, Arbeitsgruppe Computeralgebra, Fakultät für Informatik

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 387-407 from Springer

Abstract: Abstract The notion of sequential decomposition of k-correspondences is introduced. This is motivated by the use of functional decompositions of polynomials, rational functions, and rational mappings for the simplification of the solution of certain systems of polynomial equations. Sequential decompositions of k-correspondences can be used to express the “generic solution” of certain kinds of polynomial equations in a simpler way, in some sense. It is shown how Gröbner basis techniques can be applied to compute this kind of decompositions effectively.

Keywords: Prime Ideal; Polynomial Equation; Symbolic Computation; Minimal Polynomial; Algebraic Extension (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-642-60218-4_31

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().