Orthogonal Polynomials
Computation and Approximation
Series: Numerical Mathematics and Scientific Computation;
- Publisher's listprice GBP 190.00
-
85 785 Ft (81 700 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 8 579 Ft off)
- Discounted price 77 207 Ft (73 530 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
85 785 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher OUP Oxford
- Date of Publication 29 April 2004
- ISBN 9780198506720
- Binding Hardback
- No. of pages312 pages
- Size 242x162x21 mm
- Weight 678 g
- Language English
- Illustrations 9 b/w line drawings 0
Categories
Short description:
Orthogonal polynomials are a widely used class of mathematical functions that are helpful in the solution of many important technical problems. This book provides, for the first time, a systematic development of computational techniques, including a suite of computer programs in Matlab downloadable from the Internet, to generate orthogonal polynomials of a great variety.
MoreLong description:
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 is the first book on constructive methods for and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes ... The book will be of interest not only to mathematicians and numerical analysts but also to a wide range of scientists and engineers.'
Table of Contents:
Basic Theory
Orthogonal polynomials
Properties of orthogonal polynomials
Three-term recurrence relation
Quadrature rules
Classical orthogonal polynomials
Kernal polynomials
Sobolev orthogonal polynomials
Orthogonal polynomials on the semicircle
Notes to chapter 1
Computational Methods
Moment-based methods
Discretization methods
Computing Cauchy integrals of orthogonal polynomials
Modification algorithms
Computing Sobolev orthogonal polynomials
Notes to chapter 2
Applications
Quadrature
Least squares approximation
Moment-preserving spline approximation
Slowly convergent series
Notes to chapter 3
