Rank computation in Euclidean Jordan algebras

DOI10.1016/j.jsc.2022.04.003zbMath1492.17002OpenAlexW4226124495WikidataQ114154442 ScholiaQ114154442MaRDI QIDQ2133925

Michael Orlitzky

Publication date: 5 May 2022

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2022.04.003

zbMATH Keywords

characteristic polynomialrankspectral decompositionsymmetric coneEuclidean Jordan algebra

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54) Computational methods for problems pertaining to nonassociative rings and algebras (17-08) Linear equations (linear algebraic aspects) (15A06) Jordan algebras (algebras, triples and pairs) (17C99) Solving polynomial systems; resultants (13P15)

Cites Work

• A new polynomial-time algorithm for linear programming
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• A taste of Jordan algebras
• Barrier Functions in Interior Point Methods
• Ideals, Varieties, and Algorithms
• A Jordan-algebraic approach to potential-reduction algorithms
• Unnamed Item
• Unnamed Item