
Selected Topics in Approximation and Computation addresses the relationship between modern approximation theory and computational methods. The text is a combination of expositions of basic classical methods of approximation leading to popular splines and new explicit tools of computation, including Sinc methods, elliptic function methods, and positive operator approximation methods. It also provides an excellent summary of worst case analysis in information based complexity. It relates optimal computational methods with the theory of s-numbers and n-widths. It can serve as a text for senior-graduate courses in computer science and applied mathematics, and also as a reference for professionals.
This book investigates the intersection of modern approximation theory and computational methodology to establish a framework for efficient numerical analysis. The authors, Christopher Sikorski, Frank Stenger, and Marek Kowalski, synthesize classical approximation techniques with contemporary computational tools. By bridging the gap between theoretical foundations and practical application, the text provides a rigorous examination of how mathematical models translate into algorithmic solutions for complex computational problems.
What You Will Find
Experts identify this work as a specialized resource for graduate-level study in computer science and applied mathematics. Readers frequently note the technical density of the prose, which serves as a formal reference for professionals working in numerical analysis and computational theory.
Page Count:
368
Publication Date:
1995-08-31
Publisher:
Oxford University Press
ISBN-10:
0195080599
ISBN-13:
9780195080599
No comments yet. Be the first to share your thoughts!