000 04127nam a22006015i 4500
001 978-3-319-10515-4
003 DE-He213
005 20200421112220.0
007 cr nn 008mamaa
008 140901s2014 gw | s |||| 0|eng d
020 _a9783319105154
_9978-3-319-10515-4
024 7 _a10.1007/978-3-319-10515-4
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aComputer Algebra in Scientific Computing
_h[electronic resource] :
_b16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings /
_cedited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXIV, 502 p. 73 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8660
505 0 _aRelation 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.
520 _aThis 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�obner 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.
650 0 _aComputer science.
650 0 _aArithmetic and logic units, Computer.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aComputer Graphics.
650 2 4 _aNumeric Computing.
650 2 4 _aArithmetic and Logic Structures.
700 1 _aGerdt, Vladimir P.
_eeditor.
700 1 _aKoepf, Wolfram.
_eeditor.
700 1 _aSeiler, Werner M.
_eeditor.
700 1 _aVorozhtsov, Evgenii V.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319105147
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8660
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-10515-4
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57365
_d57365