Exact Finite-Difference Schemes is a first overview of the topic also describing the state-of-the-art in this field of numerical analysis. Construction of exact difference schemes for various parabolic and elliptic partial differential equations are discussed, including vibrations and transport problems. After this, applications are discussed, such as the discretisation of ODEs and PDEs and numerical methods for stochastic differential equations. Contents: Basic notation Preliminary results Hyperbolic equations Parabolic equations Use of exact difference schemes to construct NSFD discretizations of differential equations Exact and truncated difference schemes for boundary-value problem Exact difference schemes for stochastic differential equations Numerical blow-up time Bibliography

Primarily concerned with the study of cohomology theories of general topological spaces with "general coefficient systems", the parts of sheaf theory covered here are those areas important to algebraic topology. Among the many innovations in this book, the concept of the "tautness" of a subspace is introduced and exploited; the fact that sheaf theoretic cohomology satisfies the homotopy property is proved for general topological spaces; and relative cohomology is introduced into sheaf theory. A list of exercises at the end of each chapter helps students to learn the material, and solutions to many of the exercises are given in an appendix. This new edition of a classic has been substantially rewritten and now includes some 80 additional examples and further explanatory material, as well as new sections on Cech cohomology, the Oliver transfer, intersection theory, generalised manifolds, locally homogeneous spaces, homological fibrations and p- adic transformation groups. Readers should have a thorough background in elementary homological algebra and in algebraic topology.

Loop groups, the simplest class of infinite dimensional Lie groups, have recently been the subject of intense study. This book gives a complete and self-contained account of what is known about them from a geometrical and analytical point of view, drawing together the many branches of mathematics from which current theory developed--algebra, geometry, analysis, combinatorics, and the mathematics of quantum field theory. The authors discuss Loop groups' applications to simple particle physics and explain how the mathematics used in connection with Loop groups is itself interesting and valuable, thereby making this work accessible to mathematicians in many fields.

Features Written to be self-contained. Ideal as a primary textbook for an undergraduate course in linear algebra. Applications of the general theory which are of interest to disciplines outside of mathematics, such as engineering.

Descriptor linear systems theory is an important part in the general field of control systems theory, and has attracted much attention in the last two decades. In spite of the fact that descriptor linear systems theory has been a topic very rich in content, there have been only a few books on this topic. This book provides a systematic introduction to the theory of continuous-time descriptor linear systems and aims to provide a relatively systematic introduction to the basic results in descriptor linear systems theory. The clear representation of materials and a large number of examples make this book easy to understand by a large audience. General readers will find in this book a comprehensive introduction to the theory of descriptive linear systems. Researchers will find a comprehensive description of the most recent results in this theory and students will find a good introduction to some important problems in linear systems theory.

Linear algebra is one of the most important branches of mathematics - important because of its many applications to other areas of mathematics, and important because it contains a wealth of ideas and results which are basic to pure mathematics. This book gives an introduction to linear algebra, and develops and proves its fundamental properties and theorems taking a pure mathematical approach - linear algebra contains some fine pure mathematics. Its main topics include: vector spaces and algebras, dimension, linear maps, direct sums, and (briefly) exact sequences; matrices and their connections with linear maps, determinants (properties proved using some elementary group theory), and linear equations; Cayley-Hamilton and Jordan theorems leading to the spectrum of a linear map - this provides a geometric-type description of these maps; Hermitian and inner product spaces introducing some metric properties (distance, perpendicularity etc.) into the theory, also unitary and orthogonal maps and matrices; applications to finite fields, mathematical coding theory, finite matrix groups, the geometry of quadratic forms, quaternions and Cayley numbers, and some basic group representation theory; and, a large number of examples, exercises and problems are provided. It gives answers and/or sketch solutions to all of the problems in an appendix -some of these are theoretical and some numerical, both types are important. No particular computer algebra package is discussed but a number of the exercises are intended to be solved using one of these packages chosen by the reader. The approach is pure-mathematical, and the intended readership is undergraduate mathematicians, also anyone who requires a more than basic understanding of the subject. This book will be most useful for a 'second course' in linear algebra, that is for students that have seen some elementary matrix algebra. But as all terms are defined from scratch, this book can be used for a 'first course' for more advanced students.

