Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Minimax Algebra
A number of different problems of interest to the operational researcher and the mathematical economist - for example, certain problems of optimization on graphs and networks, of machine-scheduling, of convex analysis and of approx imation theory - can be formulated in a convenient way using the algebraic structure (R,$,@) where we may think of R as the (extended) real-number system with the binary combining operations x$y, x®y defined to be max(x,y),(x+y) respectively. The use of this algebraic structure gives these problems the character of problems of linear algebra, or linear operator theory. This fact hB.s been independently discovered by a number of people working in various fields an...
Algebraic and Combinatorial Methods in Operations Research
For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability.Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.
Max-linear Systems: Theory and Algorithms
Recent years have seen a significant rise of interest in max-linear theory and techniques. Specialised international conferences and seminars or special sessions devoted to max-algebra have been organised. This book aims to provide a first detailed and self-contained account of linear-algebraic aspects of max-algebra for general (that is both irreducible and reducible) matrices. Among the main features of the book is the presentation of the fundamental max-algebraic theory (Chapters 1-4), often scattered in research articles, reports and theses, in one place in a comprehensive and unified form. This presentation is made with all proofs and in full generality (that is for both irreducible and reducible matrices). Another feature is the presence of advanced material (Chapters 5-10), most of which has not appeared in a book before and in many cases has not been published at all. Intended for a wide-ranging readership, this book will be useful for anyone with basic mathematical knowledge (including undergraduate students) who wish to learn fundamental max-algebraic ideas and techniques. It will also be useful for researchers working in tropical geometry or idempotent analysis.
A Guide to the Literature on Semirings and their Applications in Mathematics and Information Sciences
This volume presents a short guide to the extensive literature concerning semir ings along with a complete bibliography. The literature has been created over many years, in variety of languages, by authors representing different schools of mathematics and working in various related fields. In many instances the terminology used is not universal, which further compounds the difficulty of locating pertinent sources even in this age of the Internet and electronic dis semination of research results. So far there has been no single reference that could guide the interested scholar or student to the relevant publications. This book is an attempt to fill this gap. My interest in the theory of semir...
Linear and Combinatorial Optimization in Ordered Algebraic Structures
Linear and Combinatorial Optimization in Ordered Algebraic Structures
Linear Algebra
Linear algebra occupies a central place in modern mathematics. Also, it is a beautiful and mature field of mathematics, and mathematicians have developed highly effective methods for solving its problems. It is a subject well worth studying for its own sake. This book contains selected topics in linear algebra, which represent the recent contributions in the most famous and widely problems. It includes a wide range of theorems and applications in different branches of linear algebra, such as linear systems, matrices, operators, inequalities, etc. It continues to be a definitive resource for researchers, scientists and graduate students.
Idempotent Analysis and Its Applications
The first chapter deals with idempotent analysis per se . To make the pres- tation self-contained, in the first two sections we define idempotent semirings, give a concise exposition of idempotent linear algebra, and survey some of its applications. Idempotent linear algebra studies the properties of the semirn- ules An , n E N , over a semiring A with idempotent addition; in other words, it studies systems of equations that are linear in an idempotent semiring. Pr- ably the first interesting and nontrivial idempotent semiring , namely, that of all languages over a finite alphabet, as well as linear equations in this sern- ing, was examined by S. Kleene [107] in 1956 . This noncommutative se...
Coping with Complexity: Model Reduction and Data Analysis
This volume contains the extended version of selected talks given at the international research workshop "Coping with Complexity: Model Reduction and Data Analysis", Ambleside, UK, August 31 – September 4, 2009. The book is deliberately broad in scope and aims at promoting new ideas and methodological perspectives. The topics of the chapters range from theoretical analysis of complex and multiscale mathematical models to applications in e.g., fluid dynamics and chemical kinetics.
Graphs, Dioids and Semirings
The primary objective of this essential text is to emphasize the deep relations existing between the semiring and dioïd structures with graphs and their combinatorial properties. It does so at the same time as demonstrating the modeling and problem-solving flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures which either extend usual algebra or form a new branch of it.
