EUROSAM 84: International Symposium on Symbolic and Algebraic Computation Cambridge, England, July 9–11, 1984

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): John Fitch (eds.)
Series: Lecture Notes in Computer Science 174
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1984

Language: English
Pages: 397
Tags: Computer Science, general

Introduction....Pages 1-1
Homogeneous linear difference equation (Frobenius — Boole method)....Pages 2-12
An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation....Pages 13-22
Operational calculus techniques for solving differential equations....Pages 23-34
On the application of symbolic computation to nonlinear control theory....Pages 35-46
Quartic equations and algorithms for riemann tensor classification....Pages 47-58
Symbolic computation and the Dirichlet problem....Pages 59-63
Simplification of polynomials in n variables....Pages 64-73
On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems....Pages 74-85
Implementation of a p-adic package for polynomial factorization and other related operations....Pages 86-99
Computations on curves....Pages 100-107
Detecting torsion divisors on curves of genus 2....Pages 108-114
Computation in radical extensions....Pages 115-122
A primer: 11 Keys to new scratchpad....Pages 123-147
A pure and really simple initial functional algebraic language....Pages 148-158
Some effectivity problems in polynomial ideal theory....Pages 159-171
Upper and lower bounds for the degree of Groebner bases....Pages 172-183
On the complexity of the Gröbner-bases algorithm over K[x,y,z]....Pages 184-194
Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings....Pages 195-206
Computations with rational subsets of confluent groups....Pages 207-212
Camac2: A portable system for combinatorial and algebraic computation....Pages 213-224
Polynomial time algorithms for Galois groups....Pages 225-236
Code generation and optimization for finite element analysis....Pages 237-247
A comparison of algorithms for the symbolic computation of Padé approximants....Pages 248-259
Automatic error cumulation control....Pages 260-271
Polynomial factorization by root approximation....Pages 272-276
Effective Hilbert irreducibility....Pages 277-284
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation....Pages 285-296
A new lifting process for the multivariate polynomial factorization....Pages 297-309
Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11....Pages 310-320
On a simple primality testing algorithm....Pages 321-332
A criterion for the equivalence of two ideals....Pages 333-340
y′+fy=g....Pages 341-350
Integration in finite terms with special functions: A progress report....Pages 351-358
A note on the Risch differential equation....Pages 359-366
Approximation by continued fraction of a polynomial real root....Pages 367-377
On the automatic resolution of certain diophantine equations....Pages 378-385
On pseudo-resultants....Pages 386-396