The monograph is devoted to the investigation of physical processes that govern the phonon transport in bulk and nanoscale single-crystal samples of cubic symmetry. Special emphasis is given to the study of phonon focusing in cubic crystals and its influence on the boundary scattering and lattice thermal conductivity of bulk materials and nanostructures.

Multivariable Calculus with Mathematica is a textbook addressing the calculus of several variables. Instead of just using Mathematica to directly solve problems, the students are encouraged to learn the syntax and to write their own code to solve problems. This not only encourages scientific computing skills but at the same time stresses the complete understanding of the mathematics. Questions are provided at the end of the chapters to test the student's theoretical understanding of the mathematics, and there are also computer algebra questions which test the student's ability to apply their knowledge in non-trivial ways. Features Ensures that students are not just using the package to directly solve problems, but learning the syntax to write their own code to solve problems Suitable as a main textbook for a Calculus III course, and as a supplementary text for topics scientific computing, engineering, and mathematical physics Written in a style that engages the students' interest and encourages the understanding of the mathematical ideas

The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger's algorithm which is one of the important algorithms for constructing Groebner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.

Leibniz Algebras: Structure and Classification is designed to introduce the reader to the theory of Leibniz algebras. Leibniz algebra is the generalization of Lie algebras. These algebras preserve a unique property of Lie algebras that the right multiplication operators are derivations. They first appeared in papers of A.M Blokh in the 1960s, under the name D-algebras, emphasizing their close relationship with derivations. The theory of D-algebras did not get as thorough an examination as it deserved immediately after its introduction. Later, the same algebras were introduced in 1993 by Jean-Louis Loday , who called them Leibniz algebras due to the identity they satisfy. The main motivation for the introduction of Leibniz algebras was to study the periodicity phenomena in algebraic K-theory. Nowadays, the theory of Leibniz algebras is one of the more actively developing areas of modern algebra. Along with (co)homological, structural and classification results on Leibniz algebras, some papers with various applications of the Leibniz algebras also appear now. However, the focus of this book is mainly on the classification problems of Leibniz algebras. Particularly, the authors propose a method of classification of a subclass of Leibniz algebras based on algebraic invariants. The method is applicable in the Lie algebras case as well. Features: Provides a systematic exposition of the theory of Leibniz algebras and recent results on Leibniz algebras Suitable for final year bachelor's students, master's students and PhD students going into research in the structural theory of finite-dimensional algebras, particularly, Lie and Leibniz algebras Covers important and more general parts of the structural theory of Leibniz algebras that are not addressed in other texts

This monograph provides a modern introduction to the theory of quantales. First coined by C.J. Mulvey in 1986, quantales have since developed into a significant topic at the crossroads of algebra and logic, of notable interest to theoretical computer science. This book recasts the subject within the powerful framework of categorical algebra, showcasing its versatility through applications to C*- and MV-algebras, fuzzy sets and automata. With exercises and historical remarks at the end of each chapter, this self-contained book provides readers with a valuable source of references and hints for future research. This book will appeal to researchers across mathematics and computer science with an interest in category theory, lattice theory, and many-valued logic.

In this age of technology where messages are transmitted in sequences of 0's and 1's through space, errors can occur due to noisy channels. Thus, self-correcting code is vital to eradicate these errors when the number of errors is small. It is widely used in industry for a variety of applications including e-mail, telephone, and remote sensing (for example, photographs of Mars).An expert in algebra and algebraic geometry, Tzuong-Tsieng Moh covers many essential aspects of algebraic coding theory in this book, such as elementary algebraic coding theories, the mathematical theory of vector spaces and linear algebras behind them, various rings and associated coding theories, a fast decoding method, useful parts of algebraic geometry and geometric coding theories.This book is accessible to advanced undergraduate students, graduate students, coding theorists and algebraic geometers.

