Numerical Computing

2025-fall, Università della Svizzera italiana, Faculty of Informatics, 2025

This course provides a comprehensive introduction to numerical methods and their implementation in computational environments, focusing on both theory and practical applications. Students will learn to solve mathematical problems using numerical techniques and apply these methods to real-world scenarios in science and engineering.

Key topics include:

  • Numerical solutions to equations
  • Interpolation and approximation
  • Numerical integration and differentiation
  • Numerical linear algebra
  • Error analysis and stability
  • Applications in science and engineering

Schedule

WeekDateTopicMaterialsCode/Assets
12025-09-22Introduction to Numerical ComputingNotes · SlidesCode
22025-09-29Computer Arithmetic and Error AnalysisNotes · SlidesCode
32025-10-06Root-Finding MethodsNotes · SlidesCode
42025-10-13Linear Algebra FoundationsNotes · SlidesCode
52025-10-20Direct Methods for Linear SystemsNotes · SlidesCode
62025-10-27Least Squares and QR DecompositionNotes · SlidesCode
72025-11-03Iterative Methods for Linear SystemsNotes · SlidesCode
82025-11-10Eigenvalue ProblemsNotes · SlidesCode
92025-11-17Interpolation and ApproximationNotes · SlidesCode
102025-11-24Numerical Integration (Quadrature)Notes · SlidesCode
112025-12-01Nonlinear Least Squares and Gauss-NewtonNotes · SlidesCode
122025-12-08Constrained OptimizationNotes · SlidesCode

Slight adjustments may occur; official meterial will be ultimatelly uploaded to icorsi.

Course Outline

  1. Mathematical foundations; error sources and propagation; well‑posedness vs ill‑posedness.
  2. Floating‑point arithmetic (IEEE 754), machine epsilon, roundoff, cancellation; numerical stability.
  3. Nonlinear equations and root finding: bisection, Newton, secant; convergence theory and basins.
  4. Interpolation and approximation: Lagrange, Newton forms, splines; Runge phenomenon and remedies.
  5. Numerical differentiation and quadrature: error analysis, composite rules, Romberg, Gauss.
  6. Numerical linear algebra: conditioning, Gaussian elimination, LU/QR; least squares and SVD.
  7. Eigenvalue problems: power method, QR iteration; applications.
  8. Optimization: gradient methods, line search, constraints, Gauss‑Newton and Levenberg‑Marquardt.

For up-to-date information on schedule and lecture room, visit the official USI course page.