| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6421852 | Applied Mathematics and Computation | 2013 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
J. Abderramán Marrero, R. Ben Taher, M. Rachidi,