Abstract
In Part I we proposed a multilinear algebra framework to solve 0-dimensional systems of polynomial equations with simple roots. We extend this framework to incorporate multiple roots: a block term decomposition (BTD) of the null space of the Macaulay matrix reveals the dual (sub)space of a disjoint root in each term. The BTD is the joint triangularization of multiplication tables and a three-way generalization of the Jordan canonical form in the matrix case, intimately related to the border rank of a tensor. We hint at and illustrate flexible numerical optimization-based algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
