Results 281 to 290 of about 21,263 (317)
Some of the next articles are maybe not open access.
Factors in recurrence relations
The Mathematical Gazette, 1989Suppose we are given a sequence of numbers defined by a linear recurrence relation with constant coefficients, for example the Fibonacci numbers which are defined by:
openaire +2 more sources
1971
Publisher Summary The method of reducing a problem to an analogous problem involving a smaller number of objects is called the method of recurrence relations. With the help of a recurrence relation, a problem involving n objects to one involving n – 1 objects, then to one involving n – 2 objects, and so on, can be reduced.
openaire +2 more sources
Publisher Summary The method of reducing a problem to an analogous problem involving a smaller number of objects is called the method of recurrence relations. With the help of a recurrence relation, a problem involving n objects to one involving n – 1 objects, then to one involving n – 2 objects, and so on, can be reduced.
openaire +2 more sources
2013
Walter Gautschi is a giant in the field of linear recurrence relations. His concern is with stability in computing solutions \( \{y_{n}\}_{n=0}^{\infty} \) of such equations. Suppose the recurrence relation is of the form $$\displaystyle{ y_{n+1} + a_{n}y_{n} + b_{n}y_{n-1} = 0\qquad \mbox{ for}\quad n = 1,2,3,\ldots.}$$ (21.1) It seems so ...
openaire +2 more sources
Walter Gautschi is a giant in the field of linear recurrence relations. His concern is with stability in computing solutions \( \{y_{n}\}_{n=0}^{\infty} \) of such equations. Suppose the recurrence relation is of the form $$\displaystyle{ y_{n+1} + a_{n}y_{n} + b_{n}y_{n-1} = 0\qquad \mbox{ for}\quad n = 1,2,3,\ldots.}$$ (21.1) It seems so ...
openaire +2 more sources
Implementation of the recurrence relations of biorthogonality
Numerical Algorithms, 1992General algorithms for computing some generalized Padé-type approximants are given. The quality of the used approximants depends on the choosen functionals for measuring the quality. In the classical example of the series \(f(b)=\log(1+t)/t\) functionals are found which give better results than the usual ones.
openaire +2 more sources
Recurrence Relations for Powers
1979Publisher Summary This chapter explains the recurrence relations for powers. It presents the solution of equations of the form xp = N, where N is a given number, 0 < N < 1, and p is a real number, ½, ⅓, −1, for instance. The chapter discusses various sequences {xn} whose limit is the solution and whose terms are defined by recurrence relations ...
openaire +2 more sources
A recurrence relation for inclination functions
Celestial Mechanics, 1971When the terms of the series expansion for the gravitational potential of the Earth are expressed in terms of the orbital elements of an arbitrary Earth satellite, the orbital inclination,i, appears in each, term as the argument of a function of inclination only.
openaire +3 more sources
Drug-related recurrent meningitis
Journal of Infection, 1988A 56-year-old man presented with recurrent smear and culture-negative meningitis having ingested Ibuprofen before each episode. The association between Ibuprofen and meningitis has been well established in systemic lupus erythematosus but has been reported only rarely in previously healthy patients.
openaire +3 more sources
On recurrence relations for order statistics
Statistics & Probability Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the logarithmic evaluation of recurrence relations
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2018
In this chapter we complete the work initiated in Section 3.2 of [8] (see also Problems 5, page 79, and 6, page 31), showing how to solve a linear recurrence relation with constant coefficients and arbitrary order. We first need to properly define the objects involved, and we do this now.
openaire +2 more sources
In this chapter we complete the work initiated in Section 3.2 of [8] (see also Problems 5, page 79, and 6, page 31), showing how to solve a linear recurrence relation with constant coefficients and arbitrary order. We first need to properly define the objects involved, and we do this now.
openaire +2 more sources