Abstract
We describe a method for evaluating both the Fibonacci-Hörner and the polynomial decomposition of the principal matrix logarithm, with a view to solve the lifting problem of its explicit computation. The Binet formula for linear recursive sequences serves as a triggering factor for giving the exact formula. We supply some illustrative examples.
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.
