Computer Algebra and Symbolic Computation: Mathematical MethodsCRC Press, 3 ene 2003 - 472 páginas Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polyno |
Índice
| 1 | |
| 17 | |
| 63 | |
Single Variable Polynomials | 111 |
Polynomial Decomposition | 179 |
Multivariate Polynomials | 201 |
The Resultant | 265 |
Polynomial Simplification with Side Relations | 297 |
Polynomial Factorization | 349 |
Bibliography | 431 |
Index | 441 |
Otras ediciones - Ver todo
Computer Algebra and Symbolic Computation: Mathematical Methods Joel S. Cohen Vista previa restringida - 2003 |
Computer Algebra and Symbolic Computation: Mathematical Methods Joel S. Cohen Vista de fragmentos - 2003 |
Computer Algebra and Symbolic Computation: Mathematical Methods Joel S. Cohen No hay ninguna vista previa disponible - 2020 |
Términos y frases comunes
apply automatic simplification coefficient domain computer algebra cont(u decomposition defined Definition deg(u deg(v division process elseif Example extended Euclidean algorithm f₁ field gcd(a gcd(u Give a procedure greatest common divisor Gröbner basis implies Input integer integral domain irem(x irreducible factorization irreducible polynomial iteration Kind(u lc(v lm(u main variable Maple txt Mathematica txt mathematical minimal polynomial monic monomial monomial-based division MPL procedure multiplicative inverse multivariate polynomials MuPAD txt non-zero polynomials notation obtain operands operator polynomial division polynomial expansion polynomials in Q[x positive degree primitive polynomial Proof properties quotient r₁ rational expression rational number reader Exercise recursive reduction step sequence relatively prime remainder equations remainder sequence res(u satisfies Section side relations simplification algorithm simplified form solution square-free factorization square-free polynomial standard form Suppose terminates transformation unique unit normal variable order xy² zero Zp[x νο