TANA44	Numerical Algorithms, ECTS-points /NUMERISKA ALGORITMER FÖR C/ Advancement level: B
	Aim: The course provides basic knowledge about numerical methods for solving mathematical problems, with applications in technology and science. Special attention is paid to computer implementation of algorithms, especially implementation of mathematical functions. The course also gives practical familarity with numerical computations on calculators and computers. Prerequisites: TATM 17 Calculus, TATM 16 Linear Algebra, TDDB92 Computer Programming Supplementary courses: TANA70 Fortran TANA50 Numerical methods II TANA77 Scientific computations Course content: Error Analysis: Sources of Error and Error Propagation. Cancellation. Floating Point Arithmetic. IEEE Arithmetic. Numerical Remainder Term Estimates for Series. Computation of Elementary Functions. Non-linear Equations: The Bisection Method. Newton-Raphson's Method. The Secant Method. Error Estimation. Convergence Criteria and Rate of Convergence in Fixed Point Iteration. Interpolation: Newton's Interpolating Polynomial. Spline Interpolation. Numerical Differentiation. Difference Approximation of Derivatives. Richardson Extrapolation. Numerical Integration: The Trapezoidal rule and Romberg's Method. Generalized Integrals. Linear Algebra: Gaussian Elimination with Applications. LU-Decomposition. Perturbation Theory. Overdetermined Linear Systems and the Least Squares Method. Initial Value Problems: Euler's Method and Runge-Kutta Methods. Boundary Value Problems: The Finite Difference Method. Course literature: Eldén, L., Wittmeyer-Koch, L.: Numerisk analys en introduktion (med formelsamling). Studentlitteratur. The English edition: Eldén, L., Wittmeyer-Koch, L.: Numerical Analysis an Introduction. . Academic Press, 1990. Elfving, T., Eriksson, J., Ouchterlony, U., Skoglund, I.: Numerisk analys en exempelsamling. Studentlitteratur. From the department: Instructions for the computer exercises
TEN1	Written examination
LAB	Labratory work

Course language is Swedish.