This textbook presents the concepts and tools necessary to understand, build, and implement algorithms for computing elementary functions (e.g., logarithms, exponentials, and the trigonometric functions). Both hardware- and software-oriented algorithms are included, along with issues related to accurate floating-point implementation. This third edition has been updated and expanded to incorporate the most recent advances in the field, new elementary function algorithms, and function software. After a preliminary chapter that briefly introduces some fundamental concepts of computer arithmetic, such as floating-point arithmetic and redundant number systems, the text is divided into three main parts. Part I considers the computation of elementary functions using algorithms based on polynomial or rational approximations and using table-based methods; the final chapter in this section deals with basic principles of multiple-precision arithmetic. Part II is devoted to a presentation of “shift-and-add” algorithms (hardware-oriented algorithms that use additions and shifts only). Issues related to accuracy, including range reduction, preservation of monotonicity, and correct rounding, as well as some examples of implementation are explored in Part III. Numerous examples of command lines and full programs are provided throughout for various software packages, including Maple, Sollya, and Gappa. New to this edition are an in-depth overview of the IEEE-754-2008 standard for floating-point arithmetic; a section on using double- and triple-word numbers; a presentation of new tools for designing accurate function software; and a section on the Toom-Cook family of multiplication algorithms. The techniques presented in this book will be of interest to implementers of elementary function libraries or circuits and programmers of numerical applications. Additionally, graduate and advanced undergraduate students, professionals, and researchers in scientific computing, numerical analysis, software engineering, and computer engineering will find this a useful reference and resource. PRAISE FOR PREVIOUS EDITIONS “[T]his book seems like an essential reference for the experts (which I'm not). More importantly, this is an interesting book for the curious (which I am). In this case, you'll probably learn many interesting things from this book. If you teach numerical analysis or approximation theory, then this book will give you some good examples to discuss in class." — MAA Reviews (Review of Second Edition) "The rich content of ideas sketched or presented in some detail in this book is supplemented by a list of over three hundred references, most of them of 1980 or more recent. The book also contains some relevant typical programs." — Zentralblatt MATH (Review of Second Edition) “I think that the book will be very valuable to students both in numerical analysis and in computer science. I found [it to be] well written and containing much interesting material, most of the time disseminated in specialized papers published in specialized journals difficult to find." — Numerical Algorithms (Review of First Edition)

Mathematics of Computing -- Numerical Analysis.

Basic treatment includes existence theorem for solutions of differential systems where data is analytic, holomorphic functions, Cauchy's integral, Taylor and Laurent expansions, more. Exercises. 1973 edition.

Functions in R and C, including the theory of Fourier series, Fourier integrals and part of that of holomorphic functions, form the focal topic of these two volumes. Based on a course given by the author to large audiences at Paris VII University for many years, the exposition proceeds somewhat nonlinearly, blending rigorous mathematics skilfully with didactical and historical considerations. It sets out to illustrate the variety of possible approaches to the main results, in order to initiate the reader to methods, the underlying reasoning, and fundamental ideas. It is suitable for both teaching and self-study. In his familiar, personal style, the author emphasizes ideas over calculations and, avoiding the condensed style frequently found in textbooks, explains these ideas without parsimony of words. The French edition in four volumes, published from 1998, has met with resounding success: the first two volumes are now available in English.

This is an English translation of Bourbaki’s Fonctions d'une Variable Réelle. Coverage includes: functions allowed to take values in topological vector spaces, asymptotic expansions are treated on a filtered set equipped with a comparison scale, theorems on the dependence on parameters of differential equations are directly applicable to the study of flows of vector fields on differential manifolds, etc.

Elementary Functions and Analytic Geometry is an introduction to college mathematics, with emphasis on elementary functions and analytic geometry. It aims to provide a working knowledge of basic functions (polynomial, rational, exponential, logarithmic, and trigonometric); graphing techniques and the numerical aspects and applications of functions; two- and three-dimensional vector methods; and complex numbers, mathematical induction, and the binomial theorem. Comprised of 13 chapters, this book begins with a discussion on functions and graphs, paying particular attention to quantities measured in the real number system. The next chapter deals with linear and quadratic functions as well as some of their applications. Tips on graphing are offered. Subsequent chapters focus on polynomial functions, along with graphs of factored polynomials; rational functions; exponential and logarithm functions; and trigonometric functions. Identities and inverse functions, vectors, and trigonometry are also explored, together with complex numbers and solid analytic geometry. The book concludes by considering mathematical induction, binomial coefficients, and the binomial theorem. This monograph will be a useful resource for undergraduate students of mathematics and algebra.