The Handbook of Mathematical Fluid Dynamics is a compendium of essays that provides a survey of the major topics in the subject. Each article traces developments, surveys the results of the past decade, discusses the current state of knowledge and presents major future directions and open problems. Extensive bibliographic material is provided. The book is intended to be useful both to experts in the field and to mathematicians and other scientists who wish to learn about or begin research in mathematical fluid dynamics. The Handbook illuminates an exciting subject that involves rigorous mathematical theory applied to an important physical problem, namely the motion of fluids.

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.
The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.
One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.
The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.
-Emphasis is on relevant quantitative attributes of important results in complexity.
-Coverage is self-contained and accessible to a wide audience.
-Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology.

This volume introduces a unified, self-contained study of linear discrete parabolic problems through reducing the starting discrete problem to the Cauchy problem for an evolution equation in discrete time. Accessible to beginning graduate students, the book contains a general stability theory of discrete evolution equations in Banach space and gives applications of this theory to the analysis of various classes of modern discretization methods, among others, Runge-Kutta and linear multistep methods as well as operator splitting methods.

Key features:

* Presents a unified approach to examining discretization methods for parabolic equations.
* Highlights a stability theory of discrete evolution equations (discrete semigroups) in Banach space.
* Deals with both autonomous and non-autonomous equations as well as with equations with memory.
* Offers a series of numerous well-posedness and convergence results for various discretization methods as applied to abstract parabolic equations; among others, Runge-Kutta and linear multistep methods as well as certain operator splitting methods.
* Provides comments of results and historical remarks after each chapter.
. Presents a unified approach to examining discretization methods for parabolic equations.
. Highlights a stability theory of discrete evolution equations (discrete semigroups) in Banach space.
. Deals with both autonomous and non-autonomous equations as well as with equations with memory.
. Offers a series of numerous well-posedness and convergence results for various discretization methods as applied to abstract parabolic equations; among others, Runge-Kutta and linear multistep methods as well as certain operator splitting methods as well as certain operator splitting methods are studied in detail.
.Provides comments of results and historical remarks after each chapter."

The book presents a systematic and compact treatment of the qualitative theory of half-linear
differential equations. It contains the most updated and comprehensive material and represents the first attempt to present the results of the rapidly developing theory of half-linear differential equations in a unified form. The main topics covered by the book are oscillation and asymptotic theory and the theory of boundary value problems associated with half-linear equations, but the book also contains a treatment of related topics like PDE s with p-Laplacian, half-linear difference equations and various more general nonlinear differential equations.
- The first complete treatment of the qualitative theory of half-linear differential equations.
- Comparison of linear and half-linear theory.
- Systematic approach to half-linear oscillation and asymptotic theory.
- Comprehensive bibliography and index.
- Useful as a reference book in the topic.

Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.

This classic work has been fundamentally revised to take account of recent developments in general topology. The first three chapters remain unchanged except for numerous minor corrections and additional exercises, but chapters IV-VII and the new chapter VIII cover the rapid changes that have occurred since 1968 when the first edition appeared.
The reader will find many new topics in chapters IV-VIII, e.g. theory of Wallmann-Shanin's compactification, realcompact space, various generalizations of paracompactness, generalized metric spaces, Dugundji type extension theory, linearly ordered topological space, theory of cardinal functions, dyadic space, etc., that were, in the author's opinion, mostly special or isolated topics some twenty years ago but now settle down into the mainstream of general topology.

Linear Algebra: An Introduction Using MAPLE is a text for a first undergraduate course in linear algebra. All students majoring in mathematics, computer science, engineering, physics, chemistry, economics, statistics, actuarial mathematics and other such fields of study will benefit from this text. The presentation is matrix-based and covers the standard topics for a first course recommended by the Linear Algebra Curriculum Study Group. The aim of the book is to make linear algebra accessible to all college majors through a focused presentation of the material, enriched by interactive learning and teaching with MAPLE. Development of analytical and computational skills is emphasized throughout Worked examples provide step-by-step methods for solving basic problems using Maple The subject's rich pertinence to problem solving across disciplines is illustrated with applications in engineering, the natural sciences, computer animation, and statistics

Volume II of "Classical Recursion Theory" describes the universe from a local (bottom-up
or synthetical) point of view, and covers the whole spectrum, from the
recursive to the arithmetical sets.
The first half of the book provides a detailed picture of the computable
sets from the perspective of Theoretical Computer Science. Besides giving a
detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity
classes, ranging from small time and space bounds to the elementary functions,
with a particular attention to polynomial time and space computability. It also
deals with primitive recursive functions and larger classes, which are of
interest to the proof theorist.
The second half of the book starts with the classical theory of recursively
enumerable sets and degrees, which constitutes the core of Recursion or
Computability Theory. Unlike other texts, usually confined to the Turing
degrees, the book covers a variety of other strong reducibilities, studying
both their individual structures and their mutual relationships. The last
chapters extend the theory to limit sets and arithmetical sets. The volume
ends with the first textbook treatment of the enumeration degrees, which
admit a number of applications from algebra to the Lambda Calculus.
The book is a valuable source of information for anyone interested in
Complexity and Computability Theory. The student will appreciate the detailed
but informal account of a wide variety of basic topics, while the specialist
will find a wealth of material sketched in exercises and asides. A massive
bibliography of more than a thousand titles completes the treatment on the
historical side.

