Mikael Passare

V. Bykov

A. Kytmanov

M. Lazman

The subject of this book is connected with a new direction in mathematics, which has been actively developed over the last few years, namely the field of polynomial computer algebra, which lies at the intersection point of algebra, mathematical analysis and programming. There were several incentives to write the book. First of all, there has lately been a considerable interest in applied nonlinear problems characterized by multiple sta tionary states. Practical needs have then in their turn led to the appearance of new theoretical results in the analysis of systems of nonlinear algebraic equations. And finally, the introduction of various computer packages for analytic manipulations has made it possible to use complicated elimination-theoretical algorithms in prac tical research. The structure of the book is accordingly represented by three main parts: Mathematical results driven to constructive algorithms, computer algebra realizations of these algorithms, and applications. Nonlinear systems of algebraic equations arise in diverse fields of science. In particular, for processes described by systems of differential equations with a poly nomial right hand side one is faced with the problem of determining the number (and location) of the stationary states in certain sets.

Elimination Methods in Polynomial Computer Algebra

Ilia Itenberg

Burglind Jöricke

The articles in this volume are invited papers from the Marcus Wallenberg symposium and focus on research topics that bridge the gap between analysis, geometry, and topology. The encounters between these three fields are widespread and often provide impetus for major breakthroughs in applications. Topics include new developments in low dimensional topology related to invariants of links and three and four manifolds; Perelman's spectacular proof of the Poincare conjecture; and the recent advances made in algebraic, complex, symplectic, and tropical geometry.

Mikael Passare

About

Books

Join the club