Solving the k-sparse eigenvalue problem with reinforcement learning

From MaRDI portal

Solving the \(k\)-sparse eigenvalue problem with reinforcement learning

Jump to:navigation, search

DOI10.4208/CSIAM-AM.2020-0220MaRDI QIDQ6941305zbMATH OpenFDO

Authors Li Zhou, Lihao Yan, M. A. Caprio, Weiguo Gao, Chao Yang

Publication date 19 August 2025

Published in CSIAM Transactions on Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

high performance computing reinforcement learning stochastic sampling quantum many-body problem large-scale eigenvalue problem eigenvector localization approximate Q-learning

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Eigenvalues, singular values, and eigenvectors (15A18)

This page was built for publication: Solving the \(k\)-sparse eigenvalue problem with reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941305)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Solving_the_%5C(k%5C)-sparse_eigenvalue_problem_with_reinforcement_learning&oldid=75920853"