Computer Algebra in Scientific Computing

1. Front Matter

   PDF

2. Computable Infinite Power Series in the Role of Coefficients of Linear Differential Systems

   • Sergei A. Abramov, Moulay A. Barkatou

   Pages 1-12

3. Relation Algebra, RelView, and Plurality Voting

   • Rudolf Berghammer

   Pages 13-27

4. An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data

   • François Boulier, Anja Korporal, François Lemaire, Wilfrid Perruquetti, Adrien Poteaux, Rosane Ushirobira

   Pages 28-43

5. Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains

   • Russell Bradford, Changbo Chen, James H. Davenport, Matthew England, Marc Moreno Maza, David Wilson

   Pages 44-58

6. Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values

   • Jorge Caravantes, Mario Fioravanti, Laureano Gonzalez–Vega, Ioana Necula

   Pages 59-73

7. Finding a Deterministic Generic Position for an Algebraic Space Curve

   • Jin-San Cheng, Kai Jin

   Pages 74-84

8. Optimal Estimations of Seiffert-Type Means By Some Special Gini Means

   • Iulia Costin, Gheorghe Toader

   Pages 85-98

9. CAS Application to the Construction of High-Order Difference Schemes for Solving Poisson Equation

   • Grigoriy M. Drozdov, Vasily P. Shapeev

   Pages 99-110

10. On Symbolic Solutions of Algebraic Partial Differential Equations

    • Georg Grasegger, Alberto Lastra, J. Rafael Sendra, Franz Winkler

    Pages 111-120

11. Eigenvalue Method with Symmetry and Vibration Analysis of Cyclic Structures

    • Aurelien Grolet, Philippe Malbos, Fabrice Thouverez

    Pages 121-137

12. Symbolic-Numerical Solution of Boundary-Value Problems with Self-adjoint Second-Order Differential Equation Using the Finite Element Method with Interpolation Hermite Polynomials

    • Alexander A. Gusev, Ochbadrakh Chuluunbaatar, Sergue I. Vinitsky, Vladimir L. Derbov, Andrzej Góźdź, Luong Le Hai et al.

    Pages 138-154

13. Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation

    • Štefan Gyürki, Mikhail Klin

    Pages 155-170

14. On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures

    • Sardar Anisul Haque, Farnam Mansouri, Marc Moreno Maza

    Pages 171-185

15. Deterministically Computing Reduction Numbers of Polynomial Ideals

    • Amir Hashemi, Michael Schweinfurter, Werner M. Seiler

    Pages 186-201

16. A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields

    • Jonathan D. Hauenstein, Victor Y. Pan, Agnes Szanto

    Pages 202-217

17. Invariant Manifolds in the Classic and Generalized Goryachev–Chaplygin Problem

    • Valentin Irtegov, Tatyana Titorenko

    Pages 218-229

18. Coherence and Large-Scale Pattern Formation in Coupled Logistic-Map Lattices via Computer Algebra Systems

    • Maciej Janowicz, Arkadiusz Orłowski

    Pages 230-241

19. On the Computation of the Determinant of a Generalized Vandermonde Matrix

    • Takuya Kitamoto

    Pages 242-255

20. Towards Conflict-Driven Learning for Virtual Substitution

    • Konstantin Korovin, Marek Kos̆ta, Thomas Sturm

    Pages 256-270

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.

• 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
• algorithm analysis and problem complexity

• Laboratory of Information Technologies (LIT), Joint Institute for Nuclear Research, Dubna, Russia

  Vladimir P. Gerdt

• Institut für Mathematik, Universität Kassel, Kassel, Germany

  Wolfram Koepf, Werner M. Seiler

• Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, Novosibirsk, Russia

  Evgenii V. Vorozhtsov

Policies and ethics