Topology, for many years, has been one of the most exciting and influential fields of research in modern mathematics. Although its origins may be traced back several hundred years, it was Poincare who "gave topology wings" in a classic series of articles published around the turn of the century. While the earlier history, sometimes called the prehistory, is also considered, this volume is mainly concerned with the more recent history of topology, from Poincare onwards.
As will be seen from the list of contents the articles cover a wide range of topics. Some are more technical than others, but the reader without a great deal of technical knowledge should still find most of the articles accessible. Some are written by professional historians of mathematics, others by historically-minded mathematicians, who tend to have a different viewpoint.

'Numbers and Proofs' presents a gentle introduction to the notion of proof to give the reader an understanding of how to decipher others' proofs as well as construct their own. Useful methods of proof are illustrated in the context of studying problems concerning mainly numbers (real, rational, complex and integers). An indispensable guide to all students of mathematics. Each proof is preceded by a discussion which is intended to show the reader the kind of thoughts they might have before any attempt proof is made. Established proofs which the student is in a better position to follow then follow.
Presented in the author's entertaining and informal style, and written to reflect the changing profile of students entering universities, this book will prove essential reading for all seeking an introduction to the notion of proof as well as giving a definitive guide to the more common forms. Stressing the importance of backing up "truths" found through experimentation, with logically sound and watertight arguments, it provides an ideal bridge to more complex undergraduate maths.

In its Second Edition, Handbook of Pulping and Papermaking is a comprehensive reference for industry and academia. The book offers a concise yet thorough introduction to the process of papermaking from the production of wood chips to the final testing and use of the paper product. The author has updated the extensive bibliography, providing the reader with easy access to the pulp and paper literature. The book emphasizes principles and concepts behind papermaking, detailing both the physical and chemical processes.
Key Features
* A comprehensive introduction to the physical and chemical processes in pulping and papermaking
* Contains an extensive annotated bibliography
* Includes 12 pages of color plates

This new text takes the reader from the very basics of analogue electronics to an introduction of state-of-the-art techniques used in the field. It is aimed at all engineering or science students who wish to study the subject from its first principles, as well as serving as a guide to more advanced topics for readers already familiar with the subject.
Attention throughout is focused on measurable terminal characteristics of devices, the way in which these give rise to equivalent circuits and methods of extracting parameter values for them from manufacturers data sheet specifications. In the practical application of these equivalent circuits, step-by-step analysis and design procedures are given where appropriate. Throughout the book, emphasis is given to the pictorial representation of information, and extensive use is made of mechanical analogues. This, combined with the self-assessment questions, copious exercises and worked examples result in an accessible introduction to a key area of electronics that even those with the most limited prior experience will find invaluable in their studies.

This text brings the reader to the frontiers of current research in topological rings. The exercises illustrate many results and theorems while a comprehensive bibliography is also included.

The book is aimed at those readers acquainted with some very basic point-set topology and algebra, as normally presented in semester courses at the beginning graduate level or even at the advanced undergraduate level. Familiarity with Hausdorff, metric, compact and locally compact spaces and basic properties of continuous functions, also with groups, rings, fields, vector spaces and modules, and with Zorn's Lemma, is also expected.

Introduction to Lie Groups and Lie Algebra, 51

An Introduction to Electric Circuits is essential reading for first year students of electronics and electrical engineering who need to get to grips quickly with the basic theory. This text is a comprehensive introduction to the topic and, assuming virtually no knowledge, it keeps the mathematical content to a minimum.
As with other textbooks in the series, the format of this book enables the student to work at their own pace. It includes numerous worked examples throughout the text and graded exercises, with answers, at the end of each section.

Probability is relevant to so many different subject areas that its importance as a mathematical technique cannot be underestimated. This book provides a comprehensive, user-friendly introduction to the subject. The step-by-step approach taken by the author allows students to develop knowledge at their own pace and, by working through the numerous exercises, they are ensured a full understanding of the material before moving on to more advanced sections. Traditional examples of probablistic theory, such as coins and dice, are included but the author has also used many exercises based on real-life problems. The result is an introduction to probability that avoids the overly confusing, theoretical approach often adopted in this area, and provides a simple and concise text that will be invaluable to all studying first and second year courses on the subject.

This text provides an introduction to group theory with an emphasis on clear examples. The authors present groups as naturally occurring structures arising from symmetry in geometrical figures and other mathematical objects. Written in a 'user-friendly' style, where new ideas are always motivated before being fully introduced, the text will help readers to gain confidence and skill in handling group theory notation before progressing on to applying it in complex situations. An ideal companion to any first or second year course on the topic.

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

