Handbook of Approximation Algorithms and Metaheuristics,
Старое издание
Автор: Komornik, Vilmos Название: Topology, calculus and approximation ISBN: 1447173155 ISBN-13(EAN): 9781447173151 Издательство: Springer Рейтинг: Цена: 4890.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejer, Stieltjes, and Turan.
The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Caratheodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure and applied mathematics, as well as physics and engineering should find this textbook useful. Only basic results of one-variable calculus and linear algebra are used, and simple yet pertinent examples and exercises illustrate the usefulness of most theorems. Many of these examples are new or difficult to locate in the literature, and so the original sources of most notions and results are given to help readers understand the development of the field.
Описание: <p>This book concentrates on the mathematics of photonic crystals, which form an important class of physical structures investigated in nanotechnology. Photonic crystals are materials which are composed of two or more different dielectrics or metals, and which exhibit a spatially periodic structure, typically at the length scale of hundred nanometers.</p><p>In the mathematical analysis and the numerical simulation of the partial differential equations describing nanostructures, several mathematical difficulties arise, e. g., the appropriate treatment of nonlinearities, simultaneous occurrence of continuous and discrete spectrum, multiple scales in space and time, and the ill-posedness of these problems.</p><p>This volume collects a series of lectures which introduce into the mathematical background needed for the modeling and simulation of light, in particular in periodic media, and for its applications in optical devices.</p>
Автор: G?rtner, Matousek Название: Approximation Algorithms and Semidefinite Programming ISBN: 3642220142 ISBN-13(EAN): 9783642220142 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
Автор: Christos Kaklamanis; Martin Skutella Название: Approximation and Online Algorithms ISBN: 3540779175 ISBN-13(EAN): 9783540779179 Издательство: Springer Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
