We introduce a matrix continued fraction associated with the first-order linear recurrence system Y_k = θ_k Y_{k-1}. A Pincherle type convergence theorem is proved. We show that the r-th order linear recurrence relation and previous generalizations of ordinary continued fractions form a special case. We give an application for the numerical computation of a non-dominant solution and discuss special cases where θk is constant for all k and the limiting case where lim_{k → ∞} θ_k is constant. Finally the notion of adjoint fraction is introduced which generalizes the notion of the adjoint of a recurrence relation of order r.nrpages: 16status: publishe
The central feature of this study is to provide an exposition on the introduction to linear recurren...
AbstractThe aim of this work is to give some criteria on the convergence of matrix continued fractio...
AbstractAn O(log n) algorithm for computing the nth convergents of periodic continued fractions is p...
Abstract: In 1894 Pinkerle proved the theorem, which assist the connection between the exi...
AbstractWe discuss the properties of matrix-valued continued fractions based on Samelson inverse. We...
AbstractPincherle theorems equate convergence of a continued fraction to existence of a recessive so...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractIn this paper we prove a generalization to higher-order linear recurrence relations of Pring...
This paper explores a connection between third order recursive sequences and generalized continued f...
Abstract. In this paper we consider pairs of recurrence relations where we are interested in the rat...
The concept of modification used for accelerating the convergence of ordinary continued fractions is...
23 pages, 6 figures.-- MSC2000 codes: 33C05, 33C15, 39A11, 40A15, 65D20.MR#: MR2291841 (2008h:33007)...
Abstract. We consider k sequences of generalized order-k linear recurrences with arbitrary initial c...
AbstractA matrix continued fraction is defined and used for the approximation of a function F known ...
We consider k sequences of generalized order-k linear recurrences with arbitrary initial conditions ...
The central feature of this study is to provide an exposition on the introduction to linear recurren...
AbstractThe aim of this work is to give some criteria on the convergence of matrix continued fractio...
AbstractAn O(log n) algorithm for computing the nth convergents of periodic continued fractions is p...
Abstract: In 1894 Pinkerle proved the theorem, which assist the connection between the exi...
AbstractWe discuss the properties of matrix-valued continued fractions based on Samelson inverse. We...
AbstractPincherle theorems equate convergence of a continued fraction to existence of a recessive so...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractIn this paper we prove a generalization to higher-order linear recurrence relations of Pring...
This paper explores a connection between third order recursive sequences and generalized continued f...
Abstract. In this paper we consider pairs of recurrence relations where we are interested in the rat...
The concept of modification used for accelerating the convergence of ordinary continued fractions is...
23 pages, 6 figures.-- MSC2000 codes: 33C05, 33C15, 39A11, 40A15, 65D20.MR#: MR2291841 (2008h:33007)...
Abstract. We consider k sequences of generalized order-k linear recurrences with arbitrary initial c...
AbstractA matrix continued fraction is defined and used for the approximation of a function F known ...
We consider k sequences of generalized order-k linear recurrences with arbitrary initial conditions ...
The central feature of this study is to provide an exposition on the introduction to linear recurren...
AbstractThe aim of this work is to give some criteria on the convergence of matrix continued fractio...
AbstractAn O(log n) algorithm for computing the nth convergents of periodic continued fractions is p...