Computer Algebra in Scientific Computing -

Computer Algebra in Scientific Computing

16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings
Buch | Softcover
XIV, 502 Seiten
2014 | 2014
Springer International Publishing (Verlag)
978-3-319-10514-7 (ISBN)
77,04 inkl. MwSt
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.

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

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.

Erscheint lt. Verlag 19.8.2014
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XIV, 502 p. 73 illus.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 783 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • applications to natural sciences and engineering • automated reasoning • Complexity • complexity computability • Computer Algebra Systems • design and analysis of algorithms • Differential Equations • holonomic functions • Logic • long integers • mathematical software • Modeling and Simulation • numerical analyis • Parallel Algorithms • Polynomial factorization • quantum computation theory • symbolic and algebraic algorithms
ISBN-10 3-319-10514-0 / 3319105140
ISBN-13 978-3-319-10514-7 / 9783319105147
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99