Formal Algorithmic Elimination for PDEs, Daniel Robertz

Автор: Peter Seibt
Название: Algorithmic Information Theory
ISBN: 3642069789 ISBN-13(EAN): 9783642069789
Издательство: Springer
Рейтинг:
Цена: 25853.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics.

Автор: Moulay Barkatou; Thomas Cluzeau; Georg Regensburge
Название: Algebraic and Algorithmic Aspects of Differential and Integral Operators
ISBN: 3642544789 ISBN-13(EAN): 9783642544781
Издательство: Springer
Рейтинг:
Цена: 6708.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constructions of Free Commutative Integro-Differential Algebras.- Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras.- Operational Calculi for Nonlocal Cauchy Problems in Resonance Cases.- Intertwining Laplace Transformations of Linear Partial Differential Equations.- Composing and Factoring Generalized Green's Operators and Ordinary Boundary Problems.- Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II.- Multivariate Dimension Polynomials of Inversive Difference Field Extensions.- Differential (Monoid) Algebra and More.- Exact Solution of Local and Nonlocal BVPs for the Laplace Equation in a Rectangle.

Автор: Javier Aramayona; Volker Diekert; Christopher J. L
Название: Algorithmic and Geometric Topics Around Free Groups and Automorphisms
ISBN: 3319609394 ISBN-13(EAN): 9783319609393
Издательство: Springer
Рейтинг:
Цена: 3492.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

This volume presents the lecture notes from the authors' three summer courses offered during the program "Automorphisms of Free Groups: Geometry, Topology, and Dynamics," held at the Centre de Recerca Matem tica (CRM) in Bellaterra, Spain.

The first two chapters present the basic tools needed, from formal language theory (regular and context-free languages, automata, rewriting systems, transducers, etc) and emphasize their connections to group theory, mostly relating to free and virtually-free groups. The material covered is sufficient to present full proofs of many of the existing interesting characterizations of virtually-free groups. In turn, the last chapter comprehensively describes Bonahon's construction of Thurston's compactification of Teichm ller space in terms of geodesic currents on surfaces. It also includes several intriguing extensions of the notion of geodesic current to various other, more general settings.

Автор: Stefan Hougardy; Jens Vygen
Название: Algorithmic Mathematics
ISBN: 3319395572 ISBN-13(EAN): 9783319395579
Издательство: Springer
Рейтинг:
Цена: 6288.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++.This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this 'Algorithmic Mathematics' course at the University of Bonn several times in recent years.

Автор: Gerhard Nierhaus
Название: Algorithmic Composition
ISBN: 3211999159 ISBN-13(EAN): 9783211999158
Издательство: Springer
Рейтинг:
Цена: 11878.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic composition - composing by means of formalizable methods - has a century old tradition not only in occidental music history. Topics covered are: markov models, generative grammars, transition networks, chaos and self-similarity, genetic algorithms, cellular automata, neural networks and artificial intelligence are covered.

Автор: Mikhail Klin; Gareth A. Jones; Aleksandar Jurisic;
Название: Algorithmic Algebraic Combinatorics and Gr?bner Bases
ISBN: 3642424384 ISBN-13(EAN): 9783642424380
Издательство: Springer
Рейтинг:
Цена: 23058.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries. There is special emphasis on algorithmic aspects and the use of the theory of Grobner bases.

Автор: V. Bykov; A. Kytmanov; M. Lazman; Mikael Passare
Название: Elimination Methods in Polynomial Computer Algebra
ISBN: 9401062307 ISBN-13(EAN): 9789401062305
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Rodney G. Downey; Denis R. Hirschfeldt
Название: Algorithmic Randomness and Complexity
ISBN: 1493938207 ISBN-13(EAN): 9781493938209
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Exploring the theory of computability and complexity over the real numbers, this book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists working in diverse fields concerned with theoretical computer science.

Автор: Ulrich Faigle; W. Kern; G. Still
Название: Algorithmic Principles of Mathematical Programming
ISBN: 9048161177 ISBN-13(EAN): 9789048161171
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.
The book is equally suited for self-study for a motivated beginner and for a comprehensive course on the principles of mathematical programming within an applied mathematics or computer science curriculum at advanced undergraduate or graduate level. The presentation of the material is such that smaller modules on discrete optimization, linear programming, and nonlinear optimization can easily be extracted separately and used for shorter specialized courses on these subjects.

Автор: Backhouse
Название: Algorithmic Problem Solving
ISBN: 0470684534 ISBN-13(EAN): 9780470684535
Издательство: Wiley
Рейтинг:
Цена: 6962.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: * Novel approach to the mathematics of problem solving, in particular how to do logical calculations. * Many of the problems are well-known from (mathematical) puzzle books. * The solution method in the book is new and more relevant to the true nature of problem solving in the modern IT-dominated world.

Автор: Murty Katta Gopalakrishna
Название: Computational And Algorithmic Linear Algebra And N-Dimensional Geometry
ISBN: 9814366625 ISBN-13(EAN): 9789814366625
Издательство: World Scientific Publishing
Рейтинг:
Цена: 16790.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Deals with Linear Algebra and n-Dimensional Geometry. This title is suitable for sophomore level undergraduates in mathematics, engineering, business, and the sciences.

Автор: Leonard M. Adleman; Ming-Deh Huang
Название: Algorithmic Number Theory
ISBN: 3540586911 ISBN-13(EAN): 9783540586913
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume contains the refereed proceedings of the 1st Algorithmic Number Theory Symposium, held at Cornell University, New York, USA in May 1994. The contributors address algorithmic, computational and complexity-theoretical aspects, and contribute to cryptology research.