CSC C37, Fall 2024
Tutorial Topics

• Week 0 (02/09/24-06/09/24).
  • No tutorials.
  
  
• Week 1 (09/09/24-13/09/24).
  • No tutorials.
  
  
• Week 2 (16/09/24-20/09/24).
  • TA meet&greet
  • conditioning of functions
  • matrix and vector norms
  
  
• Week 3 (23/09/24-27/09/24).
  • base conversion, representing reals in a FP# system
  • rounding error/relative error
  • stability of formulae
  
  
• Week 4 (30/09/24-04/10/24).
  • solving systems of linear equations without pivoting
    • Gaussian Elimination, LU factorization
    • Gauss transforms
    • 3x3 numerical example
  • A1 Q&A
  
  
• Week 5 (07/10/24-11/10/24).
  • solving systems of linear equations with pivoting
    • Gaussian Elimination, PA = LU factorization
    • Gauss transforms, Pivot matrices
    • 3x3 numerical example
  • A1 Q&A
  
  
• Week 6 (14/10/24-18/10/24).
  • complexity of algorithms (review of material first covered in CSCA48/CSCA67)
    • domain definitions
    • formal definitions of big-oh (the upper bound) and big-omega (the lower bound)
    • tight bounds, formal definition of big-theta
    • examples with simple polynomial complexity functions
  • A2 Q&A
  
  
• Week 7 (21/10/24-25/10/24).
  • A1 sample solutions
    • grading scheme
    • discussion of grading approach
  • A2 Q&A
  
  
• Week 8 (28/10/24-01/11/24).
  • Fall Reading Week
  • no tutorials, no lectures
  
  
• Week 9 (04/11/24-08/11/24).
  • iterative refinement (IR)
    • review of the IR algorithm as given in lecture
    • explanation of why IR can improve the accuracy of a computed solution
  • matrix condition# estimation using iterative refinement
  
  
• Week 10 (11/11/24-15/11/24).
  • term test sample solutions
    • discussion of grading approach
  • A3 Q&A
  
  
• Week 11 (18/11/24-22/11/24).
  • A2 sample solutions
    • grading scheme
    • discussion of grading approach
  
  
• Week 12 (25/11/24-29/11/24).
  • A3 sample solutions
    • grading scheme
    • discussion of grading approach
  • A4 Q&A