On the matrix $pth$ root functions and generalized Fibonacci sequences
Rajae Ben Taher, Youness El Khatabi, Mustapha Rachidi

TL;DR
This paper explores polynomial representations of matrix pth root functions using generalized Fibonacci sequences, providing explicit formulas and numerical examples to enhance understanding of matrix root computations.
Contribution
It introduces a novel approach leveraging Fibonacci-Horner decomposition and properties of generalized Fibonacci sequences to derive explicit formulas for matrix pth roots.
Findings
Explicit formulas for matrix pth roots derived
Use of Fibonacci-Horner decomposition in matrix functions
Numerical examples illustrating the methods
Abstract
This study is devoted to the polynomial representation of the matrix th root functions. The Fibonacci-H\"orner decomposition of the matrix powers and some techniques arisen from properties of generalized Fibonacci sequences, notably the Binet formula, serves as a triggering factor to provide explicit formulas for the matrix th roots. Special cases and illustrative numerical examples are given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Combinatorial Mathematics · Advanced Mathematical Identities
