National Technical Reports Library - NTRL

National Technical Reports Library


Details
Actions:
Download PDFDownload XML
Download

A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations.


PB212080

Publication Date 1972
Personal Author Kogge, P. M.; Stone, H. S.
Page Count 35
Abstract An mth order recurrence problem is defined as the computation of the series x(1), z(2), ... x(N), where x(i) = fi(x(i-1),...x(i-m)) for some function f(i). This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Illiac 4. (Author)
Keywords
  • Computer programming
  • Algorithms
  • Parallel processors
  • Matrices(Mathematics)
  • Series(Mathematics)
  • Boundary value problems
  • Linear systems
  • Illiac 4 computers
  • Time varying systems
  • Computational complexity
Source Agency
  • National Science Foundation
NTIS Subject Category
  • 62B - Computer Software
Corporate Authors Stanford Univ., Calif. Stanford Electronics Labs.
Supplemental Notes Sponsored in part by IBM Corp., New York.
Document Type Technical Report
Title Note Technical rept. no. 25.
NTIS Issue Number 197222
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations.
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations.
PB212080

  • Computer programming
  • Algorithms
  • Parallel processors
  • Matrices(Mathematics)
  • Series(Mathematics)
  • Boundary value problems
  • Linear systems
  • Illiac 4 computers
  • Time varying systems
  • Computational complexity
  • National Science Foundation
  • 62B - Computer Software
Loading