# Article

Full entry | PDF   (0.5 MB)
Keywords:
eigenvalue bound; symmetric positive definite matrix; Laguerre bound; singular value computation; dqds algorithm
Summary:
Lower bounds on the smallest eigenvalue of a symmetric positive definite matrix $A\in \mathbb {R}^{m\times m}$ play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on ${\rm Tr}(A^{-1})$ and ${\rm Tr}(A^{-2})$ have attracted attention recently, because they can be computed in $O(m)$ operations when $A$ is tridiagonal. In this paper, we focus on these bounds and investigate their properties in detail. First, we consider the problem of finding the optimal bound that can be computed solely from ${\rm Tr}(A^{-1})$ and ${\rm Tr}(A^{-2})$ and show that the so called Laguerre's lower bound is the optimal one in terms of sharpness. Next, we study the gap between the Laguerre bound and the smallest eigenvalue. We characterize the situation in which the gap becomes largest in terms of the eigenvalue distribution of $A$ and show that the gap becomes smallest when $\{{\rm Tr}(A^{-1})\}^2/{\rm Tr}(A^{-2})$ approaches 1 or $m$. These results will be useful, for example, in designing efficient shift strategies for singular value computation algorithms.
References:
[1] Aishima, K., Matsuo, T., Murota, K., Sugihara, M.: A survey on convergence theorems of the dqds algorithm for computing singular values. J. Math-for-Ind. 2 (2010), 1-11. MR 2639360 | Zbl 1210.65088
[2] Alefeld, G.: On the convergence of Halley's method. Am. Math. Monthly 88 (1981), 530-536. DOI 10.2307/2321760 | MR 0628022 | Zbl 0486.65035
[3] Fernando, K. V., Parlett, B. N.: Accurate singular values and differential qd algorithms. Numer. Math. 67 (1994), 191-229. DOI 10.1007/s002110050024 | MR 1262781 | Zbl 0814.65036
[4] Golub, G. H., Loan, C. F. Van: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore (2013). MR 3024913 | Zbl 1268.65037
[5] Householder, A. S.: The Numerical Treatment of a Single Nonlinear Equation. International Series in Pure and Applied Mathematics, McGraw-Hill Book, New York (1970). MR 0388759 | Zbl 0242.65047
[6] Iwasaki, M., Nakamura, Y.: Accurate computation of singular values in terms of shifted integrable schemes. Japan J. Ind. Appl. Math. 23 (2006), 239-259. DOI 10.1007/BF03167593 | MR 2281507 | Zbl 1117.65055
[7] Johnson, C. R.: A Gersgorin-type lower bound for the smallest singular value. Linear Algebra Appl. 112 (1989), 1-7. DOI 10.1016/0024-3795(89)90583-1 | MR 0976325 | Zbl 0723.15013
[8] Johnson, C. R., Szulc, T.: Further lower bounds for the smallest singular value. Linear Algebra Appl. 272 (1998), 169-179. DOI 10.1016/S0024-3795(97)00330-3 | MR 1489385 | Zbl 0891.15013
[9] Kimura, K., Yamashita, T., Nakamura, Y.: Conserved quantities of the discrete finite Toda equation and lower bounds of the minimal singular value of upper bidiagonal matrices. J. Phys. A, Math. Theor. 44 (2011), Article ID 285207, 12 pages. DOI 10.1088/1751-8113/44/28/285207 | MR 2812341 | Zbl 1223.37068
[10] Matt, U. von: The orthogonal qd-algorithm. SIAM J. Sci. Comput. 18 (1997), 1163-1186. DOI 10.1137/S1064827594274887 | MR 1453563 | Zbl 0895.65014
[11] Yamashita, T., Kimura, K., Nakamura, Y.: Subtraction-free recurrence relations for lower bounds of the minimal singular value of an upper bidiagonal matrix. J. Math-for-Ind. 4 (2012), 55-71. MR 2912032 | Zbl 1302.15012
[12] Yamashita, T., Kimura, K., Takata, M., Nakamura, Y.: An application of the Kato-Temple inequality on matrix eigenvalues to the dqds algorithm for singular values. JSIAM Lett. 5 (2013), 21-24. DOI 10.14495/jsiaml.5.21 | MR 3035546
[13] Yamashita, T., Kimura, K., Yamamoto, Y.: A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix. Numer. Algorithms 69 (2015), 893-912. DOI 10.1007/s11075-014-9931-z | MR 3374105 | Zbl 1329.65079
[14] Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Monographs on Numerical Analysis, Oxford Science Publications, Clarendon Press, Oxford (1988). MR 0950175 | Zbl 0626.65029

Partner of