本科高年级Computation课程已上线

Numerical analysis

Numerical linear algebra (LU and QR factorisations, conditioning, least squares, eigenvalue algorithms), numerical solution of ODEs (Euler and Runge–Kutta methods, stiffness), and convergence and stability analysis.

math.comp.numerical-analysis

打开课程显示到达此主题所需的全部内容

前置知识

Numerical methods Linear algebra Ordinary differential equations

41 项必需的前置知识（一直追溯到底）

你将学会

Solve linear systems by LU factorisation with partial pivoting and analyse their conditioning.
Solve least-squares problems via QR factorisation and compute eigenvalues with the QR algorithm.
Implement Euler and Runge–Kutta methods and analyse their order and stability, including for stiff problems.

定义

The condition number κ(A) = ‖A‖ ‖A⁻¹‖ measures how sensitive the solution of Ax = b is to perturbations of the data.
An algorithm is backward stable if it computes the exact answer to a slightly perturbed problem.
A one-step method for ODEs has order p if its global error is O(hᵖ) for step size h.

定理

The relative error in the solution of Ax = b is bounded, to first order, by κ(A) times the relative error in the data.
Gaussian elimination with partial pivoting is backward stable in practice, although its worst-case growth factor is 2ⁿ⁻¹.
The classical Runge–Kutta method has order 4.
Explicit methods applied to stiff problems need very small steps, whereas some implicit methods are A-stable.

常见误解

Computing A⁻¹ in order to solve Ax = b.
Assuming a smaller step size always reduces the total error; rounding error eventually grows.

可选发现

学习路径

Applied mathematics