Scheda programma d'esame
METODI DI APPROSSIMAZIONE
FEDERICO GIOVANNI POLONI
Anno accademico2021/22
CdSMATEMATICA
Codice146AA
CFU6
PeriodoSecondo semestre
LinguaItaliano

ModuliSettore/iTipoOreDocente/i
METODI DI APPROSSIMAZIONE/aMAT/08LEZIONI42
FEDERICO GIOVANNI POLONI unimap
Obiettivi di apprendimento
Learning outcomes
Conoscenze

Il corso si concentra su tecniche avanzate di algebra lineare numerica e le sue applicazioni. Lo studente che completa il corso sarà a conoscenza di diversi argomenti di algebra lineare numerica sviluppati recentemente, e avrà una descrizione dello stato della ricerca in questi campi.

Quest'anno il corso si concentrerà su funzioni di matrici ed equazioni matriciali tipo-Riccati (inclusa qualche applicazione alla teoria dei controlli).

Knowledge

This course focuses on advanced techniques in numerical linear algebra (NLA) and their applications. The student who successfully completes the course will be aware of several contemporary topics in numerical linear algebra. The student will be also able to have a look at the state of the local research in these fields.

This year the course will cover matrix functions and Riccati-type matrix equations (with some applications to control theory).

 

Modalità di verifica delle conoscenze

(si veda la versione inglese del programma per informazioni dettagliate.)

Assessment criteria of knowledge

The final exam is based on a seminar: the students will need to read, understand, and repeat the numerical experiments (to some extent) of a research paper in numerical linear algebra (to be agreed with the teacher), and make a short presentation on it.

Possibly, if the number of students allows it, a shorter lecture on a smaller topic will be assigned during the course.

Capacità

(si veda la versione inglese del programma per informazioni dettagliate.)

Skills

Students will see some modern techniques and problems in numerical linear algebra and be able to interface themselves with contemporary papers and research presentations.

Modalità di verifica delle capacità

(si veda la versione inglese del programma per informazioni dettagliate.)

Assessment criteria of skills

During the course and the final exam.

Prerequisiti (conoscenze iniziali)

(si veda la versione inglese del programma per informazioni dettagliate.)

Prerequisites

The material covered in our undergraduate courses on numerical analysis and numerical linear algebra (including the program of the undergraduate/graduate course *Calcolo Scientifico* taught at Unipi); a solid command of linear algebra and proof-based mathematics. Some experience with programming (and numerical programming), to implement and test the algorithms encountered. Working knowledge of the English language (if the course is taught in English).

Indicazioni metodologiche

(si veda la versione inglese del programma per informazioni dettagliate.)

Teaching methods

Delivery: frontal lectures with coding examples (either in-person or online,Khan-style using a tablet).

Learning activities:

  • attending lectures
  • preparation of oral/written report
  • individual study and coding

Attendance: Not mandatory

Teaching methods:

  • Lectures
  • Seminar
  • project work
Programma (contenuti dell'insegnamento)

(si veda la versione inglese del programma per informazioni dettagliate.)

Syllabus

(tentative) Kronecker products and Sylvester equations. Introduction to matrix functions and equations. Conditioning and Fréchet derivatives. Numerical methods for generic and special matrix functions (exponential, sign function, square root). Introduction to control theory (ABC linear time-invariant systems, controllability criteria). Lyapunov and Riccati equations: solvability properties and numerical methods (Newton, matrix sign iteration, SDA, and a brief outline of methods for sparse equations).

Bibliografia e materiale didattico

(si veda la versione inglese del programma per informazioni dettagliate.)

Bibliography

N. Higham, Functions of matrices.

B. Datta, Numerical Methods for Linear Control Theory.

A good research textbook to fill in on the standard algorithms is Golub, Van Loan, Matrix computations, 4th edition.

Indicazioni per non frequentanti

(si veda la versione inglese del programma per informazioni dettagliate.)

Non-attending students info

The lectures will be recorded (barring technical issues), so it is expected that even non-attending students can follow them. Non-attending students are expected to get familiar with the material covered in the course, and to contact the teacher to agree a topic for the final presentation.

Modalità d'esame

(si veda la versione inglese del programma per informazioni dettagliate.)

Assessment methods

Oral exam, with a presentation on a research topic decided beforehand in agreement with the teacher.

Altri riferimenti web

The course page will be created on Moodle.

Ultimo aggiornamento 23/07/2021 14:50