Techniques for generating orthogonal polynomials numerically have appeared only recently, within the last 30 or so years.÷Orthogonal Polynomials in MATLAB: Exercises and Solutions÷describes these techniques and related applications, all supported by MATLAB programs, and presents them in a unique format of exercises and solutions designed by the author to stimulate participation. Important computational problems in the physical sciences are included as models for readers to solve their own problems.÷
Author: Barry Simon
Publisher: American Mathematical Soc.
Release Date: 2015-11-02
Genre: Mathematical analysis
A Comprehensive Course in Analysis by Poincaré Prize winner Barry Simon is a five-volume set that can serve as a graduate-level analysis textbook with a lot of additional bonus information, including hundreds of problems and numerous notes that extend the text and provide important historical background. Depth and breadth of exposition make this set a valuable reference source for almost all areas of classical analysis. Part 2A is devoted to basic complex analysis. It interweaves three analytic threads associated with Cauchy, Riemann, and Weierstrass, respectively. Cauchy's view focuses on the differential and integral calculus of functions of a complex variable, with the key topics being the Cauchy integral formula and contour integration. For Riemann, the geometry of the complex plane is central, with key topics being fractional linear transformations and conformal mapping. For Weierstrass, the power series is king, with key topics being spaces of analytic functions, the product formulas of Weierstrass and Hadamard, and the Weierstrass theory of elliptic functions. Subjects in this volume that are often missing in other texts include the Cauchy integral theorem when the contour is the boundary of a Jordan region, continued fractions, two proofs of the big Picard theorem, the uniformization theorem, Ahlfors's function, the sheaf of analytic germs, and Jacobi, as well as Weierstrass, elliptic functions.
The mathematical theory of Krylov subspace methods with a focus on solving systems of linear algebraic equations is given a detailed treatment in this principles-based book. Starting from the idea of projections, Krylov subspace methods are characterised by their orthogonality and minimisation properties. Projections onto highly nonlinear Krylov subspaces can be linked with the underlying problem of moments, and therefore Krylov subspace methods can be viewed as matching moments model
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.
Author: Walter Gautschi
Publisher: Oxford University Press on Demand
Release Date: 2004
This is the first book on constructive methods for, and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes. The book begins with a concise introduction to the theory of polynomials orthogonal on the real line (or a portion thereof), relative to a positive measure of integration. Topics which are particularly relevant to computation are emphasized. The second chapter develops computational methods for generating the coefficients in the basic three-term recurrence relation. The methods are of two kinds: moment-based methods and discretization methods. The former are provided with a detailed sensitivity analysis. Other topics addressed concern Cauchy integrals of orthogonal polynomials and their computation, a new discussion of modification algorithms, and the generation of Sobolev orthogonal polynomials. The final chapter deals with selected applications: the numerical evaluation of integrals, especially by Gauss-type quadrature methods, polynomial least squares approximation, moment-preserving spline approximation, and the summation of slowly convergent series. Detailed historic and bibliographic notes are appended to each chapter. The book will be of interest not only to mathematicians and numerical analysts, but also to a wide clientele of scientists and engineers who perceive a need for applying orthogonal polynomials.
Author: George Boros
Publisher: Cambridge University Press
Release Date: 2004-06-21
The problem of evaluating integrals is well known to every student who has had a year of calculus. It was an especially important subject in nineteenth century analysis and it has now been revived with the appearance of symbolic languages. The authors use the problem of exact evaluation of definite integrals as a starting point for exploring many areas of mathematics. The questions discussed are as old as calculus itself. In presenting the combination of methods required for the evaluation of most integrals, the authors take the most interesting-rather than the shortest-path to the results. They illuminate connections with many subjects, including analysis, number theory, algebra and combinatorics. This is a guided tour of exciting discovery for undergraduates and their teachers in mathematics, computer science, physics, and engineering.
Author: N. N. Lebedev
Publisher: Courier Corporation
Release Date: 2012-04-30
Famous Russian work discusses the application of cylinder functions and spherical harmonics; gamma function; probability integral and related functions; Airy functions; hyper-geometric functions; more. Translated by Richard Silverman.
Author: Jonathan M. Borwein
Publisher: Cambridge University Press
Release Date: 2010-01-14
The product of a collaboration of over 15 years, this volume is unique because it focuses on convex functions themselves, rather than on convex analysis. The authors explore the various classes and their characteristics, treating convex functions in both Euclidean and Banach spaces.