Back to search

Old Dominion University

A Root Finding Algorithm for Parallel Architecture Machines

Abstract

dc:description.abstract

In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines. Given any user supplied function f(X), continuous on the interval Ao ≤ x ≤ B0, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered. A variation of the bisection method has been adapted for this purpose. At each level of iteration a single new approximation to the root in question is found. At any stage results achieved should be considerably more accurate than the results achieved by the use of any iterative method on a serial machine because of localization of the approximation. This has been made possible by the use of much smaller intervals than the interval used for bisection algorithms, in determining the root. A performance comparison of speed of the approximation process using an algorithm on the DAP and and the N-cube is presented.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Moitra, Stuti
Contributors dc:contributor
  • Chester E. Grosch
  • Mohammad Zubair
  • Thomas L. Jackson

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • <p>In Copyright. URI: <a href="http://rightsstatements.org/vocab/InC/1.0/">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Old Dominion University
Base URL
digitalcommons.odu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Moitra, Stuti. A Root Finding Algorithm for Parallel Architecture Machines. Thesis thesis, https://digitalcommons.odu.edu/computerscience_etds/161