1.

Record Nr.

UNISA996202526503316

Titolo

Computer Algebra in Scientific Computing [[electronic resource] ] : 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014

ISBN

3-319-10515-9

Edizione

[1st ed. 2014.]

Descrizione fisica

1 online resource (XIV, 502 p. 73 illus.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8660

Disciplina

512.00285

Soggetti

Algorithms

Computer science—Mathematics

Discrete mathematics

Computer graphics

Numerical analysis

Computer arithmetic and logic units

Discrete Mathematics in Computer Science

Symbolic and Algebraic Manipulation

Computer Graphics

Numerical Analysis

Arithmetic and Logic Structures

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Includes index.

Nota di contenuto

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.



Sommario/riassunto

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.