Skip to main content

Computer Algebra in Scientific Computing

14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

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

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

Included in the following conference series:

Conference proceedings info: CASC 2012.

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 (30 papers)

Other volumes

  1. Computer Algebra in Scientific Computing

Keywords

About this book

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems, parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.

Editors and Affiliations

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

    Vladimir P. Gerdt

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

    Wolfram Koepf

  • Institut für Informatik, Lehrstuhl für Effiziente Algorithmen, Technische Universität München, Garching, Germany

    Ernst W. Mayr

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

    Evgenii V. Vorozhtsov

Bibliographic Information

Publish with us