arrow
Volume 18, Issue 1
Inexact Iterative WYD Method for Eigenvalue Problems

Fangyi Zheng, Jianyang Luo & Shuli Sun

Adv. Appl. Math. Mech., 18 (2026), pp. 93-108.

Published online: 2025-10

Export citation
  • Abstract

In this paper, we propose a new inexact iterative subspace projection method for real symmetric positive definite generalized eigenvalue problems based on the WYD (an abbreviation of the initials of the proposers: Wilson, Yuan, and Dickens [1]) method. Firstly an analysis of the convergence condition of the approximate eigenvectors is given when ${\bf Ar}_{k+1}=\lambda{\bf Br}_k$ is inexactly solved by the Krylov subspace methods. Then the inexact iterative WYD (IIWYD) method is constructed, which utilizes the approximate Ritz subspace generated by the WYD method with an inexact solver as the main search space. The IIWYD method improves the quality of the search space during the iterative process, significantly reduces the number of iteration steps, and improves the overall computational efficiency and stability. The results of numerical experiments show that the IIWYD method is more efficient and stable compared to the locally optimal block preconditioned conjugate gradient (LOBPCG) method and the Jacobi-Davidson (JD) method. In addition, we also discuss the effects of the refined strategy and the conjugate strategy in our method.

  • AMS Subject Headings

65F15, 65F10

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{AAMM-18-93, author = {Zheng , FangyiLuo , Jianyang and Sun , Shuli}, title = {Inexact Iterative WYD Method for Eigenvalue Problems}, journal = {Advances in Applied Mathematics and Mechanics}, year = {2025}, volume = {18}, number = {1}, pages = {93--108}, abstract = {

In this paper, we propose a new inexact iterative subspace projection method for real symmetric positive definite generalized eigenvalue problems based on the WYD (an abbreviation of the initials of the proposers: Wilson, Yuan, and Dickens [1]) method. Firstly an analysis of the convergence condition of the approximate eigenvectors is given when ${\bf Ar}_{k+1}=\lambda{\bf Br}_k$ is inexactly solved by the Krylov subspace methods. Then the inexact iterative WYD (IIWYD) method is constructed, which utilizes the approximate Ritz subspace generated by the WYD method with an inexact solver as the main search space. The IIWYD method improves the quality of the search space during the iterative process, significantly reduces the number of iteration steps, and improves the overall computational efficiency and stability. The results of numerical experiments show that the IIWYD method is more efficient and stable compared to the locally optimal block preconditioned conjugate gradient (LOBPCG) method and the Jacobi-Davidson (JD) method. In addition, we also discuss the effects of the refined strategy and the conjugate strategy in our method.

}, issn = {2075-1354}, doi = {https://doi.org/10.4208/aamm.OA-2023-0024}, url = {http://global-sci.org/intro/article_detail/aamm/24520.html} }
TY - JOUR T1 - Inexact Iterative WYD Method for Eigenvalue Problems AU - Zheng , Fangyi AU - Luo , Jianyang AU - Sun , Shuli JO - Advances in Applied Mathematics and Mechanics VL - 1 SP - 93 EP - 108 PY - 2025 DA - 2025/10 SN - 18 DO - http://doi.org/10.4208/aamm.OA-2023-0024 UR - https://global-sci.org/intro/article_detail/aamm/24520.html KW - Eigenvalue problems, iterative method, WYD, LOBPCG, Jacobi-Davidson. AB -

In this paper, we propose a new inexact iterative subspace projection method for real symmetric positive definite generalized eigenvalue problems based on the WYD (an abbreviation of the initials of the proposers: Wilson, Yuan, and Dickens [1]) method. Firstly an analysis of the convergence condition of the approximate eigenvectors is given when ${\bf Ar}_{k+1}=\lambda{\bf Br}_k$ is inexactly solved by the Krylov subspace methods. Then the inexact iterative WYD (IIWYD) method is constructed, which utilizes the approximate Ritz subspace generated by the WYD method with an inexact solver as the main search space. The IIWYD method improves the quality of the search space during the iterative process, significantly reduces the number of iteration steps, and improves the overall computational efficiency and stability. The results of numerical experiments show that the IIWYD method is more efficient and stable compared to the locally optimal block preconditioned conjugate gradient (LOBPCG) method and the Jacobi-Davidson (JD) method. In addition, we also discuss the effects of the refined strategy and the conjugate strategy in our method.

Zheng , FangyiLuo , Jianyang and Sun , Shuli. (2025). Inexact Iterative WYD Method for Eigenvalue Problems. Advances in Applied Mathematics and Mechanics. 18 (1). 93-108. doi:10.4208/aamm.OA-2023-0024
Copy to clipboard
The citation has been copied to your clipboard