On the solution of linear recurrence equations

Computational Optimization and Applications

Volumn 10, Issue 2, 1998, Pages 195-210

  Akra, Mohamad ^a   Bazzi, Louay ^a  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

Algorithm; Divide and conquer; Linear recurrence; Order of growth; Order transform; Running time

Indexed keywords

ALGORITHMS; FUNCTIONS; INTEGRATION; MAPPING; NUMERICAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING;

DIVIDE AND CONQUER; LINEAR RECURRENCE; ORDER OF GROWTH; ORDER TRANSFORM; RUNNING TIME;

LINEAR EQUATIONS; MATHEMATICAL TRANSFORMATIONS;

DIVIDE AND CONQUER RECURRENCES; LINEAR RECURRENCE EQUATIONS; ORDER TRANSFORM;

EID: 0032071728     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018373005182     Document Type: Article

References (5)

1. J.L.Bently, D.Haken, and J.B.Saxe. A general method for solving divide-and-conquer recurrences. SIGACT News, 12(3):6-44, 1980.
2. T.Cormen, C.Leiserson and R.Rivest. Introduction to Algorithms. McGraw-Hill, 1990, Chapter 4.
3. Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, 1968. Second edition, 1973.
4. C. L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968.
5. Paul W. Purdom, Jr., and Cynthia A. Brown. The Analysis of Algorithms. Holt, Rinehart, and Winston, 1985.