Polynomial algorithms in computer algebra (Q1912495): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-7091-6571-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206293930 / rank
 
Normal rank

Latest revision as of 20:13, 19 March 2024

scientific article
Language Label Description Also known as
English
Polynomial algorithms in computer algebra
scientific article

    Statements

    Polynomial algorithms in computer algebra (English)
    0 references
    0 references
    12 May 1996
    0 references
    This book surveys algorithms and results of Computer Algebra that are concerned with polynomials. It introduces algorithms from the bottom up, starting from very basic problems in computation over the integers, and finally leading to, e.g. advanced topics in factorization, solution of polynomial equations and constructive algebraic geometry. It is not based on a particular computer algebra program system. After two introductory chapters, the book contains six chapters with the following respective topics: computation by homomorphic images, gcd computation, factorization and decomposition of polynomials, linear systems and Hankel systems, Gröbner bases. The last three chapters are concerned with applications of polynomial algorithms to higher level problems in computer algebra. In particular, a decision algorithm in the elementary theory of real closed fields, a description of Gosper's algorithm for solving summation problems, and an algorithm for deciding whether an algebraic curve can be parametrized by rational functions (and if so for computing such a parametrization) is given. Along the way, the complexity of many of the algorithms is investigated. Each chapter ends with rich bibliographical notes. The book was originally developed from course material. It can easily be used as a textbook on the topic. Most subsections contain exercises. Solutions of some of the exercises are provided.
    0 references
    0 references
    computer algebra
    0 references
    algebraic curve parametrization
    0 references
    factorization
    0 references
    solution of polynomial equations
    0 references
    constructive algebraic geometry
    0 references
    gcd computation
    0 references
    decomposition
    0 references
    linear systems
    0 references
    Hankel systems
    0 references
    Gröbner bases
    0 references
    polynomial algorithms
    0 references
    elementary theory of real closed fields
    0 references
    Gosper's algorithm
    0 references
    summation problems
    0 references
    algebraic curve
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references