Numerical Algorithms (PhD)

UNIVERSITÀ DELLA SVIZZERA ITALIANA
A Mendrisio (Svizzera)

Chiedi il prezzo
Confronta questo corso con altri simili
Leggi tutto

Informazione importanti

  • Corso
  • Mendrisio (Svizzera)
Descrizione

Descrizione This course is about the key numerical algorithms that you should really want to know about. How do TrueType fonts work? What is the secret of Google's success? Why is JPEG compression so efficient? The answers to these questions are clever numerical algorithms, based on Bézier curves, eigenvalues, and the discrete cosine transformation, respectively. We will be able to understand and discuss them once we have gone through some preliminary basics, including Newton's method for finding roots, polynomial interpolation, direct and iterative methods for solving linear systems of equations, and Gaussian quadrature. This course refreshes your basic math skills in calculus and linear algebra and shows how to utilize them for solving several real-world problems, like the ones mentioned earlier. We also provide references to the history of these solutions, going back to Newton, Leibniz, Euler, Gauss and others.

Informazione importanti
Sedi

Dove e quando

Inizio Luogo
Consultare
Mendrisio
Tessin, Svizzera
Visualizza mappa

Programma

Descrizione

This course is about the key numerical algorithms that you should really want to know about. How do TrueType fonts work? What is the secret of Google's success? Why is JPEG compression so efficient? The answers to these questions are clever numerical algorithms, based on Bézier curves, eigenvalues, and the discrete cosine transformation, respectively. We will be able to understand and discuss them once we have gone through some preliminary basics, including Newton's method for finding roots, polynomial interpolation, direct and iterative methods for solving linear systems of equations, and Gaussian quadrature. This course refreshes your basic math skills in calculus and linear algebra and shows how to utilize them for solving several real-world problems, like the ones mentioned earlier. We also provide references to the history of these solutions, going back to Newton, Leibniz, Euler, Gauss and others.

REFERENCES

  • Numerical Analysis; Sauer; Pearson, 2012

Additional material will be provided through the course homepage.


Confronta questo corso con altri simili
Leggi tutto