嵌套子空间的增广拉格朗日法求解稀疏广义特征值问题
Nested Subspace Augmented Lagrangian Method for Solving Sparse Generalized Eigenvalue Problems
摘要: 稀疏广义特征值问题作为计算数学领域的重要研究课题,其核心在于确定满足广义特征方程 Ax=λBx 的特征对 ( λ,x ) ,其中 A n×n ,B n×n 为给定的系数矩阵。值得注意的是,在工程结构分析、计算金融学、量子物理模拟及航空航天设计等实际应用场景中,所涉及的矩阵往往具有大规模、稀疏性以及非对称性等复杂特性,这对传统数值求解方法提出了严峻挑战。针对对称广义特征值问题的特殊数学结构,本文研究创新性地提出一种基于子空间构造与优化算法协同的数值计算方法。该方法通过建立具有良好逼近特性的子空间,结合增广拉格朗日半光滑牛顿法(ALMSsn)实现特征系统的高效求解,为解决大规模稀疏矩阵的广义特征值问题提供了新的技术途径。
Abstract: The sparse generalized eigenvalue problem, as a pivotal research subject in computational mathematics, focuses on determining eigenpairs ( λ,x ) that satisfy the generalized eigenvalue equation Ax=λBx , where A n×n ,B n×n are given coefficient matrices. It is noteworthy that in practical applications such as structural engineering analysis, computational finance, quantum physics simulations, and aerospace design, the involved matrices often exhibit complex characteristics including large-scale dimensions, sparsity, and asymmetry, posing significant challenges to conventional numerical solvers. Targeting the specific mathematical structure of symmetric generalized eigenvalue problems, this study innovatively proposes a numerical computational methodology that integrates subspace construction with optimization algorithms. By establishing subspaces with superior approximation properties and combining them with an augmented Lagrangian semi-smooth Newton method, the proposed approach enables efficient resolution of eigen-systems, thereby providing a novel technical pathway for addressing large-scale sparse generalized eigenvalue problems.
文章引用:梁艺赢. 嵌套子空间的增广拉格朗日法求解稀疏广义特征值问题[J]. 运筹与模糊学, 2025, 15(2): 866-879. https://doi.org/10.12677/orf.2025.152132

参考文献

[1] Saad, Y. (1992) Numerical Methods for Large Eigenvalue Problems: Theory and Algorithms. Manchester University Press.
[2] Fokkema, D.R., Sleijpen, G.L.G. and Van der Vorst, H.A. (1998) Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils. SIAM Journal on Scientific Computing, 20, 94-125. [Google Scholar] [CrossRef
[3] Benzi, M. (2002) Preconditioning Techniques for Large Linear Systems: A Survey. Journal of Computational Physics, 182, 418-477. [Google Scholar] [CrossRef
[4] Saad, Y. (1996) Iterative Methods for Sparse Linear Systems. PWS Publishing Company.
[5] Knyazev, A.V. (2001) Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method. SIAM Journal on Scientific Computing, 23, 517-541. [Google Scholar] [CrossRef
[6] Gambolati, G., Pini, G. and Sartoretto, F. (1988) An Improved Iterative Optimization Technique for the Leftmost Eigenpairs of Large Symmetric Matrices. Journal of Computational Physics, 74, 41-60. [Google Scholar] [CrossRef
[7] Neymeyr, K. (2001) A Geometric Theory for Preconditioned Inverse Iteration I: Extrema of the Rayleigh Quotient. Linear Algebra and Its Applications, 322, 61-85. [Google Scholar] [CrossRef
[8] Golub, G.H. and Ye, Q. (2002) An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems. SIAM Journal on Scientific Computing, 24, 312-334. [Google Scholar] [CrossRef
[9] Quillen, P. and Ye, Q. (2010) A Block Inverse-Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems. Journal of Computational and Applied Mathematics, 233, 1298-1313. [Google Scholar] [CrossRef
[10] Alimisis, F., Saad, Y. and Vandereycken, B. (2024) Gradient-Type Subspace Iteration Methods for the Symmetric Eigenvalue Problem. SIAM Journal on Matrix Analysis and Applications, 45, 2360-2386. [Google Scholar] [CrossRef
[11] Zhang, L. and Shen, C. (2018) A Nested Lanczos Method for the Trust-Region Subproblem. SIAM Journal on Scientific Computing, 40, A2005-A2032. [Google Scholar] [CrossRef
[12] Beck, A. (2017) First-Order Methods in Optimization. Society for Industrial and Applied Mathematics. [Google Scholar] [CrossRef
[13] 刘浩洋, 户将, 李勇锋, 等. 最优化: 建模、算法与理论[M]. 北京: 高等教育出版社, 2020.
[14] Li, X., Sun, D. and Toh, K. (2018) A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems. SIAM Journal on Optimization, 28, 433-458. [Google Scholar] [CrossRef