This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2013, held in Berlin, Germany, in September 2013. The 33 full papers presented were carefully reviewed and selected for inclusion in this book.
The papers address issues such as polynomial algebra; the solution of tropical linear systems and tropical polynomial systems; the theory of matrices; the use of computer algebra for the investigation of various mathematical and applied topics related to ordinary differential equations (ODEs); applications of symbolic computations for solving partial differential equations (PDEs) in mathematical physics; problems arising at the application of computer algebra methods for finding infinitesimal symmetries; applications of symbolic and symbolic-numeric algorithms in mechanics and physics; automatic differentiation; the application of the CAS Mathematica for the simulation of quantum error correction in quantum computing; the application of the CAS GAP for the enumeration of Schur rings over the group A5; constructive computation of zero separation bounds for arithmetic expressions; the parallel implementation of fast Fourier transforms with the aid of the Spiral library generation system; the use of object-oriented languages such as Java or Scala for implementation of categories as type classes; a survey of industrial applications of approximate computer algebra.
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 Grobner and involutive systems, parallelization of the Grobner 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.
