Best Approximation in Inner Product Spaces | 
 enlarge | Author: Frank R. Deutsch
Publisher: Springer
Category: Book
List Price: $94.00
Buy New: $54.50
You Save: $39.50 (42%)
New (20) Used (15) from $50.00
Rating:  1 reviews
Sales Rank: 267674
Media: Hardcover
Edition: 1
Pages: 360
Number Of Items: 1
Shipping Weight (lbs): 1.6
Dimensions (in): 9.6 x 6.3 x 0.8
ISBN: 0387951563
Dewey Decimal Number: 515.733
EAN: 9780387951560
Publication Date: April 20, 2001
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Legendary independent bookstore online since 1994. Reliable customer service and no-hassle return policy.
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
This is the first systematic study of best approximation theory in inner product spaces and, in particular, in Hilbert space. Geometric considerations play a prominent role in developing and understanding the theory. The only prerequisite for reading the book is some knowledge of advanced calculus and linear algebra. Throughout the book, examples and applications have been interspersed with the theory. Each chapter concludes with numerous exercises and a section in which the author puts the results of that chapter into a historical perspective. The book is based on lecture notes for a graduate course on best approximation which the author has taught for over 25 years.
|
| Customer Reviews:
Introduction to Approximation theory and Analysis May 18, 2005
hans (State College, PA USA)
1 out of 2 found this review helpful
Frank Deutsch writes this remarkably self-contained work on the most fundamental aspects of approximation theory in vector spaces with inner products.
Deutsch starts this work by describing the basic problems of approximation theory: what is the best line fit (linear regression), what is the best solution to an over-determined system of equations, how to approximate a real continuous function with a polynomial, how to solve basic control system problems, and computing the best approximation to a surface with convexity constraints. He simply explains how to characterize and solve these problems with approximation theory while gently introducing graduate level analysis. The reader will learn the basics of orthogonality, Hilbert Spaces, compactness, dual spaces, Fourier analysis, Gram-Schmidt orthonormalization, Zorn's Lemma, and dual spaces with applications of all these concepts to concrete approximation problems. He concludes the text with four chapters of very recent research on common computer algorithms, strong CHIP, and the convexity of Chebyshev Sets. This book is a great introduction to approximation theory and modern analysis. I highly recommend it to any advanced undergraduate mathematics student or to any graduate student studying operations research, electrical engineering, or computer science (esp. numerical analysis).
|
|
|
