Cantitate/Preț
Produs

Computer Algebra in Scientific Computing: 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011. Proceedings: Lecture Notes in Computer Science, cartea 6885

Editat de Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
en Limba Engleză Paperback – 26 aug 2011
This book constitutes the refereed proceedings of the 13th International Workshop on Computer Algebra in Scientific Computing, CASC 2011, held in Kassel, Germany, in September 2011. The 26 full papers included in the book were carefully reviewed and selected from numerous submissions. The articles are organized in topical sections on the development of object oriented computer algebra software for the modeling of algebraic structures as typed objects; matrix algorithms; the investigation with the aid of computer algebra; the development of symbolic-numerical algorithms; and the application of symbolic computations in applied problems of physics, mechanics, social science, and engineering.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (4) 32181 lei  3-5 săpt.
  Springer Berlin, Heidelberg – 18 aug 2010 32181 lei  3-5 săpt.
  Springer Berlin, Heidelberg – 26 aug 2011 32341 lei  6-8 săpt.
  Springer – 26 iul 2012 32525 lei  6-8 săpt.
  Springer – 11 sep 2013 32935 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32341 lei

Preț vechi: 40426 lei
-20% Nou

Puncte Express: 485

Preț estimativ în valută:
5722 6666$ 4997£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642235672
ISBN-10: 3642235670
Pagini: 370
Ilustrații: XI, 359 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.52 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 13th International Workshop on Computer Algebra in Scientific Computing, CASC 2011, held in Kassel, Germany, in September 2011. The 26 full papers included in the book were carefully reviewed and selected from numerous submissions. The articles are organized in topical sections on the development of object oriented computer algebra software for the modeling of algebraic structures as typed objects; matrix algorithms; the investigation with the aid of computer algebra; the development of symbolic-numerical algorithms; and the application of symbolic computations in applied problems of physics, mechanics, social science, and engineering.

Caracteristici

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

Cuprins

On Polynomial Solutions of Linear Partial Differential and (q-)DifferenceEquations.- 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 SomeInsight 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 FunctionEvaluation.- 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 Methodsfor 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.- VerifiableConditions on Asymptotic Stabilisability for a Classof 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).