AppliedMultiple choice
Why does Gaussian elimination use partial pivoting?
- ATo reduce the operation count from to
- BTo avoid dividing by tiny pivots, which amplifies rounding error
- CTo make the matrix symmetric before factorising
- DBecause the algorithm cannot run at all without it
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
More numerical methods questions
- For [[4, 1], [1, 3]]x = [1, 2], one Jacobi iteration from x = (0,0) gives what…Foundation
- Roughly how many floating-point operations does a Cholesky factorisation of a…Applied
- You solve Ax = b in double precision (about 16 significant digits) and A has…Applied
- You need x = A⁻¹b. Why does production code not compute the inverse?Advanced
- How many continuous derivatives does a natural cubic spline have at its knots?Foundation
- You halve the step size in the trapezoid rule. By what factor does the error fall?Foundation