Fibonacci Operational Matrix Algorithm For Solving Differential Equations Of Lane-Emden Type
The aim of this study is presentan effective and correct technique for solving differential equations ofLane-Emden type as initial value problems. In this work, a numerical method namedas the Fibonacci polynomial approximation method, for the approximate
Musa Çakmak
doaj +1 more source
A fast Fibonacci wavelet-based numerical algorithm for the solution of HIV-infected CD4+T cells model. [PDF]
Vivek, Kumar M, Mishra SN.
europepmc +1 more source
A numerical method to solve fractional Fredholm-Volterra integro-differential equations
The Goolden ratio is famous for the predictability it provides both in the microscopic world as well as in the dynamics of macroscopic structures of the universe. The extension of the Fibonacci series to the Fibonacci polynomials gives us the opportunity
Antonela Toma, Octavian Postavaru
doaj
Sums of powers of Fibonacci polynomials [PDF]
Using the explicit (Binet) formula for the Fibonacci polynomials, a summation formula for powers of Fibonacci polynomials is derived straightforwardly, which generalizes a recent result for squares that appeared in Proc. Ind. Acad. Sci. (Math. Sci.) 118 (2008) 27–41.
openaire +1 more source
The Power Sums Involving Fibonacci Polynomials and Their Applications
The Girard and Waring formula and mathematical induction are used to study a problem involving the sums of powers of Fibonacci polynomials in this paper, and we give it interesting divisible properties.
Li Chen, X. Wang
semanticscholar +1 more source
Determinantal and permanental representation of generalized bivariate Fibonacci p-polynomials [PDF]
In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Fibonacci p-polynomials are general form of, for example, bivariate Fibonacci and Pell p-polynomials, second kind ...
arxiv
Derivations and Identitites for Fibonacci and Lucas Polynomials
We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any polynomial identity for Appel polynomial yields a polynomial identity for the Fibonacci and Lucas polynomials and ...
openaire +2 more sources
Simulating accurate and effective solutions of some nonlinear nonlocal two-point BVPs: Clique and QLM-clique matrix methods. [PDF]
Izadi M, Singh J, Noeiaghdam S.
europepmc +1 more source
Generalizations of the Fibonacci and Lucas polynomials [PDF]
In this note we consider two sequences of polynomials, which are denoted by {Un(k),m} and {Vn(k),m}, where k, m, n are nonnegative integers, and m ? 2. These sequences represent generalizations of the well-known Fibonacci and Lucas polynomials. For example, if m = 2, then we obtain exactly the Fibonacci and Lucas polynomials. If m = 3, then polynomials
openaire +2 more sources
Combined Pseudo-Random Sequence Generator for Cybersecurity. [PDF]
Maksymovych V+5 more
europepmc +1 more source