Table of contents

  1. Front Matter
  2. Steffen Seitz
    Pages 19-31
  3. Ernest Sibert, Harold F. Mattson, Paul Jackson
    Pages 51-61
  4. G. E. Collins, J. R. Johnson, W. Küchlin
    Pages 71-87
  5. Winfried Neun, Herbert Melenk
    Pages 89-99
  6. Back Matter

About these proceedings

Introduction

This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.

Keywords

Algbraische Umformung Algebraic Manipulation Gröbner Bases Gröbner-Basen Parallelism Symbolic Computation algebra algorithm algorithms computer computer algebra programming

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-55328-2
  • Copyright Information Springer-Verlag 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55328-1
  • Online ISBN 978-3-540-47026-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book