Skip to main content

On Variations of Power Iteration

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3697))

Abstract

The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iteration where the subspace spanned by n largest eigenvectors of a matrix, is determined. The natural power iteration is an exemplary instance of the subspace iteration, providing a general framework for many principal subspace algorithms. In this paper we present variations of the natural power iteration, where n largest eigenvectors of a symmetric matrix without rotation ambiguity are determined, whereas the subspace iteration or the natural power iteration finds an invariant subspace (consisting of rotated eigenvectors). The resulting method is referred to as constrained natural power iteration and its fixed point analysis is given. Numerical experiments confirm the validity of our algorithm.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11550907_163 .

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hua, Y., Xiang, Y., Chen, T., Abed-Meraim, K., Miao, Y.: A new look at the power method for fast subspace tracking. Digital Signal Processing 9, 297–314 (1999)

    Article  Google Scholar 

  2. Golub, G.H., Loan, C.F.V.: Matrix Computations, 2nd edn. Johns Hopkins, Baltimore (1993)

    Google Scholar 

  3. Heath, M.T.: Scientific Computing: An Introductory Survey, 2nd edn. McGraw-Hill, New York (2002)

    Google Scholar 

  4. Oja, E.: Neural networks, principal component analysis, and subspaces. International Journal of Neural Systems 1, 61–68 (1989)

    Article  MathSciNet  Google Scholar 

  5. Yang, B.: Projection approximation subsapce tracking. IEEE Trans. Signal Processing 43, 95–107 (1995)

    Article  MATH  Google Scholar 

  6. Abed-Meraim, K., Chkeif, A., Hua, Y.: Fast orthonormal PAST algorithm. IEEE Signal Processing Letters 7, 60–62 (2000)

    Article  Google Scholar 

  7. Ahn, J.H., Oh, J.H.: A constrained EM algorithm for principal component analysis. Neural Computation 15, 57–65 (2003)

    Article  MATH  Google Scholar 

  8. Ahn, J.H., Choi, S., Oh, J.H.: A new way of PCA: Integrated-squared-error and EM algorithms. In: Proc. IEEE Int’l Conf. Acoustics, Speech, and Signal Processing, Montreal, Canada (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choi, S. (2005). On Variations of Power Iteration. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550907_24

Download citation

  • DOI: https://doi.org/10.1007/11550907_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28755-1

  • Online ISBN: 978-3-540-28756-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics