Computer Algebra in Scientific Computing : 14th International Workshop, CASC 2012, Maribor, Slovenia, September 36, 2012, Proceedings / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov.
 Edition:
 1st ed. 2012.
 Publication:
 Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
 Series:
 Computer Science (Springer11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 7442
Theoretical Computer Science and General Issues ; 7442  Format/Description:
 Book
1 online resource (XIV, 363 pages) : 42 illustrations  Subjects:
 Algorithms.
Computer scienceMathematics.
Computer graphics.
Numerical analysis.
Computer arithmetic and logic units.  Local subjects:
 Algorithm Analysis and Problem Complexity. (search)
Discrete Mathematics in Computer Science. (search)
Symbolic and Algebraic Manipulation. (search)
Computer Graphics. (search)
Numeric Computing. (search)
Arithmetic and Logic Structures. (search)  System Details:
 text file PDF
 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 Gröbner and involutive systems, parallelization of the Gröbner 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.
 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 MultiParameter 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 EulerPoisson Equations
Stability of Equilibrium Positions in the Spatial Circular Restricted FourBody Problem
Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
Comprehensive Involutive Systems
A PolynomialTime Algorithm for the Jacobson Form of a Matrix of Ore Polynomials
The Resonant Center Problem for a 2:3 Resonant Cubic LotkaVolterra System
Complexity of Solving Systems with Few Independent Monomials and Applications to MassAction Kinetics SymbolicNumerical Calculations of
Highm Rydberg States and Decay Rates in Strong Magnetic Fields
Quasistability versus Genericity
Invariant Theory: Applications and Computations (Invited Talk)
Local Generic Position for Root Isolation of ZeroDimensional Triangular Polynomial Systems
On Fulton's Algorithm for Computing Intersection Multiplicities
A Note on the Space Complexity of Fast DFinite Function Evaluation
Inversion Modulo ZeroDimensional 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 RootFinding by Means of EigenSolving
RootRefining for a Polynomial Equation
PoCaB: A Software Infrastructure to Explore Algebraic Methods for Biochemical Reaction Networks
Approximately Singular Systems and IllConditioned Polynomial Systems
SymbolicNumeric Implementation of the Method of Collocations and Least Squares for 3D NavierStokes 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).  Contributor:
 Gerdt, V. P., editor., Editor,
Koepf, Wolfram, editor., Editor,
Mayr, Ernst, editor., Editor,
Vorozhtsov, Evgenii V. editor., Editor,
SpringerLink (Online service)  Contained In:
 Springer eBooks
 Other format:
 Printed edition:
Printed edition:  ISBN:
 9783642329739
9783642329739  Publisher Number:
 10.1007/9783642329739 doi
 Access Restriction:
 Restricted for use by site license.

Loading...
Location  Notes  Your Loan Policy 

Description  Status  Barcode  Your Loan Policy 
