An Efficient Memory Gradient Method for Extreme M-Eigenvalues of Elastic type Tensors
Abstract
M-eigenvalues of fourth order hierarchically symmetric tensors play a significant role in nonlinear elastic material analysis and quantum entanglement problems. This paper focuses on computing extreme M-eigenvalues for such tensors. To achieve this, we first reformulate the M-eigenvalue problem as a sequence of unconstrained optimization problems by introducing a shift parameter. Subsequently, we develop a memory gradient method specifically designed to approximate these extreme M-eigenvalues. Under this framework, we establish the global convergence of the proposed method. Finally, comprehensive numerical experiments demonstrate the efficacy and stability of our approach.
Fields of Study & Subjects
Tensor decomposition and applications
Advanced Optimization Algorithms Research
Matrix Theory and Algorithms
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 1 February 2026
- Document type
- Preprint