For more than forty years, the equation y (t) = Ay(t) + u(t) in Banach spaces has been used as model for optimal control processes described by partial differential equations, in particular heat and diffusion processes. Many of the outstanding open problems, however, have remained open until recently, and some have never been solved. This book is a survey of all results know to the author, with emphasis on very recent results (1999 to date).

The book is restricted to linear equations and two particular problems (the time optimal problem, the norm optimal problem) which results in a more focused and concrete treatment. As experience shows, results on linear equations are the basis for the treatment of their semilinear counterparts, and techniques for the time and norm optimal problems can often be generalized to more general cost functionals.

The main object of this book is to be a state-of-the-art monograph on the theory of the time and norm optimal controls for y (t) = Ay(t) + u(t) that ends at the very latest frontier of research, with open problems and indications for future research.

Key features:

. Applications to optimal diffusion processes.
. Applications to optimal heat propagation processes.
. Modelling of optimal processes governed by partial
differential equations.
. Complete bibliography.
. Includes the latest research on the subject.
. Does not assume anything from the reader except
basic functional analysis.
. Accessible to researchers and advanced graduate
students alike
. Applications to optimal diffusion processes.
. Applications to optimal heat propagation processes.
. Modelling of optimal processes governed by partial
differential equations.
. Complete bibliography.
. Includes the latest research on the subject.
. Does not assume anything from the reader except
basic functional analysis.
. Accessible to researchers and advanced graduate
students alike"

Techniques of physics find wide application in biology, medicine, engineering and technology generally. This series is devoted to techniques which have found and are finding application. The aim is to clarify the principles of each technique, to emphasize and illustrate the applications and to draw attention to new fields of possible employment.

This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton s, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent s method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled A Handbook of Methods for Polynomial Root-finding . This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.

- First comprehensive treatment of Root-Finding in several decades.
- Gives description of high-grade software and where it can be down-loaded.
- Very up-to-date in mid-2006; long chapter on matrix methods.
- Includes Parallel methods, errors where appropriate.
- Invaluable for research or graduate course.

"

Anyone involved in the philosophy of science is naturally drawn into the study of the foundations of probability. Different interpretations of probability, based on competing philosophical ideas, lead to different statistical techniques, and frequently to mutually contradictory consequences.

This unique book presents a new interpretation of probability, rooted in the traditional interpretation that was current in the 17th and 18th centuries. Mathematical models are constructed based on this interpretation, and statistical inference and decision theory are applied, including some examples in artificial intelligence, solving the main foundational problems. Nonstandard analysis is extensively developed for the construction of the models and in some of the proofs. Many nonstandard theorems are proved, some of them new, in particular, a representation theorem that asserts that any stochastic process can be approximated by a process defined over a space with equiprobable outcomes.

Relation algebras are algebras arising from the study of binary relations.
They form a part of the field of algebraic logic, and have applications in proof theory, modal logic, and computer science. This research text uses combinatorial games to study the fundamental notion of representations of relation algebras. Games allow an intuitive and appealing approach to the subject, and permit substantial advances to be made. The book contains many new results and proofs not published elsewhere. It should be invaluable to graduate students and researchers interested in relation algebras and games.

After an introduction describing the authors' perspective on the material, the text proper has six parts. The lengthy first part is devoted to background material, including the formal definitions of relation algebras, cylindric algebras, their basic properties, and some connections between them. Examples are given. Part 1 ends with a short survey of other work beyond the scope of the book. In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises.

The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given. Chapter 2 introduces the necessary universal algebra and model theory, and more specific model-theoretic ideas are explained as they arise.

The year 2007 marks the 300th anniversary of the birth of one of the Enlightenment's most important mathematicians and scientists, Leonhard Euler. This volume is a collection of 24 essays by some of the world's best Eulerian scholars from seven different countries about Euler, his life and his work.
Some of the essays are historical, including much previously unknown information about Euler's life, his activities in the St. Petersburg Academy, the influence of the Russian Princess Dashkova, and Euler's philosophy. Others describe his influence on the subsequent growth of European mathematics and physics in the 19th century. Still others give technical details of Euler's innovations in probability, number theory, geometry, analysis, astronomy, mechanics and other fields of mathematics and science.
- Over 20 essays by some of the best historians of mathematics and science, including Ronald Calinger, Peter Hoffmann, Curtis Wilson, Kim Plofker, Victor Katz, Ruediger Thiele, David Richeson, Robin Wilson, Ivor Grattan-Guinness and Karin Reich
- New details of Euler's life in two essays, one by Ronald Calinger and one he co-authored with Elena Polyakhova
- New information on Euler's work in differential geometry, series, mechanics, and other important topics including his influence in the early 19th century

This handbook is the second volume in a series devoted to self contained and up-to-date surveys in the theory of ordinary differential equations, written
by leading researchers in the area. All contributors have made an additional effort to achieve readability for mathematicians and scientists from other related fields, in order to make the chapters of the volume accessible to a wide audience.
. Six chapters covering a variety of problems in ordinary differential equations.
. Both, pure mathematical research and real word applications are reflected
. Written by leading researchers in the area.