Series 
Lecture notes in computer science ; 7442 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ;
7442.


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Subject 
Computer science  Mathematics  Congresses.


Science  Data processing  Congresses.

Alt Name 
Gerdt, V. P.

Add Title 
CASC 2012 
Description 
1 online resource. 
Contents 
On Polynomial Solutions of Linear Partial Differential and (q )Difference Equations / S.A. Abramov and M. Petkovsek  An Algebraic Characterization of Rainbow Connectivity / Prabhanjan Ananth and Ambedkar Dukkipati  Application of the Method of Asymptotic Solution to One MultiParameter Problem / Alexander Batkhin  A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers / Marco Bodrato and Alberto Zanoni  Lightweight Abstraction for Mathematical Computation in Java / Pavel Bourdykine and Stephen M. Watt  Calculation of Normal Forms of the EulerPoisson Equations / Alexander D. Bruno and Victor F. Edneral  Stability of Equilibrium Positions in the Spatial Circular Restricted FourBody Problem / Dzmitry A. Budzko and Alexander N. Prokopenya  Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates / Hassan Errami, Werner M. Seiler, Markus Eiswirth and Andreas Weber  Comprehensive Involutive Systems / Vladimir Gerdt and Amir Hashemi  A PolynomialTime Algorithm for the Jacobson Form of a Matrix of Ore Polynomials / Mark Giesbrecht and Albert Heinle. 

The Resonant Center Problem for a 2:3 Resonant Cubic LotkaVolterra System / Jaume Gine, Colin Christopher, Mateja Presern, Valery G. Romanovski and Natalie L. Shcheglova  Complexity of Solving Systems with Few Independent Monomials and Applications to MassAction Kinetics / Dima Grigoriev and Andreas Weber  SymbolicNumerical Calculations of High(absolute value) m Rydberg States and Decay Rates in Strong Magnetic Fields / Alexander Gusev, Sergue Vinitsky, Ochbadrakh Chuluunbaatar, Vladimir Gerdt and Luong Le Hai, et al.  Quasistability versus Genericity / Amir Hashemi, Michael Schweinfurter and Werner M. Seiler  Invariant Theory: Applications and Computations: (Invited Talk) / Gregor Kemper  Local Generic Position for Root Isolation of ZeroDimensional Triangular Polynomial Systems / Jia Li, JinSan Cheng and Elias P. Tsigaridas  On Fulton's Algorithm for Computing Intersection Multiplicities / Steffen Marcus, Marc Moreno Maza and Paul Vrbik  A Note on the Space Complexity of Fast DFinite Function Evaluation / Marc Mezzarobba  Inversion Modulo ZeroDimensional Regular Chains / Marc Moreno Maza, Eric Schost and Paul Vrbik. 

Sparse Polynomial Powering Using Heaps / Michael Monagan and Roman Pearce  Stability Conditions of Monomial Bases and Comprehensive Grobner Systems / Katsusuke Nabeshima  Parallel Reduction of Matrices in Grobner Bases Computations / Severin Neumann  Real and Complex Polynomial RootFinding by Means of EigenSolving / Victor Y. Pan, Guoliang Qian and AiLong Zheng  RootRefining for a Polynomial Equation / Victor Y. Pan  PoCaB: A Software Infrastructure to Explore Algebraic Methods for Biochemical Reaction Networks / Satya Swarup Samal, Hassan Errami and Andreas Weber  Approximately Singular Systems and IllConditioned Polynomial Systems / Tateaki Sasaki and Daiju Inaba  SymbolicNumeric Implementation of the Method of Collocations and Least Squares for 3D NavierStokes Equations / Vasily P. Shapeev and Evgenii V. Vorozhtsov  Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems / Zhikun She and Haoyang Li  Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization / Jing Yang, Dongming Wang and Hoon Hong  Usage of Modular Techniques for Efficient Computation of Ideal Operations (Invited Talk) / Kazuhiro Yokoyama. 
Note 
International conference proceedings. 
Bibliography Note 
Includes bibliographical references and author index. 
Summary 
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 Grobner and involutive systems, parallelization of the Grobner bases computation, the study of quasistable 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 zerodimensional 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 illconditioned polynomial systems, a method for polynomial rootfinding via eigensolving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps. 
Note 
Print version record. 
ISBN 
9783642329739 (electronic bk.) 

364232973X (electronic bk.) 

9783642329722 

3642329721 
OCLC # 
809252908 
Additional Format 
Print version: Computer algebra in scientific computing. [S.l.] : Springer, 2012 3642329721 (OCoLC)804049338 
