RSS Amplifier

Topic · computing · Videos

computing: videos

The 30 most recent videos on this topic.

Saves to your Watch queue, to pick up on another day or another device.

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

  1. Numerical Algorithms for Computing & ML, fall 2025 (lecture 26): Leapfrog integration,adjoint methodJustin SolomonNotes
  2. Numerical Algorithms for Computing & ML, fall 2025 (lecture 25): Exponential/RK/Newmark integrationJustin SolomonNotes
  3. Numerical Algorithms for Computing & ML, fall 2025 (lecture 24): Ordinary differential equationsJustin SolomonNotes
  4. Numerical Algorithms for Computing & ML, fall 2025 (lecture 23): Numerical integrals and derivativesJustin SolomonNotes
  5. Numerical Algorithms for Computing & ML, fall 2025 (lecture 22): 1D Quadrature/Numerical IntegrationJustin SolomonNotes
  6. Numerical Algorithms for Computing & ML, fall 2025 (lecture 21): InterpolationJustin SolomonNotes
  7. Numerical Algorithms for Computing & ML, fall 2025 (lecture 20): Alternating optimization and ADMMJustin SolomonNotes
  8. Numerical Algorithms for Computing & ML, fall 2025 (lecture 19): Gauss-Newton, Levenberg-MarquardtJustin SolomonNotes
  9. Numerical Algorithms for Computing & ML, fall 2025 (lecture 18): Conjugate gradient algorithmJustin SolomonNotes
  10. Numerical Algorithms for Computing & ML, fall 2025 (lecture 17): Active set, barrier, intro to CGJustin SolomonNotes
  11. Numerical Algorithms for Computing & ML, fall 2025 (lecture 16): Constrained optim., KKT conditionsJustin SolomonNotes
  12. Numerical Algorithms for Computing & ML, fall 2025 (lecture 15): BFGS and Quasi-Newton MethodsJustin SolomonNotes
  13. Numerical Algorithms for Computing & ML, fall 2025 (lecture 14): Convergence of gradient descentJustin SolomonNotes
  14. Numerical Algorithms for Computing & ML, fall 2025 (lecture 13): Golden sec search, Wolfe conditionsJustin SolomonNotes
  15. Numerical Algorithms for Computing & ML, fall 2025 (lecture 12): Broyden's method, root findingJustin SolomonNotes
  16. Lecture 12.2: The mechanics of function calls (part 2) - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  17. Lecture 11: What to do when things go wrong? Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  18. Lecture 12.1: The mechanics of function calls - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  19. Revision Lecture 8.2: COMP1917 Higher Computing - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  20. Revision Lecture 8.1: COMP1917 Higher Computing - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  21. Lecture 10: Functions - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  22. Lecture 9: A simple recursive function - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  23. Lecture 8: writing a simple C program - Richard BucklandCS1: Higher Computing - Richard Buckland UNSWNotes
  24. Lecture 7: Side Effects - Richard Buckland UNSW 2008CS1: Higher Computing - Richard Buckland UNSWNotes
  25. Lecture 6: Solving Problems - Richard Buckland UNSW 2008CS1: Higher Computing - Richard Buckland UNSWNotes
  26. Lecture 5: Clarity (C programming #2) - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  27. Lecture 4: Simple C Program - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  28. Lecture 3: Machine Code - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  29. Lecture 2: Inside a computer - Richard Buckland UNSWCS1: Higher Computing - Richard Buckland UNSWNotes
  30. Lecture 1: Higher Computing - Richard Buckland UNSW 2008CS1: Higher Computing - Richard Buckland UNSWNotes
computing: videos — playing · RSS Amplifier