34:27Numerical Computing 3.2 – The secant method and comparing root-finding methods (CU Boulder)
A 34-minute video from Paul Constantine: “Numerical Computing 3.2 – The secant method and comparing root-finding methods (CU Boulder)”.
Paul Constantine
123 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
34:27
1:00:04Numerical Computing 4.2 – The singular value decomposition and condition numbers (CU Boulder)
A 60-minute video from Paul Constantine: “Numerical Computing 4.2 – The singular value decomposition and condition numbers (CU Boulder)”.
56:51Numerical Computing 5.1 – Big O, easy linear systems, and the QR factorization (CU Boulder)
A 57-minute video from Paul Constantine: “Numerical Computing 5.1 – Big O, easy linear systems, and the QR factorization (CU Boulder)”.
56:41Numerical Computing 5.2 – LU, Cholesky, and the Jacobi and Gauss–Seidel methods (CU Boulder)
A 57-minute video from Paul Constantine: “Numerical Computing 5.2 – LU, Cholesky, and the Jacobi and Gauss–Seidel methods (CU Boulder)”.
31:28Numerical Computing 6.1 – A decision tree for linear systems (CU Boulder)
A 31-minute video from Paul Constantine: “Numerical Computing 6.1 – A decision tree for linear systems (CU Boulder)”.
30:04Numerical Computing 6.2 – Newton's method for nonlinear systems (CU Boulder)
A 30-minute video from Paul Constantine: “Numerical Computing 6.2 – Newton's method for nonlinear systems (CU Boulder)”.
52:05Numerical Computing 7.1 – Interpolation, Lagrange polynomials, and Vandermonde systems (CU Boulder)
A 52-minute video from Paul Constantine: “Numerical Computing 7.1 – Interpolation, Lagrange polynomials, and Vandermonde systems (CU Boulder)”.