๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Orthogonal Polynomials: Computation and Approximation

โœ Scribed by Walter Gautschi


Publisher
Oxford University Press
Year
2004
Tongue
English
Leaves
314
Series
Numerical Mathematics and Scientific Computation
Edition
1. publ
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.

โœฆ Table of Contents


Content: BASIC THEORY
1.1 Orthogonal polynomials
1.2 Properties of orthogonal polynomials
1.3 Three-term recurrence relation
1.4 Quadrature rules
1.5 Classical orthogonal polynomials
1.6 Kernal polynomials
1.7 Sobolev orthogonal polynomials
1.8 Orthogonal polynomials on the semicircle
1.9 Notes to chapter 1
COMPUTATIONAL METHODS
2.1 Moment-based methods
2.2 Discretization methods
2.3 Computing Cauchy integrals of orthogonal polynomials
2.4 Modification algorithms
2.5 Computing Sobolev orthogonal polynomials
2.6 Notes to chapter 2
APPLICATIONS
3.1 Quadrature
3.2 Least squares approximation
3.3 Moment-preserving spline approximation
3.4 Slowly convergent series
3.5 Notes to chapter 3

โœฆ Subjects


Approximation;Orthogonale Polynome


๐Ÿ“œ SIMILAR VOLUMES


Orthogonal Polynomials: Computation and
โœ Walter Gautschi ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Oxford University Press ๐ŸŒ English

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 posi

Linear Algebra, Rational Approximation a
โœ Bultheel A., van Barel M. ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐ŸŒ English

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padรฉ tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algor

Linear Algebra, Rational Approximation a
โœ Adhemar Bultheel and Marc Van Barel (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› North Holland ๐ŸŒ English

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padรฉ tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algor