Matrix Partial Orders

The present monograph on matrix partial orders, appearing for the first time, is a unique presentation of many partial orders on matrices that have fascinated mathematicians for their beauty and appli

Data mining essentially relies on several mathematical disciplines, many of which are presented in this second edition of this book. Topics include partially ordered sets, combinatorics, general topol

Data mining essentially relies on several mathematical disciplines, many of which are presented in this second edition of this book. Topics include partially ordered sets, combinatorics, general topol

Pedagogical insights gained through 30 years of teaching applied mathematics led the author to write this set of student oriented books. Topics such as complex analysis, matrix theory, vector and tens

Covering processes formed by systems of partial derivative equations (PDEs), including systems of ordinary differential equations (ODEs), this book interprets and uses the matrix of partial derivative

This book synthesizes such tools as Hamilton–Jacobi–Isaacs partial differential inequalities and Linear Matrix Inequalities to focus on electromechanical applications with nonsmooth phenomena caused b

This book examines the theory of boundary value problems for elliptic systems of partial differential equations, a theory which has many applications in mathematics and the physical sciences. The aim is to 'algebraize' the index theory by means of pseudo-differential operators and methods in the spectral theory of matrix polynomials. This latter theory provides important tools that will enable the student to work efficiently with the principal symbols of the elliptic and boundary operators on the boundary. This book is ideal for use in graduate-level courses on partial differential equations, elliptic systems, pseudo-differential operators and matrix analysis. Since many new methods and results are introduced and used throughout the book, all the theorems are proved in detail, and the methods are well illustrated through numerous examples and exercises.

This book examines the theory of boundary value problems for elliptic systems of partial differential equations, a theory which has many applications in mathematics and the physical sciences. The aim is to 'algebraize' the index theory by means of pseudo-differential operators and methods in the spectral theory of matrix polynomials. This latter theory provides important tools that will enable the student to work efficiently with the principal symbols of the elliptic and boundary operators on the boundary. This book is ideal for use in graduate-level courses on partial differential equations, elliptic systems, pseudo-differential operators and matrix analysis. Since many new methods and results are introduced and used throughout the book, all the theorems are proved in detail, and the methods are well illustrated through numerous examples and exercises.

First published in 1983, this textbook introduces the finite-element method as an important general technique in engineering mathematics. It is written for students who have already completed a general course of vector calculus, matrix algebra and partial differential equations. The treatment introduced in this book will provide a secure foundation for more specialised work. Each chapter includes worked examples, many of which contain important applications and generalisations of the ideas in the main body of the text. The book is principally aimed at engineering students.

This unique book on modern topology looks well beyond traditional treatises and explores spaces that may, but need not, be Hausdorff. This is essential for domain theory, the cornerstone of semantics of computer languages, where the Scott topology is almost never Hausdorff. For the first time in a single volume, this book covers basic material on metric and topological spaces, advanced material on complete partial orders, Stone duality, stable compactness, quasi-metric spaces and much more. An early chapter on metric spaces serves as an invitation to the topic (continuity, limits, compactness, completeness) and forms a complete introductory course by itself. Graduate students and researchers alike will enjoy exploring this treasure trove of results. Full proofs are given, as well as motivating ideas, clear explanations, illuminating examples, application exercises and some more challenging problems for more advanced readers.

This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.

This book examines the way in which the central English government dealt with Irish ecclesiastical matters from the time of the invasion and partial conquest of Ireland by Henry II in 1171 up to the Statute of Kilkenny. The struggle involved the king, the clergy in Ireland, both Irish and English, and the pope. Using manuscript material and printed sources, which have not been previously used for this purpose, Dr Watt shows how an attempt was made to 'colonize' Ireland by ecclesiastical means, and traces the changing fates and fortunes of the 'two nations' in their relations with one another. Dr Watt also deals very fully with the rôle played in the struggle by the religious orders, particularly the Cistercians and the friars, and with the effect which the English common law had on the Irish clergy.

This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.

This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. "Safe" - that is, paradox-free - informal set theory is introduced following on the heels of Russell's Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor's diagonalisation technique. Predicate logic "for the user" is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations i

A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students a