This book is mainly intended for first-year University students who undertake a basic abstract algebra course, as well as instructors. It contains the basic notions of abstract algebra through solved exercises as well as a 'True or False' section in each chapter. Each chapter also contains an essential background section, which makes the book easier to use.

This book is mainly intended for first-year University students who undertake a basic abstract algebra course, as well as instructors. It contains the basic notions of abstract algebra through solved exercises as well as a 'True or False' section in each chapter. Each chapter also contains an essential background section, which makes the book easier to use.

In several proofs from the theory of finite-dimensional Lie algebras, an essential contribution comes from the Jordan canonical structure of linear maps acting on finite-dimensional vector spaces. On the other hand, there exist classical results concerning Lie algebras which advise us to use infinite-dimensional vector spaces as well. For example, the classical Lie Theorem asserts that all finite-dimensional irreducible representations of solvable Lie algebras are one-dimensional. Hence, from this point of view, the solvable Lie algebras cannot be distinguished from one another, that is, they cannot be classified. Even this example alone urges the infinite-dimensional vector spaces to appear on the stage. But the structure of linear maps on such a space is too little understood; for these linear maps one cannot speak about something like the Jordan canonical structure of matrices. Fortunately there exists a large class of linear maps on vector spaces of arbi trary dimension, having some common features with the matrices. We mean the bounded linear operators on a complex Banach space. Certain types of bounded operators (such as the Dunford spectral, Foia decomposable, scalar generalized or Colojoara spectral generalized operators) actually even enjoy a kind of Jordan decomposition theorem. One of the aims of the present book is to expound the most important results obtained until now by using bounded operators in the study of Lie algebras."

Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.

There is no recent elementary introduction to the theory of discrete dynamical systems that stresses the topological background of the topic. This book fills this gap: it deals with this theory as 'applied general topology'. We treat all important concepts needed to understand recent literature. The book is addressed primarily to graduate students. The prerequisites for understanding this book are modest: a certain mathematical maturity and course in General Topology are sufficient.

This book is dedicated to the work of Alasdair Urquhart. The book starts out with an introduction to and an overview of Urquhart's work, and an autobiographical essay by Urquhart. This introductory section is followed by papers on algebraic logic and lattice theory, papers on the complexity of proofs, and papers on philosophical logic and history of logic. The final section of the book contains a response to the papers by Urquhart. Alasdair Urquhart has made extremely important contributions to a variety of fields in logic. He produced some of the earliest work on the semantics of relevant logic. He provided the undecidability of the logics R (of relevant implication) and E (of relevant entailment), as well as some of their close neighbors. He proved that interpolation fails in some of those systems. Urquhart has done very important work in complexity theory, both about the complexity of proofs in classical and some nonclassical logics. In pure algebra, he has produced a representation theorem for lattices and some rather beautiful duality theorems. In addition, he has done important work in the history of logic, especially on Bertrand Russell, including editing Volume four of Russell's Collected Papers.

This 3. edition is an introduction to classical knot theory. It contains many figures and some tables of invariants of knots. This comprehensive account is an indispensable reference source for anyone interested in both classical and modern knot theory. Most of the topics considered in the book are developed in detail; only the main properties of fundamental groups and some basic results of combinatorial group theory are assumed to be known.

First comprehensive treatment in book form of shape-preserving approximation by real or complex polynomials in one or several variables

Of interest to grad students and researchers in approximation theory, mathematical analysis, numerical analysis, Computer Aided Geometric Design, robotics, data fitting, chemistry, fluid mechanics, and engineering

Contains many open problems to spur future research

Rich and updated bibliography

