Computer Algebra in Scientific Computing: 12th International Workshop, CASC 2010, Tsakhkadzor, Armenia, September 6-12, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The CASC Workshops are traditionally held in turn in the Commonwealth of IndependentStates(CIS)andoutsideCIS(Germanyinparticular,but,attimes, also other countries with lively CA communities). The previous CASC Wo- shop was held in Japan, and the 12th workshop was held for the ?rst time in Armenia, which is one of the CIS republics. It should be noted that more than 35 institutes and scienti?c centers function within the National Academy of S- ences of Armenia (further details concerning the structure of the academy can be foundhttp://www. sci. am). These institutions are concerned, in particular, with problems in such branches of natural science as mathematics, informatics, physics, astronomy, biochemistry, etc. It follows from the talks presented at the previous CASC workshops that the methods and systems of computer algebra may be applied successfully in all the above-listed branches of natural sciences. Therefore, the organizers of the 12th CASC Workshop hope that the present workshop will help the Armenian scientists to become even more familiar with the capabilities of advanced computer algebra methods and systems and to get in touch with specialists in computer algebra from other countries. The 11 earlier CASC conferences, CASC 1998, CASC 1999, CASC 2000, CASC 2001, CASC 2002, CASC 2003, CASC 2004, CASC 2005, CASC 2006, CASC 2007, and CASC 2009 were held, respectively, in St. Petersburg (R- sia), Munich (Germany), Samarkand (Uzbekistan), Konstanz (Germany), Yalta (Ukraine), Passau (Germany), St.

Author(s): Sergey Abrahamyan (auth.), Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Series: Lecture Notes in Computer Science 6244 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 304
Tags: Symbolic and Algebraic Manipulation; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Computer Graphics; Numeric Computing; Arithmetic and Logic Structures

Front Matter....Pages -
Construction of Irreducible Polynomials over Finite Fields....Pages 1-3
Factorization of Polynomials and GCD Computations for Finding Universal Denominators....Pages 4-18
A Role of Symbolic Computations in Beam Physics....Pages 19-30
Thomas Decomposition of Algebraic and Differential Systems....Pages 31-54
On Multivariate Homogeneous Polynomial Decomposition....Pages 55-60
Computing Matrix Representations of Filiform Lie Algebras....Pages 61-72
Type Specialization in Aldor....Pages 73-84
An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models....Pages 85-96
On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary Point....Pages 97-105
Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models....Pages 106-122
On Reduction of Lagrange Systems....Pages 123-133
Series Transformations to Improve and Extend Convergence....Pages 134-147
Differential Resultant, Computer Algebra and Completely Integrable Dynamical Systems....Pages 148-161
Generic, Type-Safe and Object Oriented Computer Algebra Software....Pages 162-177
Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden....Pages 178-193
Fast Generalized Bruhat Decomposition....Pages 194-202
Computational Science in Armenia (Invited Talk)....Pages 203-203
From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk)....Pages 204-204
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests....Pages 205-219
Term Cancellations in Computing Floating-Point Gröbner Bases....Pages 220-231
One Class of Third-Order Linear ODE’s....Pages 232-237
GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials....Pages 238-249
Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange–Burmann Expansions....Pages 250-266
Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)....Pages 267-279
An Analytical Model for the Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in Concrete....Pages 280-292
Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases....Pages 293-302
Back Matter....Pages -