This book presents the evolution of uniform approximations of continuous functions. Starting from the simple case of a real continuous function defined on a closed real interval, i.e., the Weierstrass approximation theorems, it proceeds up to the abstract case of approximation theorems in a locally convex lattice of (M) type. The most important generalizations of Weierstrass’ theorems obtained by Korovkin, Bohman, Stone, Bishop, and Von Neumann are also included. In turn, the book presents the approximation of continuous functions defined on a locally compact space (the functions from a weighted space) and that of continuous differentiable functions defined on ¡n. In closing, it highlights selected approximation theorems in locally convex lattices of (M) type. The book is intended for advanced and graduate students of mathematics, and can also serve as a resource for researchers in the field of the theory of functions.

A thorough, self-contained and easily accessible treatment of the theory on the polynomial best approximation of functions with respect to maximum norms. The topics include Chebychev theory, Weierstraß theorems, smoothness of functions, and continuation of functions.

Mathematics of Computing -- Numerical Analysis.

Theory of Approximation of Functions of a Real Variable discusses a number of fundamental parts of the modern theory of approximation of functions of a real variable. The material is grouped around the problem of the connection between the best approximation of functions to their structural properties. This text is composed of eight chapters that highlight the relationship between the various structural properties of real functions and the character of possible approximations to them by polynomials and other functions of simple construction. Each chapter concludes with a section containing various problems and theorems, which supplement the main text. The first chapters tackle the Weierstrass's theorem, the best approximation by polynomials on a finite segment, and some compact classes of functions and their structural properties. The subsequent chapters describe some properties of algebraic polynomials and transcendental integral functions of exponential type, as well as the direct theorems of the constructive theory of functions. These topics are followed by discussions of differential and constructive characteristics of converse theorems. The final chapters explore other theorems connecting the best approximations functions with their structural properties. These chapters also deal with the linear processes of approximation of functions by polynomials. The book is intended for post-graduate students and for mathematical students taking advanced courses, as well as to workers in the field of the theory of functions.

This is a textbook on classical polynomial and rational approximation theory for the twenty-first century. Aimed at advanced undergraduates and graduate students across all of applied mathematics, it uses MATLAB to teach the field’s most important ideas and results. Approximation Theory and Approximation Practice, Extended Edition differs fundamentally from other works on approximation theory in a number of ways: its emphasis is on topics close to numerical algorithms; concepts are illustrated with Chebfun; and each chapter is a PUBLISHable MATLAB M-file, available online. The book centers on theorems and methods for analytic functions, which appear so often in applications, rather than on functions at the edge of discontinuity with their seductive theoretical challenges. Original sources are cited rather than textbooks, and each item in the bibliography is accompanied by an editorial comment. In addition, each chapter has a collection of exercises, which span a wide range from mathematical theory to Chebfun-based numerical experimentation. This textbook is appropriate for advanced undergraduate or graduate students who have an understanding of numerical analysis and complex analysis. It is also appropriate for seasoned mathematicians who use MATLAB.

Selected Topics in Approximation and Computation is a combination of expositions of basic classical methods of approximation leading to popular splines and new explicit tools of computation, including sinc methods, elliptic function methods, and positive operator approximation methods. It also provides an excellent summary of worst case analysis in Information Based Complexity. It relates optimal computational methods e=with the theory of s-numbers and m-widths.

Topics in Numerical Analysis II contains in complete form, the papers given by the invited speakers to the Conference on Numerical Analysis held under the auspices of the National Committee for Mathematics of the Royal Irish Academy at University College, Dublin from 29th July to 2nd August, 1974. In addition, the titles of the contributed papers are listed together with the names and addresses of the authors who presented them at the conference. This book is divided into 20 chapters that present the papers in their entirety. They discuss such topics as applications of approximation theory to numerical analysis; interior regularity and local convergence of Galerkin finite element approximations for elliptic equations; and numerical estimates for the error of Gauss-Jacobi quadrature formulae. Some remarks on the unified treatment of elementary functions by microprogramming; application of finite difference methods to exploration seismology; and variable coefficient multistep methods for ordinary differential equations applied to parabolic partial differential equations are also presented. Other chapters cover realistic estimates for generic constants in multivariate pointwise approximation; matching of essential boundary conditions in the finite element method; and collocation, difference equations, and stitched function representations. This book will be of interest to practitioners in the fields of mathematics and computer science.

J. -E. DUBOIS and N. GERSHON The first volume of this series, "The Information Revolution: Impact on Science and Technology", emphasized the importance of data sharing and fast communication and the advantages l!)f current hypertext developments in creating new and flexible data access. Volume II, "Modeling Complex Data for Creating Information", dealt, in particular, with the specific constraints of science and technology data including imprecision and uncertainty. It also provided representation and handling tools and object oriented programming technology for developing data systems. The papers presented in this third volume are concerned with the very specific information problems of the technical and competitive industrial world. Here, production and selling rely on creative design, information processing, special up-to date data search, knowledge comprehension and fast action, all essential for decision making steps. The following topics are discussed in this volume: • Cognition and Recognition in Design • Knowledge Based Systems (KBS) Evaluation • Modeling Tools for Knowledge Discovery • Standards and CAD (Computer Aided Design) Aspects of Industrial Exchange and Specifications • Information Seeking Strategies of Selective Access to Intelligent Information • Special Information Resources: Complex Databases Most of these topics, inspired by the symposium on "Communication and Computer Aided Systems" held during the 14th International CODATA Conference, deal with systemic components used by various up-to-date industries in development strategies.