[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Computer Algebra and Parallelism

Second International Workshop, Ithaca, USA, May 9-11, 1990. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Richard E. Zippel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 584)

Included in the following conference series:

Conference proceedings info: CAP 1990.

  • 1215 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (8 papers)

  1. Front Matter

    Download chapter PDF

  2. The S-threads environment for parallel symbolic computation

    • Wolfgang Küchlin
    Pages 1-18

  3. Algebraic computing on a local net

    • Steffen Seitz
    Pages 19-31

  4. An environment for parallel algebraic computation

    • Jean-Louis Roch
    Pages 33-50

  5. Finite field arithmetic using the connection machine

    • Ernest Sibert, Harold F. Mattson, Paul Jackson
    Pages 51-61

  6. Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues

    • Dennis Weeks
    Pages 63-70

  7. Parallel real root isolation using the coefficient sign variation method

    • G. E. Collins, J. R. Johnson, W. Küchlin
    Pages 71-87

  8. Very large Gröbner basis calculations

    • Winfried Neun, Herbert Melenk
    Pages 89-99

  9. Boolean Gröbner bases and their MIMD implementation

    • Pascale Senechaud
    Pages 101-114

  10. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Computer Algebra and Parallelism

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation