
Course unit
NUMERICAL ANALYSIS
SC03100218, A.A. 2017/18
Information concerning the students who enrolled in A.Y. 2017/18
Mutuating
Course unit code 
Course unit name 
Teacher in charge 
Degree course code 
SCM0014413 
NUMERICAL ANALYSIS 
ALVISE SOMMARIVA 
SC1159 
ECTS: details
Type 
ScientificDisciplinary Sector 
Credits allocated 
Educational activities in elective or integrative disciplines 
MAT/08 
Numerical Analysis 
6.0 
Course unit organization
Period 
Second semester 
Year 
1st Year 
Teaching method 
frontal 
Type of hours 
Credits 
Teaching hours 
Hours of Individual study 
Shifts 
Practice 
3.0 
24 
51.0 
No turn 
Lecture 
3.0 
24 
51.0 
No turn 
Examination board
Board 
From 
To 
Members of the board 
7 Analisi Numerica  a.a. 2018/2019 
01/10/2018 
30/09/2019 
SOMMARIVA
ALVISE
(Presidente)
PUTTI
MARIO
(Membro Effettivo)
DE MARCHI
STEFANO
(Supplente)
MARCUZZI
FABIO
(Supplente)
MARTINEZ CALOMARDO
ANGELES
(Supplente)

6 Analisi Numerica  2017/2018 
01/10/2017 
30/09/2018 
SOMMARIVA
ALVISE
(Presidente)
PUTTI
MARIO
(Membro Effettivo)
DE MARCHI
STEFANO
(Supplente)
MARCUZZI
FABIO
(Supplente)
MARTINEZ CALOMARDO
ANGELES
(Supplente)
VIANELLO
MARCO
(Supplente)

Target skills and knowledge:

Advanced knowledge of Numerical Analysis and its applications in Applied Mathematics. 
Examination methods:

Classroom and computer labs lessons. 
Assessment criteria:

Oral exam. 
Course unit contents:

Interpolation.
Orthogonal polynomials.
Numerical quadrature.
Iterative methods for linear algebra.
Nonlinear systems.
Eigenvalues.
Finite differences methods for ODEs and PDEs. 
Planned learning activities and teaching methods:

Interpolation.
The general problem of interpolation, unisolvent sets and determinantal formula of Lagrange, the univariate and multivariate case, Lebesgue constant, fundamental estimate for interpolation error, stability, brief introduction to tensorial product interpolation and Fekete points.
Orthogonal polynomials.
Orthogonalization of the monomial basis, threeterms recurrence, the theorem of the zeros, classical orthogonal polynomials, Chebyshev polynomials.
Numerical quadrature.
Algebraic and composite rules, Gaussian rules, PolyaSteklov theorem, stability, Stieltjes theorem, brief introduction to product rules.
Numerical linear algebra.
Fundamental theorem of matrix inversion and applications (Gershgorin theorem of eigenvalues localization), iterative methods for linear systems, successive approximation theorem, preconditioning, gradient method, step and residual stop criteria, methods for the computation of eigenvalues and eigenvectors, Rayleigh quotient, power method and variants, QR method.
Numerical nonlinear algebra.
Solution of nonlinear systems of equations, fixed point iterations and Banach theorem, convergence estimates and stability, Newton method, local convergence and speed of convergence, step criterion, Newton method as fixed point iteration.
Finite difference methods for ODEs and PDEs.
Initial value problem: Euler method (explicit and implicit), convergence and stability in the Lipschitzian and dissipative case, trapezoidal method (CrankNicolson), stiff problems, conditional and unconditional stability; boundary problems: finite difference methods for the Poisson equations in 1D and 2D, structure of the linear system and convergence, computational issues; the lines method for the heat equation in the 1D and 2D case, relationships with the stiff problems. 
Additional notes about suggested reading:

Slides (as PDF files). 
Textbooks (and optional supplementary readings) 


