Treffer: A variant of the subspace iteration algorithm for generalized eigenproblems

Title:
A variant of the subspace iteration algorithm for generalized eigenproblems
Authors:
S. Rajendran, K.M. Liew
Source:
International Journal for Numerical Methods in Engineering. 57:2027-2042
Publisher Information:
Wiley, 2003.
Publication Year:
2003
Subject Terms:
Numerical computation of eigenvalues and eigenvectors of matrices, generalized eigenproblem, subspace iteration, eigenvalues, 0211 other engineering and technologies, eigenvectors, 02 engineering and technology, numerical experiments, Rayleigh-Ritz method, 0201 civil engineering
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Language:
English
ISSN:
1097-0207
0029-5981
DOI:
10.1002/nme.753
Access URL:
https://zbmath.org/2037400
https://doi.org/10.1002/nme.753
https://ui.adsabs.harvard.edu/abs/2003IJNME..57.2027R/abstract
https://onlinelibrary.wiley.com/doi/10.1002/nme.753
Rights:
Wiley Online Library User Agreement
Accession Number:
edsair.doi.dedup.....001f67ac07b10ccd1d409c9fdbb24c07
Database:
OpenAIRE

Weitere Informationen

A variant of the subspace iteration algorithm for the generalized eigenproblem, Kp= λMp, is proposed. The algorithm does not require the computation of the projected stiffness matrix, and hence, the projected eigenproblem turns out to be a standard eigenproblem as against the generalized eigenproblem of the classical algorithm. This results in appreciable saving in the number of operations of the Rayleigh–Ritz step and hence the solution time, particularly when a large number of eigenvalues are to be computed. The numerical experiments suggest that the proposed algorithm can yield a saving in solution time of up to 28% for certain eigenproblems. Copyright © 2003 John Wiley & Sons, Ltd.