Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization

Mathematics

• Normal matrix 82%
• Krylov Subspace Methods 82%
• Normal Approximation 75%
• Approximation Theory 74%
• Convex Optimization 69%
• Convergence Analysis 41%
• Min-max Problem 30%
• Arnoldi 30%
• GMRES Method 30%
• Karush-Kuhn-Tucker Conditions 30%
• Column vector 29%
• Upper bound 28%
• Constrained Optimization 25%
• Approximation Problem 23%
• Polynomial 23%
• Optimality Conditions 22%
• Thing 22%
• Best Approximation 21%
• Eigenvector 20%
• Set of points 20%
• Euclidean 18%
• Finite Set 17%
• Rate of Convergence 16%
• Iteration 14%
• Norm 13%
• Relationships 13%

Engineering & Materials Science

• Approximation theory 100%
• Convex optimization 70%
• Polynomials 20%
• Constrained optimization 14%
• Eigenvalues and eigenfunctions 14%
• Set theory 8%