This book is a quick but precise and careful introduction to the subject of functional analysis. It covers the basic topics that can be found in a basic graduate analysis text. But it also covers more sophisticated topics such as spectral theory, convexity, and fixed-point theorems. A special feature of the book is that it contains a great many examples and even some applications. It concludes with a statement and proof of Lomonosov's dramatic result about invariant subspaces.
Posted in Mathematics

This book is an outline of the core material in the standard graduate-level real analysis course. It is intended as a resource for students in such a course as well as others who wish to learn or review the subject. On the abstract level, it covers the theory of measure and integration and the basics of point set topology, functional analysis, and the most important types of function spaces. On the more concrete level, it also deals with the applications of these general theories to analysis on Euclidean space: the Lebesgue integral, Hausdorff measure, convolutions, Fourier series and transforms, and distributions. The relevant definitions and major theorems are stated in detail. Proofs, however, are generally presented only as sketches, in such a way that the key ideas are explained but the technical details are omitted. In this way a large amount of material is presented in a concise and readable form.
Posted in Mathematics

A Guide to Real Variables is an aid and conceptual support for students taking an undergraduate course on real analysis. It focuses on concepts, results, examples and illustrative figures, rather than the details of proofs, in order to remain a concise guide which students can dip into. The core topics of a first real analysis course are covered, including sequences, series, modes of convergence, the derivative, the integral and metric spaces. The next book in this series, Folland's A Guide to Advanced Real Analysis is designed to naturally follow on from this book, and introduce students to graduate level real analysis. Together these books provide a concise guide to the subject at all levels, ideal for student preparation for exams.
Posted in Mathematics

This highly comprehensive handbook provides a substantial advance in the computation of elementary and special functions of mathematics, extending the function coverage of major programming languages well beyond their international standards, including full support for decimal floating-point arithmetic. Written with clarity and focusing on the C language, the work pays extensive attention to little-understood aspects of floating-point and integer arithmetic, and to software portability, as well as to important historical architectures. It extends support to a future 256-bit, floating-point format offering 70 decimal digits of precision. Select Topics and Features: references an exceptionally useful, author-maintained MathCW website, containing source code for the book’s software, compiled libraries for numerous systems, pre-built C compilers, and other related materials; offers a unique approach to covering mathematical-function computation using decimal arithmetic; provides extremely versatile appendices for interfaces to numerous other languages: Ada, C#, C++, Fortran, Java, and Pascal; presupposes only basic familiarity with computer programming in a common language, as well as early level algebra; supplies a library that readily adapts for existing scripting languages, with minimal effort; supports both binary and decimal arithmetic, in up to 10 different floating-point formats; covers a significant portion (with highly accurate implementations) of the U.S National Institute of Standards and Technology’s 10-year project to codify mathematical functions. This highly practical text/reference is an invaluable tool for advanced undergraduates, recording many lessons of the intermingled history of computer hardw are and software, numerical algorithms, and mathematics. In addition, professional numerical analysts and others will find the handbook of real interest and utility because it builds on research by the mathematical software community over the last four decades.
Posted in Computers

Many students have trouble the first time they take a mathematics course in which proofs play a significant role. This new edition of Velleman's successful text will prepare students to make the transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. The author shows how complex proofs are built up from these smaller steps, using detailed 'scratch work' sections to expose the machinery of proofs about the natural numbers, relations, functions, and infinite sets. To give students the opportunity to construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. This book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and of course mathematicians.
Posted in Mathematics

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.
Posted in Computers