Advertisement

A Newton’s method characterization for real eigenvalue problems

  • Yunho KimEmail author
Article
  • 36 Downloads

Abstract

The current work is a continuation of Kim (An unconstrained global optimization framework for real symmetric eigenvalue problems, submitted), where an unconstrained optimization problem was proposed and a first order method was shown to converge to a global minimizer that is an eigenvector corresponding to the smallest eigenvalue with no eigenvalue estimation given. In this second part, we provide local and global convergence analyses of the Newton’s method for real symmetric matrices. Our proposed framework discovers a new eigenvalue update rule and shows that the errors in eigenvalue and eigenvector estimations are comparable, which extends to nonsymmetric diagonalizable matrices as well. At the end, we provide numerical experiments for generalized eigenvalue problems and for the trust region subproblem discussed in Adachi et al. (SIAM J Optim 27(1):269–291, 2017) to confirm efficiency and accuracy of our proposed method.

Mathematics Subject Classification

49M15 65F15 

Notes

Acknowledgements

This work was supported partially by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (NRF-2014R1A1A1002667) and supported partially by U-K Brand Future-core Research Fund (1.180016.01) of UNIST(Ulsan National Institute of Science & Technology). Moreover, I would like to thank my friend and colleague, Ernie Esser, Ph.D., with whom I had fruitful discussions on various topics in image processing. I could not have initiated this project without his inspiration.

References

  1. 1.
    Kolluri, R., Shewchuk, J., O’Brien, J.: Spectral surface reconstruction from noisy point clouds. In: Proceedings of the 2004 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, no. 11 in SGP ’04, pp. 11–21. ACM, New York (2004)Google Scholar
  2. 2.
    Belkin, M., Sun, J., Wang, Y.: Constructing Laplace operator from point clouds in \(\mathbb{R}^d\). In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’09, pp. 1031–1040. SIAM, Philadelphia, PA, USA (2009)Google Scholar
  3. 3.
    Lai, R., Liang, J., Zhao, H.K.: A local mesh method for solving PDEs on point clouds. Inverse Problems Imaging 7(3), 737–755 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lai, R., Liang, J., Zhao, H.: A local mesh method for solving PDEs on point clouds. Inverse Probl. Imaging 7(3), 737–755 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kim, Y.: An unconstrained global optimization framework for real symmetric eigenvalue problems, submittedGoogle Scholar
  6. 6.
    Tapia, R.A., Dennis, J.E., Schafermeyer, J.P.: Inverse, shifted inverse, and Rayleigh quotient iteration as Newton’s method. SIAM Rev. 60(1), 3–55 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust-region subproblem by a generalized eigenvalue problem. SIAM J. Optim. 27(1), 269–291 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Peters, G., Wilkinson, J.H.: Inverse iteration, ill-conditioned equations and Newton’s method. SIAM Rev. 21(3), 339–360 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Ipsen, I.C.F.: Computing an eigenvector with inverse iteration. SIAM Rev. 39(2), 254–291 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Stewart, G.W., Sun, J.-G.: Matrix Perturbation Theory. Computer Science and Scientific Computing. Academic Press, Boston (1990)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Ulsan National Institute of Science and TechnologyUlsanSouth Korea

Personalised recommendations