返回
APPROXIMATING MATRIX EIGENVALUES BY SUBSPACE ITERATION WITH REPEATED RANDOM SPARSIFICATION
DOI:10.1137/21M1422513.png)
摘要
En 中文
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by leveraging repeated random sampling and averaging. We present a general approach to extending such methods for the estimation of multiple eigenvalues and demonstrate its performance for several benchmark problems in quantum chemistry.
Keyword:
eigenvalues
subspace iteration
randomized algorithms
Monte Carlo
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Undiagnosed Progressive Supranuclear Palsy in a Patient With Neuroleptic Malignant Syndrome Due to Use of Neuroleptics使用神经抑制剂的神经抑制剂恶性综合征患者中未诊断出的进行性核上性麻痹
Determinants of the Abilities to Jump Higher and Shorten the Contact Time in a Running 1-Legged Vertical Jump in Basketball在篮球中进行单腿垂直跳跃时跳得更高并缩短接触时间的能力的决定因素

