Abstract
For bivariate polynomials of degree we give fast numerical constructions of determinantal representations with matrices. Unlike some other existing constructions, our approach returns matrices of the smallest possible size for all (not just generic) polynomials of degree n and does not require any symbolic computation. We can apply these linearizations to numerically compute the roots of a system of two bivariate polynomials by using numerical methods for the two-parameter eigenvalue problems.
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.
