Skip to main content
Book cover

Computer Algebra in Scientific Computing

16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings

  • Conference proceedings
  • © 2014

Overview

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CASC 2014.

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

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

Table of contents (35 papers)

Other volumes

  1. Computer Algebra in Scientific Computing

Keywords

About this book

This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book.
The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.

Editors and Affiliations

  • Laboratory of Information Technologies (LIT), Joint Institute for Nuclear Research, Dubna, Russia

    Vladimir P. Gerdt

  • Institut für Mathematik, Universität Kassel, Kassel, Germany

    Wolfram Koepf, Werner M. Seiler

  • Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Bibliographic Information

Publish with us