- Full text PDF available (3)
- This year (0)
- Last 5 years (1)
- Last 10 years (2)
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 n-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… (More)
1. INTRODUCTION. In this note we present a straightforward method for evaluating the probability integral: ∞
The concept of modification used for accelerating the convergence of ordinary continued fractions is adapted to the case of the Gautschi-Aggarwal-Burgmeier algorithm for the computation of nondominant solutions of nonhomogeneous second-order linear recurrence relations.
In this paper we construct ann-fraction which is a generalization of a Thiele continued fraction. We prove that, under certain conditions, themth approximant of thisn-fraction solves the vector case of the rational interpolation problem.