Results 251 to 260 of about 2,538,449 (300)
Recurrence relations for the super-Halley method [PDF]
Computers and Mathematics With Applications, 1998 In this paper we give sufficient conditions in order to assure the convergence of the super-Halley method in Banach spaces. We use a system of recurrence relations analogous to those given in the classical Newton-Kantorovich theorem, or those given for ...
M A Hernández, J M Gutierrez
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Certain Recurrence Relations
Mathematische Nachrichten, 1970AbstractIn this paper first we establish six recurrence relations for the H‐function with the help of certain formulae concerning generalized BESSEL function. Later on, we obtain recurrence relations for MEIJER'S G‐function, GAUSS'S hypergeometric function and BESSEL function.
Srivastava, Aruna, Gupta, K. C.
openaire +1 more source
Shortened recurrence relations for Bernoulli numbers [PDF]
Discrete Mathematics, 2009 Starting with two little-known results of Saalschütz, we derive a number of general recurrence relations for Bernoulli numbers. These relations involve an arbitrarily small number of terms and have Stirling numbers of both kinds as coefficients.
Karl Dilcher, Takashi Agoh
exaly +2 more sources
A Recurrence Related to the Bell Numbers
Integers, 2012Abstract.In this paper, we solve a general, four-parameter recurrence by both algebraic and combinatorial methods. The Bell numbers and some closely related sequences are solutions to the recurrence corresponding to particular choices of the parameters.
Toufik Mansour, Mark Shattuck 0001
openaire +2 more sources
Probabilistic recurrence relations
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991Summary: This paper is concerned with recurrence relations that arise frequently in the analysis of divide-and-conquer algorithms. In order to solve a problem instance of size \(x\), such an algorithm invests an amount of work \(a(x)\) to break the problem into subproblems of sizes \(h_1(x),h_2(x),\dots, h_k(x)\), and then proceeds to solve the ...
openaire +2 more sources
Perturbed Recurrence Relations
Numerical Algorithms, 2003The authors give some new relations between two families of polynomials defined by a three-term recurrence relation. They give a new method to study the behaviour of such polynomials. This method allows to solve the problem of losing information in the case of large perturbations since it gives the explicit representation of a perturbed family of ...
openaire +1 more source
Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
2016
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +1 more source
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +1 more source
Proceedings of the Edinburgh Mathematical Society, 1938
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +1 more source
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +1 more source