Skip to main content
Log in

New Algorithms for Solving Nonlinear Eigenvalue Problems

  • GENERAL NUMERICAL METHODS
  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

To solve a nonlinear eigenvalue problem we develop algorithms which compute zeros of \(\det A(\lambda ) = 0\). We show how to apply third order iteration methods for that purpose. The necessary derivatives of the determinant are computed by algorithmic differentiation. Since many nonlinear eigenvalue problems have banded matrices we also present an algorithm which makes use of their structure.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.

Similar content being viewed by others

Notes

  1. http://www.maths.manchester.ac.uk/our-research/research-groups/numerical-analysis-and-scientific-computing/numerical-analysis/software/nlevp/

REFERENCES

  1. P. Arbenz and W. Gander, “Solving nonlinear eigenvalue problems by algorithmic differentiation,” Computing 36, 205–215 (1986).

    Article  MathSciNet  Google Scholar 

  2. W. Gander, “Zeros of determinants of  λ-matrices,” Matrix Methods: Theory, Algorithms, and Applications Dedicated to the Memory of Gene Golub (World Scientific, Singapore, 2010), pp. 238–246.

    Google Scholar 

  3. W. Gander, M. J. Gander, and F. Kwok, Scientific Computing: An Introduction Using MAPLE and MATLAB (Springer, Switzerland, 2014).

    Book  Google Scholar 

  4. H. J. Maehly, “Zur iterativen Auflösung algebraischer Gleichunge,” Z. Angew. Math. Phys. 5, 260–263 (1954).

    Article  MathSciNet  Google Scholar 

  5. F. Tisseur and K. Meerbergen, “The quadratic eigenvalue problem,” SIAM Rev. 43, 234–286 (2001).

    Article  MathSciNet  Google Scholar 

  6. W. Gander, “On Halley’s iteration method,” Am. Math. Mon. 92 (2), 131–134 (1985).

    Article  MathSciNet  Google Scholar 

  7. E. Hansen and M. Patrick, “A family of root finding methods,” Numer. Math. 27, 257–269 (1977).

    Article  MathSciNet  Google Scholar 

  8. T. Betcke, N. J. Higham, V. Mehrmann, C. Schröder, and F. Tisseur, “NLEVP: A collection of nonlinear eigenvalue problems,” ACM Trans. Math. Software 39 (2), 1–28 (2013).

    Article  MathSciNet  Google Scholar 

  9. T. Betcke, N. J. Higham, V. Mehrmann, C. Schröder, and F. Tisseur, A Collection of Nonlinear Eigenvalue Problems: Users’ Guide, MIMS EPrint 2011.117 (Manchester Inst. Math. Sci., Univ. of Manchester, UK, 2011).

  10. N. J. Higham, D. S. Mackey, F. Tisseur, and S. D. Garvey, “Scaling, sensitivity, and stability in the numerical solution of quadratic eigenvalue problems,” Int. J. Numer. Methods Eng. 73, 344–360 (2008).

    Article  MathSciNet  Google Scholar 

  11. H.-Y. Fan, W-W. Lin, and P. Van Dooren, “Normwise scaling of second order polynomial matrices,” SIAM J. Matrix Anal. Appl. 26, 252–256 (2004).

    Article  MathSciNet  Google Scholar 

Download references

ACKNOWLEDGMENTS

The author would like to thank Zhong-Zhi Bai and Yu-Mei Huang, the two organizers of the 2019 Golub Memorial Workshop in Lanzhou. The invitation to participate at this conference was a special motivation for me to develop the algorithms discussed in this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to W. Gander.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gander, W. New Algorithms for Solving Nonlinear Eigenvalue Problems. Comput. Math. and Math. Phys. 61, 761–773 (2021). https://doi.org/10.1134/S0965542521050092

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542521050092

Keywords:

Navigation