An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors

From MaRDI portal
Publication:363541




Abstract: Let n be a positive integer and m be a positive even integer. Let mathcalA be an mth order n-dimensional real weakly symmetric tensor and mathcalB be a real weakly symmetric positive definite tensor of the same size. lambdainR is called a mathcalBr-eigenvalue of mathcalA if mathcalAxm1=lambdamathcalBxm1 for some . In this paper, we introduce two unconstrained optimization problems and obtain some variational characterizations for the minimum and maximum mathcalBr--eigenvalues of mathcalA. Our results extend Auchmuty's unconstrained variational principles for eigenvalues of real symmetric matrices. This unconstrained optimization approach can be used to find a Z-, H-, or D-eigenvalue of an even order weakly symmetric tensor. We provide some numerical results to illustrate the effectiveness of this approach for finding a Z-eigenvalue and for determining the positive semidefiniteness of an even order symmetric tensor.




Cited in
(25)






This page was built for publication: An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors

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