• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Orthogonal Polynomials: Computation and Approximation

Orthogonal Polynomials: Computation and Approximation

Hardcover

Series: Numerical Mathematics and Scientific Computation

CalculusGeneral Mathematics

ISBN10: 0198506724
ISBN13: 9780198506720
Publisher: OUP Oxford
Published: Jun 17 2004
Pages: 312
Weight: 1.46
Height: 0.84 Width: 6.44 Depth: 9.15
Language: 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 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.

Also in

General Mathematics