Skip to main content
Log in

Ein neues Gradientenverfahren zur simultanen Berechnung der kleinsten oder größten Eigenwerte des allgemeinen Eigenwertproblems

A new gradient method for the simultaneous calculation of the smallest or largest eigenvalues of the general eigenvalue problem

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

In this paper the eigenvalue problemAx=λBx is considered, whereA andB are symmetric matrices so large that they cannot be stored in the high speed storage of a computer. A general theory of the conjugate gradient method for minimizing the Rayleigh quotient is described and extended to a more general functional for computing simultaneously a few of the largest or smallest eigenvalues and the corresponding eigenvectors. Abandoning the advantage of the basic algorithm, which does not require the inversion or the factorization of one of the given matrices, the procedure can be used to solve the problem more effectively than by simultaneous iteration, especically in the case of clustered eigenvalues in the end of the spectrum.

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.

Similar content being viewed by others

Literatur

  1. Frank, W.L.: Computing Eigenvalues of complex matrices by determinant evaluation and by methods of Danilewski and Wielandt. J. Soc. industr. appl. Math.6, 378–392 (1958)

    Google Scholar 

  2. Fried, I.: Optimal gradient minimization scheme for finite element eigenproblems. J. Sound Vibration20, 333–342 (1972)

    Google Scholar 

  3. Geradin, M.: The computational efficiency of a new minimization algorithm for eigenvalue analysis. J. Sound Vibration19, 319–331 (1971)

    Google Scholar 

  4. McCormick, S.F., Noe, T.: Simultaneous iteration for the matrix eigenvalue problem. Linear Algebra Appl.16, 43–56 (1977)

    Google Scholar 

  5. Meyer, A.: Varianten der simultanen Iteration zur Berechnung einiger Eigenwerte und Eigenvektoren des allgemeinen großdimensionierten Eigenwertproblems. Beitr. zur Num. Math.10, 107–115 (1981)

    Google Scholar 

  6. Meyer, A.: Über Algorithmen zur Lösung von großdimensionierten allgemeinen Eigenwertproblemen. ZfR Informationen, INFO 81 Neubrandenburg, Sektion V, AdW d. DDR, Berlin 1981

    Google Scholar 

  7. Ruhe, A.: Iterative eigenvalue algorithms for large symmetric matrices. Numer. Beh. Eigenwertaufg., Tagung Oberwolfach 1972, ISNM 24, 97–115 (1974)

    Google Scholar 

  8. Schwarz, H.R.: The eigenvalue problem(A−λB)x=0 for symmetric matrices of high order. Computer Methods appl. Mech. Engin.3, 11–28 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Döhler, B. Ein neues Gradientenverfahren zur simultanen Berechnung der kleinsten oder größten Eigenwerte des allgemeinen Eigenwertproblems. Numer. Math. 40, 79–91 (1982). https://doi.org/10.1007/BF01459077

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01459077

Subject Classifications

Navigation