- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
A Process for Solving a Few Extreme Eigenpairs of Large Sparse Positive Definite Generalized Eigenvalue Problem
- BibTex
- RIS
- TXT
@Article{JCM-18-387,
author = {},
title = {A Process for Solving a Few Extreme Eigenpairs of Large Sparse Positive Definite Generalized Eigenvalue Problem},
journal = {Journal of Computational Mathematics},
year = {2000},
volume = {18},
number = {4},
pages = {387--402},
abstract = { In this paper, an algorithm for computing some of the largest (smallest) generalized eigenvalues with corresponding eigenvectors of a sparse symmetric positive definite matrix pencil is presented. The algorithm uses an iteration function and inverse power iteration process to get the largest one first, then exectues m-1 Lanczos-like steps to get initial approximations of the next m-1 ones, without computing any Ritz pair, for which a procedure combining Rayleigh quotient iteration with shifted inverse power iteration is used to obtain more accurate eigenvalues and eigenvectors. This algorithm keeps the advantages of presevering sparsity of the original matrices as in Lanczos method and RQI and converges with a higher rate than the method described in [12] and provides a simple technique to compute initial approximate pairs which are guaranteed to converge to the wanted m largest eigenpairs using RQI. In addition, it avoids some of the disadvantages of Lanczos and RQI, for solving extreme eigenproglems.When symmetric positive definite linear sysmtes must be solved in the process,an algebraic multilevel iteration method (AMLI) is applied. The algorithm is fully parallelizable. },
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9051.html}
}
TY - JOUR
T1 - A Process for Solving a Few Extreme Eigenpairs of Large Sparse Positive Definite Generalized Eigenvalue Problem
JO - Journal of Computational Mathematics
VL - 4
SP - 387
EP - 402
PY - 2000
DA - 2000/08
SN - 18
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9051.html
KW - Eigenvalue
KW - sparse problem
AB - In this paper, an algorithm for computing some of the largest (smallest) generalized eigenvalues with corresponding eigenvectors of a sparse symmetric positive definite matrix pencil is presented. The algorithm uses an iteration function and inverse power iteration process to get the largest one first, then exectues m-1 Lanczos-like steps to get initial approximations of the next m-1 ones, without computing any Ritz pair, for which a procedure combining Rayleigh quotient iteration with shifted inverse power iteration is used to obtain more accurate eigenvalues and eigenvectors. This algorithm keeps the advantages of presevering sparsity of the original matrices as in Lanczos method and RQI and converges with a higher rate than the method described in [12] and provides a simple technique to compute initial approximate pairs which are guaranteed to converge to the wanted m largest eigenpairs using RQI. In addition, it avoids some of the disadvantages of Lanczos and RQI, for solving extreme eigenproglems.When symmetric positive definite linear sysmtes must be solved in the process,an algebraic multilevel iteration method (AMLI) is applied. The algorithm is fully parallelizable.
Chong Hua Yu & O. Axelsson. (1970). A Process for Solving a Few Extreme Eigenpairs of Large Sparse Positive Definite Generalized Eigenvalue Problem.
Journal of Computational Mathematics. 18 (4).
387-402.
doi:
Copy to clipboard