Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia,

Computer Algebra in Scientific Computing

14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings

Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (Eds.)

2012, XIV, 363 p. 42 illus.

Available Formats:

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.


(net) price for USA

ISBN 978-3-642-32973-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-32972-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book.

One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems,
parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.

Content Level » Research

Keywords » complexity - holonomic functions - long integers - parallel algorithms - polynomial factorization

Related subjects » Hardware - Image Processing - Theoretical Computer Science

Table of contents 

On Polynomial Solutions of Linear Partial Differential and (q-)Difference Equations.- An Algebraic Characterization of Rainbow Connectivity.- Application of the Method of Asymptotic Solution to One Multi-Parameter Problem.- A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers.- Lightweight Abstraction for Mathematical Computation in Java.- Calculation of Normal Forms of the Euler–Poisson Equations.- Stability of Equilibrium Positions in the Spatial Circular Restricted Four-Body Problem.- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates.- Comprehensive Involutive Systems.- A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials.- The Resonant Center Problem for a 2:-3 Resonant Cubic Lotka–Volterra System.- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics Symbolic-Numerical Calculations of.- High-|m| Rydberg States and Decay Rates in Strong Magnetic Fields.- Quasi-stability versus Genericity.- Invariant Theory: Applications and Computations (Invited Talk).- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems.- On Fulton’s Algorithm for Computing Intersection Multiplicities.- A Note on the Space Complexity of Fast D-Finite Function Evaluation.- Inversion Modulo Zero-Dimensional Regular Chains.- Sparse Polynomial Powering Using Heaps.- Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems.- Parallel Reduction of Matrices in Gr¨obner Bases Computations.- Real and Complex Polynomial Root-Finding by Means of Eigen-Solving.- Root-Refining for a Polynomial Equation.- PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks.- Approximately Singular Systems and Ill-Conditioned Polynomial Systems.- Symbolic-Numeric Implementation of the Method of Collocations and Least Squares for 3D Navier–Stokes Equations.- Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems.- Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization.- Usage of Modular Techniques for Efficient Computation of Ideal Operations (Invited Talk).

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.