An orthogonality-preserving approach for eigenvalue problems
By: Tianyang Chu , Xiaoying Dai , Shengyue Wang and more
Potential Business Impact:
Solves tough math problems much faster.
Solving large-scale eigenvalue problems poses a significant challenge due to the computational complexity and limitations on the parallel scalability of the orthogonalization operation, when many eigenpairs are required. In this paper, we propose an intrinsic orthogonality-preserving model, formulated as an evolution equation, and a corresponding numerical method for eigenvalue problems. The proposed approach automatically preserves orthogonality and exhibits energy dissipation during both time evolution and numerical iterations, provided that the initial data are orthogonal, thus offering an accurate and efficient approximation for the large-scale eigenvalue problems with orthogonality constraints. Furthermore, we rigorously prove the convergence of the scheme without the time step size restrictions imposed by the CFL conditions. Numerical experiments not only corroborate the validity of our theoretical analyses but also demonstrate the remarkably high efficiency of the algorithm.
Similar Papers
An adaptive finite element discretization based parallel orbital-updating method for eigenvalue problems
Numerical Analysis
Finds many important numbers for complex math problems.
A Bi-Orthogonal Structure-Preserving eigensolver for large-scale linear response eigenvalue problem
Numerical Analysis
Solves hard math problems faster on computers.
A Unified Perspective on Orthogonalization and Diagonalization
Numerical Analysis
Unifies math tools, making computers faster and more stable.