Which of the following best explains why Krylov methods are preferred over the full QR algorithm for large sparse eigenvalue problems?

Question

BlackTom AI · Accepted Answer

Krylov methods require only matrix–vector products with A (so they preserve sparsity) and are therefore far cheaper for computing a few extreme eigenpairs of large sparse matrices.

1) Relevant knowledge points and concepts
- Sparsity: a sparse n×n matrix A has nnz(A) nonzero entries with nnz(A) ≪ n^2. A matrix–vector product Ax costs O(nnz(A)).
- Krylov (iterative) methods build a k-dimensional Krylov subspace using repeated Ax operations and typically extract a few extreme eigenvalues; cost ≈ O(k · cost(Ax)) = O(k · nnz(A)).
- The full QR (direct) approach requires first reducing A to Hessenberg (or tridiagonal for symmetric problems) with Householder transforms, costing O(n^3) flops for dense reduction, and this step fills in zeros (destroys sparsity). Subsequent QR iterations are also O(n^3) in total for all eigenvalues.

2) Step-by-step reasoning
- If only a few (say k ≪ n) eigenvalues are needed, Krylov methods run roughly k matrix–vector products plus orthogonalization and small dense eigensolves on k×k matrices → total cost O(k · nnz(A) + k^2 n).
- The QR algorithm’s Hessenberg reduction step involves operations across rows/columns that introduce fill-in; even if A was sparse, the reduction and subsequent dense operations destroy sparsity and require O(n^3) work and O(n^2) memory.

3) Sample calculation (intermediate steps)
- Example: n = 100,000, nnz(A) ≈ 10n = 1,000,000. One Ax ≈ 1e6 operations. For k = 50, Krylov cost ≈ 50 · 1e6 = 5e7 ops (feasible). QR cost scale ~ n^3 ≈ 1e15 ops (infeasible).

4) Why the correct answer is correct
- Answer b explicitly states the key practical reasons: Krylov only needs Ax (preserving sparsity) and scales like O(k·nnz(A)) to find a few extreme eigenvalues, whereas QR is O(n^3) and destroys sparsity. This matches the complexity and storage realities for large sparse problems.

5) Why the other options are incorrect
- a: Krylov methods are not universally more numerically stable than QR; stability depends on context.  
- c: Krylov methods do not always find all n eigenvalues; they target a few.  
- d: The QR algorithm does converge for sparse matrices in theory, but it is impractical because of fill-in and cost.

Conclusion: The best explanation is option b, which matches the provided correct answer.

Which of the following best explains why Krylov methods are preferred over the full QR algorithm for large sparse eigenvalue problems?单项选择题

类似问题

The Arnoldi and Lanczos procedures are memory-intensive for large k because all previous basis vectors must be stored (in Arnoldi) or because re-orthogonalisation requires them (in Lanczos). One practical remedy is:

Is the following statement true or false? In the products of methylation-hydrolysis, every -OH group corresponds to the position of a glycosidic bond in the starting polysaccharide.

Which of the follwoing structures represents amylopectin?

Which of the following is true about an aldopentose?I. It is a monosaccharide.II. It contains a CHO groupIII. It is a disaccharide.IV. It is an oligosaccharide.

For stock A, we have 𝛽 𝑖 = 0.70. Suppose the expected market risk premium next year is 9% and the risk-free rate is 3%. What is the expected return of this stock based on the CAPM? (Please answer in % and round to 2 decimal places. If the answer is 8.057%, then in the box, write 8.06)

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单