This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models. New homotopy techniques are applied to Marin Lof types of computations with model categories. Functorial computability, induction, and recursion are examined in view of the above, presenting new computability techniques with monad transformations and projective sets. This informative volume will give readers a complete new feel for models, computability, recursion sets, complexity, and realizability. This book pulls together functorial thoughts, models, computability, sets, recursion, arithmetic hierarchy, filters, with real tree computing areas, presented in a very intuitive manner for university teaching, with exercises for every chapter. The book will also prove valuable for faculty in computer science and mathematics.

This contributed volume highlights two areas of fundamental interest in high-performance computing: core algorithms for important kernels and computationally demanding applications. The first few chapters explore algorithms, numerical techniques, and their parallel formulations for a variety of kernels that arise in applications. The rest of the volume focuses on state-of-the-art applications from diverse domains. By structuring the volume around these two areas, it presents a comprehensive view of the application landscape for high-performance computing, while also enabling readers to develop new applications using the kernels. Readers will learn how to choose the most suitable parallel algorithms for any given application, ensuring that theory and practicality are clearly connected. Applications using these techniques are illustrated in detail, including: Computational materials science and engineering Computational cardiovascular analysis Multiscale analysis of wind turbines and turbomachinery Weather forecasting Machine learning techniques Parallel Algorithms in Computational Science and Engineering will be an ideal reference for applied mathematicians, engineers, computer scientists, and other researchers who utilize high-performance computing in their work.

Structures are defined by laws of composition, rules of generation, and relations. The objects on which these laws operate may be numbers, geometric objects like points and lines, or abstract symbols. Algebra is the study of mathematical laws, with a search for general principles that do not depend on what the objects are. Fundamental Structures of Algebra and Discrete Mathematics is an introduction to the twelve basic kinds of structures - sets, ordered sets, groups, rings, fields, vector spaces, graphs, lattices, matroids, topological spaces, universal algebras, and categories - that underlie algebra and discrete mathematics. Beginning with the most basic type of structure, sets, this unique reference provides a detailed look at the theoretical underpinning of each structure, shedding light on the significance of each structure as well as their interrelation. Using a self-contained approach that requires little previous knowledge of mathematical definitions, results, or methods, the book examines selected key aspects of these structures, including closure systems, generators, substructures, homomorphisms and congruences, equational axioms, connections with basic set theory, finiteness conditions, combinatorial properties, and discrete algorithmic procedures. Several classical results are proved, including the Abel-Ruffini theorem on unsolvability by radicals, Helly's theorem on intersecting convex sets, and a simplified version of the Godel-Herbrand completeness theorem. Many of the results are relevant to current research. Highly interactive in approach, the book features numerous exercises and examples woven throughout the text that allow the reader to become fully acquainted withthe character and function of each structure. Additional questions, designed to stretch the reader's analytical skills, appear at the end of each section. Similar to a grammar book that explains the fundamental structures essential to mastering a language, Fundamental Structures of Algebra and Discrete Mathematics is a systematic examination of the basic algebraic structures needed to understand and manipulate advanced mathematical concepts. A cornerstone reference that is both a clear primer and rigorous study guide, Fundamental Structures of Algebra and Discrete Mathematics is indispensable to the student and professional seeking to learn or use the methods of modern algebra.

Commutative algebra is a rapidly growing subject that is developing in many different directions. This volume presents several of the most recent results from various areas related to both Noetherian and non-Noetherian commutative algebra. This volume contains a collection of invited survey articles by some of the leading experts in the field. The authors of these chapters have been carefully selected for their important contributions to an area of commutative-algebraic research. Some topics presented in the volume include: generalizations of cyclic modules, zero divisor graphs, class semigroups, forcing algebras, syzygy bundles, tight closure, Gorenstein dimensions, tensor products of algebras over fields, as well as many others. This book is intended for researchers and graduate students interested in studying the many topics related to commutative algebra.

Features Includes cutting edge applications in machine learning and data analytics. Suitable as a primary text for undergraduates studying linear algebra. Requires very little in the way of pre-requisites.