Computer Algebra in Scientific Computing: 16th International Workshop, Casc 2014, Warsaw, Poland, September 8-12, 2014. Proceedings

ISBN-13: 9783319105147 / Angielski / Miękka / 2014 / 502 str.

Vladimir P. Gerdt; Wolfram Koepf; Werner M. Seiler

Opis

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 Grobner 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.

Spis treści

Relation Algebra, RelView, and Plurality Voting .- An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data.- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.- Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values.- Finding a Deterministic Generic Position for an Algebraic Space Curve.- Computer Algebra Experimentation.- On the Parallelization of Subproduct Tree Techniques Targeting.- Many-core Architectures.- Deterministically Computing Reduction Numbers of Polynomial Ideals.

O autorze

Dr. Wolfram Koepf ist im Fachbereich Informatik/Mathematik/Naturwissenschaften der Hochschule für Technik, Wirtschaft und Kultur in Leipzig tätig.

Blurb

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.