
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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.
This text investigates the constructive methods and practical applications of orthogonal polynomials within the field of numerical mathematics. Walter Gautschi, a recognized expert in numerical analysis, provides a rigorous framework for generating and applying these polynomials. The book synthesizes theoretical foundations with computational strategies, specifically focusing on the three-term recurrence relation and its implementation in modern software environments.
What You Will Find
Experts identify this work as a foundational resource for researchers and engineers requiring precise numerical tools for polynomial approximation. Readers frequently note the technical density of the prose, which serves as a comprehensive reference for those already familiar with the underlying mathematical theory.
Page Count:
312
Publication Date:
2004-06-17
Publisher:
Oxford University Press
ISBN-10:
0198506724
ISBN-13:
9780198506720
No comments yet. Be the first to share your thoughts!