Results 1  10
of
7,706
Recurrence relations:
"... Many of the special functions and polynomials are constructed along standard procedures In this short survey we list the most essential ones. ..."
Abstract
 Add to MetaCart
Many of the special functions and polynomials are constructed along standard procedures In this short survey we list the most essential ones.
ON A NONLINEAR RECURRENT RELATION
, 902
"... Abstract. We study the limiting behavior for the solutions of a nonlinear recurrent relation which arises from the study of NavierStokes equations [1]. Some stability theorems are also shown concerning a related class of linear recurrent relations. 1. Introduction and ..."
Abstract
 Add to MetaCart
Abstract. We study the limiting behavior for the solutions of a nonlinear recurrent relation which arises from the study of NavierStokes equations [1]. Some stability theorems are also shown concerning a related class of linear recurrent relations. 1. Introduction and
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order
An Undecidable Nested Recurrence Relation
, 1203
"... Abstract. Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form...A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested re ..."
Abstract
 Add to MetaCart
Abstract. Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form...A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested
A recurrence related to trees
 Proceedings of the American Mathematical Society
, 1989
"... Abstract. The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer c ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
Abstract. The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer
Recurrence relations for connection coefficients . . .
"... We obtain the structure relations for qorthogonal polynomials in the exponential lattice q 2s and from that we construct the recurrence relation for the connection coecients between two families of polynomials belonging to the classical class of discrete qorthogonal polynomials. An explicit exa ..."
Abstract
 Add to MetaCart
We obtain the structure relations for qorthogonal polynomials in the exponential lattice q 2s and from that we construct the recurrence relation for the connection coecients between two families of polynomials belonging to the classical class of discrete qorthogonal polynomials. An explicit
Recurrence relations for computing complete
, 1984
"... Summary. A set of recurrence relations which are computationally more efficient than those of the reflection matrix method of Kennett & Kerry is presented for P and SVwave generation in a (n + I) layered medium. The recurrence relations contain no growing terms and thus provide a stable algor ..."
Abstract
 Add to MetaCart
Summary. A set of recurrence relations which are computationally more efficient than those of the reflection matrix method of Kennett & Kerry is presented for P and SVwave generation in a (n + I) layered medium. The recurrence relations contain no growing terms and thus provide a stable
SOLUTIONS FOR GENERAL RECURRENCE RELATIONS
"... In a recent article [1], the author obtained representations for the solutions of certain r9s. recurrence relations. In this paper we shall give representations for the solutions of general recurrence relations. In Section 4 we shall show that the results in[l] are a special case of the results of S ..."
Abstract
 Add to MetaCart
In a recent article [1], the author obtained representations for the solutions of certain r9s. recurrence relations. In this paper we shall give representations for the solutions of general recurrence relations. In Section 4 we shall show that the results in[l] are a special case of the results
Recurrence relations and fast algorithms
 Treatise on the Theory of Bessel Functions
, 2005
"... We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the values of these linear combinations at certain points, and, ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the values of these linear combinations at certain points, and
(Probabilistic) Recurrence Relations Revisited
"... . The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T (x) = a(x)+T (H(x)), where a is a function and H(x) is a random variable. For instance, T (x) may describe the running time of such an algorithm on a problem of size x. The ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
. The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T (x) = a(x)+T (H(x)), where a is a function and H(x) is a random variable. For instance, T (x) may describe the running time of such an algorithm on a problem of size x
Results 1  10
of
7,706