Abstract
We discuss four eigenvalue problems of increasing generality and complexity: rooting a univariate polynomial, solving the polynomial eigenvalue problem, rooting a set of multivariate polynomials and solving multi-parameter eigenvalue problems. In doing so, we provide a unifying framework for solving these eigenvalue problems, where we exploit properties of (block-) (multi-) shift-invariant subspaces and use multi-dimensional realization algorithms.
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.
