Computer Algebra in Scientific Computing [electronic resource] : 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov.
Material type:
TextLanguage: English Series: Lecture Notes in Computer Science ; 7442Publication details: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.Description: 1 online resource (XIV, 363 p. 42 ill.)ISBN: - 9783642329739
| Item type | Current library | Call number | Materials specified | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
|
|
National Library of India | Available | EBK000024051ENG |
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).
There are no comments on this title.
