Abstract
Adapting Silverman's structure algorithm a general, efficient and recursive algorithm is given for the following problem. Given the Laurent expansion at α of a non-singular rational matrix A(p), compute the Laurent expansion of the inverse A(p)−1 at α. The use of this algorithm in the inversion of rational and polynomial matrices and in particular the computation of the partial fraction expansion of the inverse are discussed.
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.
