Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 50 min ago
PreprintarXiv licencearXiv

A Gaussian Process Regression-Enhanced Two-Sweep Parameterized Power Method for Computing Extreme Eigenpairs

Abstract

For computing the dominant eigenvalue and the corresponding eigenvector of a real and symmetric matrix, inspired by the parameterized power method and multistep iteration, we propose a two-sweep parameterized power method, and establish its convergence theory. To further improve the convergence speed of the new method, we use Gaussian process regression (GPR) to predict the quasi-optimal parameter and give a version of the proposed method based on GPR. Numerical experiments show that the two-sweep parameterized power method with quasi-optimal parameters outperforms some existing methods in terms of computing efficiency.

Related

  1. Stable and effective restarting of the SS--RR and SS--RRR methods for computing partial eigenpairs of Hermitian matrices
    Zhongxiao Jia, Tianhang Liu
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. The Zero Pattern of a Design Matrix Drives Multiple Descent in Over-parameterized Regression
    Kevin Han Huang, Haoyu Ye, Somak Laha +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Sharp Generalization for Nonparametric Regression in Interpolation Space by Shallow Over-Parameterized Neural Networks with Channel Attention
    Yingzhen Yang, Ping Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Efficient estimation methods for non-Gaussian regression models in continuous time
    Evgeny A Pchelintsev, Sergey Pergamenshchikov, Maria Povzun
    Annals of the Institute of Statistical MathematicsPeer-reviewedPublisher termsFull text5 citedStatisticsHAL
  5. Computing the entropy rate of a quantized stationary Gaussian process
    Jeremy Magland
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
BibTeX
@misc{sun2026gaussian,
  title = {{A Gaussian Process Regression-Enhanced Two-Sweep Parameterized Power Method for Computing Extreme Eigenpairs}},
  author = {Tiantian Sun and Xiaofei Peng and Juan Zhang and Seakweng Vong},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41627},
  eprint = {2610.41627},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41627},
}
RIS
TY  - UNPB
TI  - A Gaussian Process Regression-Enhanced Two-Sweep Parameterized Power Method for Computing Extreme Eigenpairs
AU  - Tiantian Sun
AU  - Xiaofei Peng
AU  - Juan Zhang
AU  - Seakweng Vong
PY  - 2026
DA  - 2026/10/30
PB  - arXiv
DO  - 10.48550/arxiv.2610.41627
UR  - https://arxiv.org/abs/2610.41627
AB  - For computing the dominant eigenvalue and the corresponding eigenvector of a real and symmetric matrix, inspired by the parameterized power method and multistep iteration, we propose a two-sweep parameterized power method, and establish its convergence theory. To further improve the convergence speed of the new method, we use Gaussian process regression (GPR) to predict the quasi-optimal parameter and give a version of the proposed method based on GPR. Numerical experiments show that the two-sweep parameterized power method with quasi-optimal parameters outperforms some existing methods in terms of computing efficiency.
ER  -