Accession Number:

ADA000573

Title:

Parallel Rootfinding Algorithms.

Descriptive Note:

Interim rept.,

Corporate Author:

MICHIGAN STATE UNIV EAST LANSING DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1974-01-01

Pagination or Media Count:

118.0

Abstract:

Algorithms to find a simple root alpha of a continuous function f are considered which are suitable for implementation on an array type of parallel processing computer using N processing elements. Modified author abstract

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE