You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book is based on a special course that the author delivered to the Faculty of Mechanics and Mathematics at Moscow University in the academic years 1971/72 and 1972/73. It presents a new and improved version of the method of investigating groups with an identical relation of the form [lowercase italic]x[lowercase italic superscript]n = 1 evolved by P. S. Novikov and the author for solving Burnside's problem on periodic groups, first published in a joint paper. In the interval since the Russian edition was published, the method described has found new applications.
None
Papers celebrating Petr Sergeevič Novikov and his work in descriptive set theory and algorithmic problems of algebra.
This book constitutes the refereed proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 99, held in Trier, Germany in March 1999. The 51 revised full papers presented were selected from a total of 146 submissions. Also included are three invited papers. The volume is divided in topical sections on complexity, parallel algorithms, computational geometry, algorithms and data structures, automata and formal languages, verification, algorithmic learning, and logic in computer science.
Content Description #Dedicated to Wilfried Brauer.#Includes bibliographical references and index.
A Sobolev gradient of a real-valued functional is a gradient of that functional taken relative to the underlying Sobolev norm. This book shows how descent methods using such gradients allow a unified treatment of a wide variety of problems in differential equations. Equal emphasis is placed on numerical and theoretical matters. Several concrete applications are made to illustrate the method. These applications include (1) Ginzburg-Landau functionals of superconductivity, (2) problems of transonic flow in which type depends locally on nonlinearities, and (3) minimal surface problems. Sobolev gradient constructions rely on a study of orthogonal projections onto graphs of closed densely defined linear transformations from one Hilbert space to another. These developments use work of Weyl, von Neumann and Beurling.