Chapter

Computer Algebra in Scientific Computing

Volume 9301 of the series Lecture Notes in Computer Science pp 275-291

Date:

Parametric Solvable Polynomial Rings and Applications

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We recall definitions and properties of parametric solvable polynomial rings and variants. For recursive solvable polynomial rings, i.e. solvable polynomial rings with coefficients from a solvable polynomial ring, also commutator relations between main and coefficient variables are introduced. From these rings solvable quotient and residue class rings can be constructed and used as coefficients of solvable polynomials. The resulting skew extension fields of the ground field can be applied for skew root finding or primary ideal decomposition. We present the design and implementation of these rings in the strongly typed, generic, object oriented computer algebra system JAS.