Titlebook: Computer Algebra in Scientific Computing; 13th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20

生存環(huán)境

Fast and Robust Symbolic Model Order Reduction with , equations accelerates the simulation of the reference system as well as the verification of the reduced models. Furthermore, it increases the robustness of the solver permitting analyzes of significantly larger symbolic systems. As example, a voltage controller circuit is reduced using the introduced methods.

NEX

0302-9743 ernational 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

Initial

malapropism

骨

Hadhami Garbouge,Pejman Rasti,David Rousseauntifier elimination problem over the ordered field of the reals we provide case studies of some systems arising in the life sciences. We discuss the use of simple conservation constraints and the use of parametric constraints for describing simple convex polytopes on which periodic orbits can be excluded by Muldowney’s criteria.

dialect

Topology of Families of Implicit Algebraic Surfaces Depending on a Parameter, invariant, in the sense that the topology of the family can be described by means of the same simplicial complex. As a consequence, by applying known algorithms ([1], [6], [7], [11]) the different shapes in the family can be computed. The algorithm is due to a generalization of the ideas in [2] to the surface case.

forebear

Semi-algebraic Description of the Equilibria of Dynamical Systems,a, their Hopf bifurcations. To this end, we revisit various criteria on sign conditions for the roots of a real parametric univariate polynomial. In addition, we introduce the notion of . of a semi-algebraic system and demonstrate that it is well adapted for our study.

委派

GRILL

Aviary

https://doi.org/10.1007/978-1-4471-1977-7models of simple games and develop relational algorithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Algebra system . and, therefore, the system can be used to solve the problems and to visualize the results of the computations.