Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: Algebraic and analytic approaches collated
نویسنده
چکیده
Article history: Received 8 April 2013 Received in revised form 2 June 2014 Accepted 18 June 2014 Available online 8 July 2014 Communicated by H. Prodinger
منابع مشابه
Rational series and asymptotic expansion for linear homogeneous divide-and-conquer recurrences
Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been studied from the asymptotic standpoint. We show how a mechanical process permits to compute their asymptotic expansion. It is based on linear algebra, with Jordan...
متن کاملAsymptotics of linear divide-and-conquer recurrences
Asymptotics of divide-and-conquer recurrences is usually dealt either with elementary inequalities or with sophisticated methods coming from analytic number theory. Philippe Dumas proposes a new approach based on linear algebra. The example of the complexity of Karatsuba’s algorithm is used as a guide in this summary. The complexity analysis of divide-and-conquer algorithms gives rise to recurr...
متن کاملExact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous in the performances of these algorithms. Mellin transforms and Dirichlet series are used to attain precise asympto...
متن کاملThe Solution of Linear Probabilistic Recurrence Relations 1
Linear probabilistic divide-and-conquer recurrence relations arise when analyzing the running time of divide-and-conquer randomized algorithms. We consider first the problem of finding the expected value of the random process T (x), described as the output of a randomized recursive algorithm T . On input x , T generates a sample (h1, . . . , hk) from a given probability distribution on [0, 1]k ...
متن کاملNotes on Better Master Theorems for Divide-and-Conquer Recurrences
Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year. The dominant approach to solving such recurrences is known as the Master Method [2]. Recently, Akra and Bazzi [1] discovered a surprisingly elegant generalization of the Master Method that yields a very simple formula for solving most divideand-conquer recurrences. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 548 شماره
صفحات -
تاریخ انتشار 2014