|
 (5.0 / 5.0) Can a Christian escape from a lion? How quickly can a rumor spread? Can you fool an airline into accepting oversize baggage? Recreational mathematics is full of frivolous questions where the mathematician's art can be brought to bear. But play often has a purpose. In mathematics, it can sharpen skills, provide amusement, or simply surprise, and books of problems have been the stock-in-trade of mathematicians for centuries. This collection is designed to be sipped from, rather than consumed in one sitting. The questions range in difficulty: the most challenging offer a glimpse of deep results that engage mathematicians today; even the easiest prompt readers to think about mathematics. All come with solutions, many with hints, and most with illustrations. Whether you are an expert, or a beginner or an amateur mathematician, this book will delight for a lifetime.
|
$19.90 |
|
|
 (4.0 / 5.0) The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.
|
$49.49 |
|
|
Floating-point arithmetic is by far the most widely used way of implementing real-number arithmetic on modern computers. Although the basic principles of floating-point arithmetic can be explained in a short amount of time, making such an arithmetic reliable and portable, yet fast, is a very difficult task. From the 1960s to the early 1980s, many different arithmetics were developed, but their implementation varied widely from one machine to another, making it difficult for nonexperts to design, learn, and use the required algorithms. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic, including a detailed treatment of the newly revised (IEEE 754-2008) standard for floating-point arithmetic. Presented throughout are algorithms for implementing floating-point arithmetic as well as algorithms that use floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. Key topics and features include: * Presentation of the history and basic concepts of floating-point arithmetic and various aspects of the past and current standards * Development of smart and nontrivial algorithms, and algorithmic possibilities induced by the availability of a fused multiply-add (fma) instruction, e.g., correctly rounded software division and square roots * Implementation of floating-point arithmetic, either in software—on an integer processor—or hardware, and a discussion of issues related to compilers and languages * Coverage of several recent advances related to elementary functions: correct rounding of these functions and computation of very accurate approximations under constraints * Extensions of floating-point arithmetic such as certification, verification, and big precision Handbook of Floating-Point Arithmetic is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research.
|
$87.70 |
|
|
 (3.0 / 5.0) Mathematical Structures for Computer Science meets the needs of computer science majors by offering a pedagogically rich and intuitive introduction to discrete mathematical structures. Both accessible and comprehensive, it balances clear presentation of the concepts with relevant applications.
|
$33.99 |
|
|
 (4.5 / 5.0) This is the greatly revised and greatly expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique collaboration among four leading scientists in academic research and industry Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, this new edition remains the most practical, comprehensive handbook of scientific computing available today. Highlights of the new material include: -A new chapter on integral equations and inverse methods -Multigrid and other methods for solving partial differential equations -Improved random number routines - Wavelet transforms -The statistical bootstrap method -A new chapter on "less-numerical" algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easy-to-read style that made the first edition so popular, while introducing some more advanced topics. It is an ideal textbook for scientists and engineers and an indispensable reference for anyone who works in scientific computing. The Second Edition is availabe in FORTRAN, the traditional language for numerical calculations and in the increasingly popular C language.
|
$153.53 |
|
|
(4.5 / 5.0) This book introduces numerical methods, emphasizing the practical aspects of their use and establishing their limitations, advantages and disadvantages. It is intended to assist future as well as practicing engineers in fully understanding the fundamentals of numerical methods, most notably their application, limitations and potentials.
|
$48.25 |
|
|
(4.0 / 5.0) This carefully organized, very readable book covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other books, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts. More combinatorics/algebraic structures than in most books. Detailed discussion of and strong emphasis on proofs. Extensive, in-depth presentation of topics. Large selection of applied and computational problems, ranging from the elementary to the more advanced. More topics in probability and more statistical interpretations than other texts. Comprehensive discussion of topics such as finite state machines, automata, and languages. Earlier introduction of matrices and relations, Boolean algebras and circuits than most texts. Includes algorithms for many constructive tasks that occur in discrete systems.
|
$9.98 |
|
|
(5.0 / 5.0) Mathematics is the science of patterns, and mathematicians attempt to understand these patterns and discover new ones using a variety of tools. In Proofs That Really Count, award-winning math professors Arthur Benjamin and Jennifer Quinn demonstrate that many number patterns, even very complex ones, can be understood by simple counting arguments. The book emphasizes numbers that are often not thought of as numbers that count: Fibonacci Numbers, Lucas Numbers, Continued Fractions, and Harmonic Numbers, to name a few. Numerous hints and references are given for all chapter exercises and many chapters end with a list of identities in need of combinatorial proof. The extensive appendix of identities will be a valuable resource. This book should appeal to readers of all levels, from high school math students to professional mathematicians.
|
$45.94 |
|
|
(4.0 / 5.0) Textbook providing an accessible introduction to discrete mathematics and related topics, for undergraduate and graduate mathematics students. Topics covered include finite projective planes, the inclusion-exclusion principle, latin squares, the menage problem, and magic squares. Softcover. DLC: Mathematics.
|
$23.00 |
|
|
(5.0 / 5.0) This second edition of the popular A Multigrid Tutorial preserves the introductory spirit of the first edition while roughly doubling the amount of material covered. The topics of the first edition have been enhanced with additional discussion, new numerical experiments, and improved figures. New topics in the second edition include nonlinear equations, Neumann boundary conditions, variable mesh and variable coefficient problems, anisotropic problems, algebraic multigrid (AMG), adaptive methods, and finite elements.
This introductory book is ideally suited as a companion textbook for graduate numerical analysis courses. It is written for computational mathematicians, engineers, and other scientists interested in learning about multigrid.
|
$54.50 |