Vectorization of Recursion Relations.

Abstract

Techniques for efficient vectorization of the simple recursive relation (x sub j) = (a sub j)(x sub (j-1)) + (d sub j) and the tridiagonal series of equations (a sub j)(x sub (j-1)) + (b sub j)(x sub J) + (c sub j)(x sub (j+1)) = (d sub j) are presented. Both problems are solved by a folding procedure similar to that used in computing the fast Fourier transform. The tridiagonal algorithm is a generalized form of the cyclic-reduction technique used by Hockney and Buneman.

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1975
Accession Number
ADA016582

Entities

People

  • Jay Paul Boris

Organizations

  • United States Naval Research Laboratory

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Equations
  • Fast Fourier Transforms
  • Fourier Transformation
  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Computer Programming and Software Development.
  • Neurodegenerative Parkinson's Disease and Rickettsial Disease handbook, including the data level of dopamine, BC, neurons, and PD.