## Short Description

- URL
`http://www.maths.lth.se/na/courses/NUMA12`

- Credits:
- 7.5 hp
- Instructors:
- Carmen Arévalo and Claus Führer
- Teaching Assistants
- --
- Grading:
- U, G, VG
- Examination:
- The course will have weekly computational projects and theoretical assignments. The final grade will be based on these assignments.
- Prerequisites:
- Analysis in one and several dimensions, Linear Algebra, MATLAB or Python/Scipy

## Contents

The fundamental problem of approximation theory is to represent a possibly complicated function by simpler, easier to compute functions. In approximation theory it is usually assumed that the values of the function are known. This information is then used to construct an approximant. In numerical computation, information usually comes in a less explicit form. For example, the function may be the solution to a differential equation. Nevertheless, the two subjects of approximation and computation are closely related, and it is impossible to understand fully the possibilities in numerical computation without a good understanding of the elements of constructive approximation. This course will give an overview of basic classical approximation theory, i.e., best and good approximation from a finite family of functions in specific normed linear spaces (such as L1, L2, and C). We will study minimax approximation and the construction of good approximations (the exchange algorithm). We will also study orthogonal polynomials and least squares approximation. The results and techniques from approximation theory and numerical analysis will be applied in both the continuous and the discrete cases. The theory will be illustrated mainly by considering numerical approximation techniques by polynomials and splines.

## Literature

This book is also available at LTH:s course library (kursbibliotek) .