Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (Eds.)
2010, XIV, 304p. 48 illus..
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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.
Construction of Irreducible Polynomials over Finite Fields.- Factorization of Polynomials and GCD Computations for Finding Universal Denominators.- A Role of Symbolic Computations in Beam Physics.- Thomas Decomposition of Algebraic and Differential Systems.- On Multivariate Homogeneous Polynomial Decomposition.- Computing Matrix Representations of Filiform Lie Algebras.- Type Specialization in Aldor.- An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models.- On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary Point.- Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models.- On Reduction of Lagrange Systems.- Series Transformations to Improve and Extend Convergence.- Differential Resultant, Computer Algebra and Completely Integrable Dynamical Systems.- Generic, Type-Safe and Object Oriented Computer Algebra Software.- Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden.- Fast Generalized Bruhat Decomposition.- Computational Science in Armenia (Invited Talk).- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk).- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests.- Term Cancellations in Computing Floating-Point Gröbner Bases.- One Class of Third-Order Linear ODE’s.- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials.- Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange–Burmann Expansions.- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk).- An Analytical Model for the Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in Concrete.- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases.