Approximation of Functions Theory And Numerical Methods

This book develops the basic mathematical theory of the finite element method, the most widely used technique for engineering design and analysis.

In this book, a new approach to approximation procedures is developed. This new approach is characterized by the common feature that the procedures are accurate without being convergent as the mesh size tends to zero.

Intended for a wide range of readers, this book covers the main ideas of convex analysis and approximation theory. The author discusses the sources of these two trends in mathematical analysis, develops the main concepts and results, and mentions some beautiful theorems. The relationship of convex analysis to optimization problems, to the calculus of variations, to optimal control and to geometry is considered, and the evolution of the ideas underlying approximation theory, from its origins to the present day, is discussed. The book is addressed both to students who want to acquaint themselves with these trends and to lecturers in mathematical analysis, optimization and numerical methods, as well as to researchers in these fields who would like to tackle the topic as a whole and seek inspiration for its further development.

In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed.